problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(10010);
for (int i = 0; i < N; i++)
cin >> h[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(100010);
for (int i = 0; i < N; i++)
cin >> h[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
cnt++;
}
cout << cnt << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K, h[10100], ans = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K, h[102000], ans = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, K;
int h[501];
int count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K)
count++;
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
int h[100001];
int count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K)
count++;
}
cout << count << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, h[1000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, h[1000000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
count++;
}
}
cout << count << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int h[10000];
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
int count = 0;
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int h[100000];
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
int count = 0;
for (int i = 0;... | replace | 13 | 14 | 13 | 14 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, L;
cin >> N >> K;
vector<int> h;
L = 0;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
L++;
}
}
cout << L << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, L;
cin >> N >> K;
vector<int> h(N);
L = 0;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
if (h[i] >= K) {
L++;
}
}
cout << L << endl;
} | replace | 6 | 7 | 6 | 7 | -11 | |
p02898 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int N, K, A = 0;
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
int h;
scanf("%d", h);
if (h >= K) {
A++;
}
}
printf("%d", A);
return 0;
} | #include <stdio.h>
int main(void) {
int N, K, A = 0;
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
int h;
scanf("%d", &h);
if (h >= K) {
A++;
}
}
printf("%d", A);
return 0;
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[505];
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
ans++;
}
cout << ans;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[100005];
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
ans++;
}
cout << ans;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k;
int a[12345];
cin >> n >> k;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
sum++;
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
int a[1234567];
cin >> n >> k;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
sum++;
}
cout << sum << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, K, ans = 0;
int h[505];
scanf("%d%d", &N, &K);
for (int i = 1; i <= N; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i <= N; i++) {
if (h[i] >= K)
ans++;
}
printf("%d", ans);
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N, K, ans = 0;
int h[100005];
scanf("%d%d", &N, &K);
for (int i = 1; i <= N; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i <= N; i++) {
if (h[i] >= K)
ans++;
}
printf("%d", ans);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int k;
int i;
int a;
int h[500];
cin >> n;
cin >> k;
a = n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (h[i] < k) {
a = a - 1;
}
}
cout << a << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
int k;
int i;
int a;
int h[100000];
cin >> n;
cin >> k;
a = n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (h[i] < k) {
a = a - 1;
}
}
cout << a << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int a[500], n, k, i, cnt = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
if (k <= a[i])
cnt += 1;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a[100000], n, k, i, cnt = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
if (k <= a[i])
cnt += 1;
}
cout << cnt << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX_NUM 10 ^ 5
int main() {
int N, K, h[MAX_NUM], can_ride = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++) {
if (h[i] >= K)
can_ride++;
}
cout << can_ride << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX_NUM 100000
int main() {
int N, K, h[MAX_NUM], can_ride = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++) {
if (h[i] >= K)
can_ride++;
}
cout << can_ride << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02899 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, n, a[10001] = {0}, b[10001] = {0}, t;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> n;
a[i] = n;
}
for (i = 1; i <= N; i++) {
t = a[i]; // t=2
b[a[t]] = t; // b[a[2]]=2
// cout<<a[i]<<endl... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, i, n, a[100001] = {0}, b[100001] = {0}, t;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> n;
a[i] = n;
}
for (i = 1; i <= N; i++) {
t = a[i]; // t=2
b[a[t]] = t; // b[a[2]]=2
// cout<<a[i]<<en... | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> vec(N, vector<int>(N));
for (int i = 0; i < N; i++) {
cin >> vec.at(i).at(0);
vec.at(i).at(1) = i + 1;
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N; i++) {
cout << vec.at(i).at(1);
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> vec(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> vec.at(i).at(0);
vec.at(i).at(1) = i + 1;
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N; i++) {
cout << vec.at(i).at(1);
if ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define LINF 1e18
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<int> attend(N);
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
attend[A] = i;
}
for (int i = 1; i <= N; i++) {
cout <<... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define LINF 1e18
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
vector<int> attend(N + 5);
for (int i = 1; i <= N; i++) {
int A;
cin >> A;
attend[A] = i;
}
for (int i = 1; i <= N; i++) {
cou... | replace | 13 | 14 | 13 | 14 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | replace | 49 | 58 | 49 | 54 | TLE | |
p02899 | Python | Time Limit Exceeded | # #!/usr/bin/env python3
# # -*- coding: utf-8 -*-
def main():
N = int(input())
S = list(map(int, input().split()))
print(*[S.index(i + 1) + 1 for i in range(N)])
if __name__ == "__main__":
main()
| # #!/usr/bin/env python3
# # -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
result = []
for i, a in enumerate(A, start=1):
result.append([i, a])
result = sorted(result, key=lambda x: x[1])
print(*[i for i, a in result])
if __name__ == "__main... | replace | 6 | 8 | 6 | 14 | TLE | |
p02899 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
for i in range(1, N + 1):
print(A.index(i) + 1, end=" ")
| N = int(input())
A = list(map(int, input().split()))
import numpy as np
A = np.array(A)
print(" ".join([str(i + 1) for i in A.argsort()]))
| replace | 3 | 5 | 3 | 7 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, val, arr[10001];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> val;
arr[val] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, val, arr[100001];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> val;
arr[val] = i;
}
for (int i = 1; i <= n; i++)
cout << arr[i] << " ";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a[50001], A;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A;
a[A] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a[100001], A;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A;
a[A] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a[10000];
int i, j, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
a[j - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a[100000];
int i, j, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
a[j - 1] = i + 1;
}
for (i = 0; i < n; i++) {
cout << a[i] << " ";
}
cout << "\n";
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 10010;
int N;
int li[MAXN];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
int x;
cin >> x;
li[x] = i;
}
for (int i = 1; i <= N; i++) {
cout << li[i] << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int N;
int li[MAXN];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
int x;
cin >> x;
li[x] = i;
}
for (int i = 1; i <= N; i++) {
cout << li[i] << " ";
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i, n; i++) {
cin >> a[i];
}
vector<int> reverse(n);
for (int j = 0; j < n; j++) {
reverse[a[j] - 1] = j + 1;
}
for (int i = 0; i < n; i++) {
cout << reverse[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> reverse(n);
for (int j = 0; j < n; j++) {
reverse[a[j] - 1] = j + 1;
}
for (int i = 0; i < n; i++) {
cout << reverse[i] << endl;
}
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a.at(j) == i + 1) {
b.at(i) = j + 1;
}
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
b.at(a.at(i) - 1) = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b.at(i) << " ";
if (i == n -... | replace | 12 | 17 | 12 | 13 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int k = 1; k <= N; k++) {
if (a[i] == k) {
b[k - 1] = i + 1;
}
}
}
for (int i = ... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
b[a[i] - 1] = i + 1;
}
for (int i = 0; i < N - 1; i++) {
cout << b[i] << " ";
}
cout << b[N - 1] << endl;
}
| replace | 9 | 16 | 9 | 10 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
// 人数入力
int num;
cin >> num;
// 教室にいた人数を保存
vector<int> vecNum(num);
for (int i = 0; i < num; i++) {
cin >> vecNum.at(i);
}
// 順番を探索
vector<int> vecAns;
for (int i = 1; i <= num; i++) {
for (int j = 0; j < num; j++) {... | #include <iostream>
#include <vector>
using namespace std;
int main() {
// 人数入力
int num;
cin >> num;
// 教室にいた人数を保存
vector<int> vecNum(num);
for (int i = 0; i < num; i++) {
cin >> vecNum.at(i);
}
// 順番を探索
vector<int> vecAns(num);
for (int i = 0; i < num; i++) {
vecAns.at(vecNum[i] - 1) = ... | replace | 17 | 24 | 17 | 20 | TLE | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
long long N;
pair<int, int> p[10007];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i - 1].first;
p[i - 1].second = i;
}
sort(p, p + N);
for (int i = 1; i <= N; i++) {
cout << p[i - 1].secon... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
long long N;
pair<int, int> p[100007];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i - 1].first;
p[i - 1].second = i;
}
sort(p, p + N);
for (int i = 1; i <= N; i++) {
cout << p[i - 1].seco... | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
rep(i, n + 1) {
rep(j, n) {
if (a[j] == i)
b[i - 1] = j + 1;
}
}
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> b(n);
rep(i, n) { b[a[i] - 1] = i + 1; }
rep(i, n) cout << b[i] << " ";
cout << endl;
} | replace | 10 | 16 | 10 | 11 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int arr[1000000];
int main() {
int n, temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
arr[temp - 1] = i + 1;
}
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << "\n";
return 1;
} | #include <bits/stdc++.h>
using namespace std;
int arr[1000000];
int main() {
int n, temp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
arr[temp - 1] = i + 1;
}
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << "\n";
return 0;
}
| replace | 14 | 15 | 14 | 15 | 1 | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
p[A[i]] = i;
}
for (int i = 1; i <= N; i++) {
cout << p[i] + 1 << " ";
}
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
vector<int> p(N + 1);
for (int i = 0; i < N; i++) {
cin >> A[i];
p[A[i]] = i;
}
for (int i = 1; i <= N; i++) {
cout << p[i] + 1 << " ";
}
cout << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
using namespace std;
int main(void) {
int N;
int A[10001];
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
A[a] = i;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << " ";
}
return 0;
} | #include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
using namespace std;
int main(void) {
int N;
int A[100001];
cin >> N;
for (int i = 1; i <= N; i++) {
int a;
cin >> a;
A[a] = i;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << " ";
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02899 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
b = [None] * n
print(str(a.index(1) + 1), end=" ")
for i in range(1, n):
print(str(a.index(i + 1) + 1), end=" ")
print()
| import sys
import collections
import bisect
def main():
n = int(input())
A = list(map(int, input().split()))
B = [0] * n
for i in range(n):
B[A[i] - 1] = str(i + 1)
print(" ".join(B))
if __name__ == "__main__":
main()
| replace | 0 | 7 | 0 | 16 | TLE | |
p02899 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = []
counter = 1
while counter <= n:
for see in a:
if see == counter:
ans.append(a.index(see) + 1)
counter += 1
break
[print(x, end=" ") for x in ans]
| n = int(input())
a = list(map(int, input().split()))
L = {}
for i in range(len(a)):
L[i] = a[i]
sort_L = sorted(L.items(), key=lambda x: x[1])
[print(j[0] + 1, end=" ") for j in sort_L]
| replace | 2 | 11 | 2 | 7 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
vector<int> ans(n);
for (int i = 0; i < n; i++) {
int p = vec.at(i);
ans.at(p) = i;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
vector<int> ans(n);
for (int i = 0; i < n; i++) {
int p = vec.at(i);
ans.at(p - 1) = i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < n; j++) {
if (a[j] == i) {
b[i - 1]... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
// for(int i=1;i<=n;i++){
// for(int j=0;j<n;j++){
// if(a[j]==i){
// b[i-... | replace | 13 | 19 | 13 | 22 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll(i) = 0, (i##_len) = (n); (i) < (i##_len); (i)++)
#define rep2(i, a, b) \
for (ll(i) = (a), (i##_len) = (b); (i) <= (i##_len); (i++))
#define Yes(n) cout << ((n) ? "Yes\n" :... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll(i) = 0, (i##_len) = (n); (i) < (i##_len); (i)++)
#define rep2(i, a, b) \
for (ll(i) = (a), (i##_len) = (b); (i) <= (i##_len); (i++))
#define Yes(n) cout << ((n) ? "Yes\n" :... | replace | 61 | 68 | 61 | 64 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> ans(n);
for (i... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> ans(n);
rep(i,... | replace | 14 | 21 | 14 | 15 | TLE | |
p02899 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
int main(void) {
char l2[128];
int N = 0;
scanf("%d", &N);
scanf("%c", l2);
int answer[10001] = {};
for (int i = 1; i < N + 1; ++i) {
int tmp = 0;
scanf("%d", &tmp);
answer[tmp] = i;
}
for (int i = 1; i < N + 1; ++i) {
printf("%d ", answer[i]);
}
... | #include <cstdio>
#include <cstdlib>
int main(void) {
char l2[128];
int N = 0;
scanf("%d", &N);
scanf("%c", l2);
int answer[100001] = {};
for (int i = 1; i < N + 1; ++i) {
int tmp = 0;
scanf("%d", &tmp);
answer[tmp] = i;
}
for (int i = 1; i < N + 1; ++i) {
printf("%d ", answer[i]);
}
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.at(i) = a;
}
vector<int> ans(N);
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(j) == i) {
ans.at(i - 1) = j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.at(i) = a;
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(A.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
cout << ans.a... | replace | 13 | 19 | 13 | 15 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
vector<int> neww(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
for (int i = 1; i <= n; i++) {
neww[v[i - 1]] = i;
}
for (int i = 1; i <= n; i++) {
cout << neww[i] << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
vector<int> neww(n + 1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
for (int i = 1; i <= n; i++) {
neww[v[i - 1]] = i;
}
for (int i = 1; i <= n; i++) {
cout << neww[i] ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[10005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
a[k] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
} | #include <iostream>
using namespace std;
int a[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
a[k] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02899 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
x = []
x = [0 for i in range(n)]
for j in range(n):
x.pop(a[j] - 1)
x.insert(a[j] - 1, j + 1)
print(" ".join(map(str, x)))
| n = int(input())
a = list(map(int, input().split()))
x = []
for i in range(n):
x.append((a[i], i + 1))
x.sort()
y = []
for i in range(n):
y.append(x[i][1])
print(" ".join(map(str, y)))
| replace | 3 | 8 | 3 | 10 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int student[100], a_s[100];
for (int i = 1; i <= n; i++) {
cin >> student[i];
}
for (int i = 1; i <= n; i++) {
a_s[student[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << a_s[i] << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int student[1000001], a_s[1000001];
for (int i = 1; i <= n; i++) {
cin >> student[i];
}
for (int i = 1; i <= n; i++) {
a_s[student[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << a_s[i] << " ";
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02899 | Python | Time Limit Exceeded | N = int(input())
A = [int(i) for i in input().split()]
ans = []
for i in range(1, N + 1):
ans.append(A.index(i) + 1)
print(*ans)
| N = int(input())
A = [int(i) for i in input().split()]
ans = [0] * N
for i in range(N):
ans[A[i] - 1] = i + 1
print(*ans)
| replace | 3 | 6 | 3 | 6 | TLE | |
p02899 | Python | Time Limit Exceeded | import sys
n = int(sys.stdin.readline())
alist = [int(x) for x in sys.stdin.readline().split()]
attends = [alist.index(y) + 1 for y in sorted(alist)]
print(*attends)
| n = int(input())
attends = dict(enumerate(list(map(int, input().split())), start=1))
attends_sorted = sorted(attends.items(), key=lambda x: x[1])
arr = [x[0] for x in attends_sorted]
print(*arr)
| replace | 0 | 6 | 0 | 5 | TLE | |
p02899 | Python | Time Limit Exceeded | import numpy as np
N = int(input())
A = list(map(int, input().split()))
T = [0] * N
for i in range(N):
t = np.argmin(A)
T[i] = t + 1
A[t] = N + 1
print(*T)
| import numpy as np
N = int(input())
A = list(map(int, input().split()))
T = [0] * N
for i in range(N):
T[A[i] - 1] = i + 1
print(*T)
| replace | 6 | 9 | 6 | 7 | TLE | |
p02899 | Python | Time Limit Exceeded | import sys
input = sys.stdin.readline
n = int(input())
a = [int(i) for i in input().split(" ")]
sorted_a = sorted(a)
for value in sorted_a:
print(a.index(value) + 1, end=" ")
print()
| import sys
input = sys.stdin.readline
n = int(input())
a = [int(i) for i in input().split(" ")]
dict = {}
for i, value in enumerate(a):
dict[value] = i + 1
a.sort()
for i in a:
print(dict[i], end=" ")
print()
| replace | 6 | 9 | 6 | 14 | TLE | |
p02899 | Python | Time Limit Exceeded | import numpy as np
n = int(input())
a_list = np.array(list(map(int, input().split())))
# a_list = np.array([3,4,2,1,5])
ans_list = a_list.argsort() + 1
ans = str(ans_list[0])
for i in ans_list[1:]:
ans = ans + " " + str(i)
print(ans)
| import numpy as np
n = int(input())
a_list = np.array(list(map(int, input().split())))
# a_list = np.array([3,4,2,1,5])
ans_list = a_list.argsort() + 1
print(" ".join(map(str, ans_list)))
| replace | 7 | 13 | 7 | 8 | TLE | |
p02899 | Python | Runtime Error | import numpy as np
N = int(input())
A = list(map(int, input().split()))
A = np.array(A)
AA = np.argsort(A) + 1
print(AA.to_list())
| import numpy as np
N = int(input())
A = list(map(int, input().split()))
A = np.array(A)
AA = np.argsort(A) + 1
print(*AA)
| replace | 8 | 9 | 8 | 9 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> st;
rep(i, n) {
rep(j, n) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> st(n);
rep(i, n) { st.at(a.at(i) - ... | replace | 15 | 24 | 15 | 18 | TLE | |
p02899 | Python | Time Limit Exceeded | N = int(input())
A_list = list(map(int, input().split()))
sorted_A_list = sorted(A_list)
sorted_A_list
for a in sorted_A_list:
print(A_list.index(a) + 1, end=" ")
| N = int(input())
A_list = list(map(int, input().split()))
index_add_A_list = []
for i, A in enumerate(A_list):
index_add_A_list.append([i, A])
sorted_index_add_A_list = sorted(index_add_A_list, key=lambda x: x[1])
for a in sorted_index_add_A_list:
print(a[0] + 1)
| replace | 2 | 6 | 2 | 8 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> res(N);
for (int i = 1; i < N + 1; i++) {
for (int j = 0; j < N; j++) {
if (A[j] == i) {
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> rev(N);
rep(i, N) rev[A[i] - 1] = i + 1;
rep(i, N) cout << rev[i] << endl;
} | replace | 11 | 27 | 11 | 14 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
for (int i = 1; i <= n; i++)
ans[a[i - 1]] = i;
for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
for (int i = 0; i < n; i++)
ans[a[i] - 1] = i + 1;
for (int i = 0; i... | replace | 13 | 16 | 13 | 16 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define debug(X) \
{ cerr << '\n' << (#X) << " = " << (X) << '\n'; }
// #define cerr if(0)cerr
typedef long long ll;
typedef unsigne... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define debug(X) \
{ cerr << '\n' << (#X) << " = " << (X) << '\n'; }
// #define cerr if(0)cerr
typedef long long ll;
typedef unsigne... | replace | 18 | 19 | 18 | 19 | 0 | |
p02899 | C++ | Runtime Error | #include <stdio.h>
#include <vector>
int main(void) {
int n, a;
scanf("%d", &n);
std::vector<int> vec(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
vec[a] = i + 1;
}
for (int i = 0; i < n; i++) {
printf("%d ", vec[i]);
}
return 0;
} | #include <stdio.h>
#include <vector>
int main(void) {
int n, a;
scanf("%d", &n);
std::vector<int> vec(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
vec[a - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
printf("%d ", vec[i]);
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct po {
int x, y;
};
bool cmp(po a, po b) { return a.x < b.x; }
int main() {
int n;
while (cin >> n) {
po a[10100];
for (int i = 1; i <= n; i++) {
cin >> a[i].x;
a[i].y = i;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
struct po {
int x, y;
};
bool cmp(po a, po b) { return a.x < b.x; }
int main() {
int n;
while (cin >> n) {
po a[101000];
for (int i = 1; i <= n; i++) {
cin >> a[i].x;
a[i].y = i;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i... | replace | 10 | 11 | 10 | 11 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] == i) {
cout << j << " ";
if (i == n) {
cout << endl;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] == i) {
cout << j << " ";
if (i == n) {
cout << endl;
}
... | insert | 17 | 17 | 17 | 18 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> ans(n);
for (int x = 0; x < n; x++) {
for (int i = 0; i < n; i++) {
if (a.at(i) == x + 1) {
ans.at(x) = i + 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> ans(n);
for (int i = 0; i < n; i++) {
ans.at(a.at(i) - 1) = i + 1;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i);
if (i == n... | replace | 13 | 19 | 13 | 15 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A[j] == i + 1) {... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
B[A[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) ... | replace | 19 | 25 | 19 | 20 | TLE | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[10005];
int main() {
int n, num;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> num;
a[num] = i;
}
for (int i = 1; i <= n; ++i) {
cout << a[i] << ' ';
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int a[100005];
int main() {
int n, num;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> num;
a[num] = i;
}
for (int i = 1; i <= n; ++i) {
cout << a[i] << ' ';
}
cout << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
vector<int> B(N);
rep(i, N) B.at(A.at(B.at(i))) = i + 1;
rep(i, N) cout << B.at(i) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
vector<int> B(N);
rep(i, N) B.at(A.at(i) - 1) = i + 1;
rep(i, N) cout << B.at(i) << " ";
}
| replace | 12 | 14 | 12 | 14 | 0 | |
p02899 | C++ | Time Limit Exceeded |
/* monkukui 競技プログラミング用のテンプレート (ここから) */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... |
/* monkukui 競技プログラミング用のテンプレート (ここから) */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | replace | 81 | 82 | 81 | 82 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i ... | replace | 14 | 21 | 14 | 20 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for (int i = 0; i < n; ++... | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for (int i = 0; i < n; ++... | replace | 20 | 28 | 20 | 21 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
vector<int> vec(10);
for (int i = 0; i < n; ++i) {
cin >> a;
vec.at(a - 1) = i + 1;
}
for (int j = 0; j < n; ++j) {
cout << vec.at(j);
if (j < n - 1) {
cout << " ";
}
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
cin >> a;
vec.at(a - 1) = i + 1;
}
for (int j = 0; j < n; ++j) {
cout << vec.at(j);
if (j < n - 1) {
cout << " ";
}
}
cout << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], ans[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[i] = 0;
}
int i = 0, k = 0;
while (k + 1 != n + 1) {
if (i == n) {
i = 0;
}
if (k + 1 == a[i]) {
ans[k] = i + 1;
k++;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n], ans[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[a[i] - 1] = i + 1;
}
for (int j = 0; j < n - 1; j++) {
cout << ans[j] << " ";
}
cout << ans[n - 1] << endl;
return 0;
}
| replace | 9 | 24 | 9 | 10 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < n; j++) {
if (a[j] == i) {
cout << j + 1 << " ";
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int a1[n];
for (int i = 0; i < n; i++) {
a1[a[i] - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << a1[i] << " ";
}
return 0;
} | replace | 10 | 17 | 10 | 16 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) {
rep(j, n) {
if (a[j] == i + 1) {
ans[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) { ans[a[i] - 1] = i + 1; }
rep(i, n) { cout << ans[i] <<... | replace | 12 | 19 | 12 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> order(n);
for (int i = 1; i <= n; i++) {
order[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << order[i] << " ";
}
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> order(n + 1);
for (int i = 1; i <= n; i++) {
order[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
cout << order[i] << " ";
}
retu... | replace | 12 | 13 | 12 | 13 | 0 | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #in... | replace | 110 | 111 | 110 | 111 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> vec.at(i);
}
for (int j = 0; j < N; ++j) {
int a = vec.at(j);
V.at(a) = j;
}
for (int k = 0; k < N; ++k) {
cout << V.at(k) << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> V(N);
for (int i = 0; i < N; ++i) {
cin >> vec.at(i);
}
for (int j = 0; j < N; ++j) {
int a = vec.at(j) - 1;
V.at(a) = j + 1;
}
for (int k = 0; k < N; ++k) {
cout << V.at(k) << ... | replace | 12 | 14 | 12 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02899 | C++ | Runtime Error | #include <iostream>
using namespace ::std;
int main() {
int n, k, i, j;
cin >> n;
int h[n + 1];
for (i = 1; i <= n; i++) {
cin >> j;
h[j] = i;
}
for (i = 1; i <= n; i++) {
cout << h[i] + " ";
}
} | #include <iostream>
using namespace ::std;
int main() {
int n, k, i, j;
cin >> n;
int h[n + 1];
for (i = 1; i <= n; i++) {
cin >> j;
h[j] = i;
}
for (i = 1; i <= n; i++) {
cout << h[i];
cout << " ";
}
} | replace | 11 | 12 | 11 | 13 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, tmp;
int id[10000];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> tmp;
id[tmp - 1] = i;
}
for (int i = 0; i < n; ++i) {
cout << id[i] << " ";
}
cout << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, tmp;
int id[100000];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> tmp;
id[tmp - 1] = i;
}
for (int i = 0; i < n; ++i) {
cout << id[i] << " ";
}
cout << "\n";
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int o[n];
rep(i, n) cin >> o[i];
rep(i, n) {
rep(j, n) {
if (o[j] == i + 1) {
cout << j + 1 << " ";
}
}
}
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int ans[n];
// rep(i,n){
// rep(j,n){
// if(a[j] == i + 1){
// ans[j] << j + 1;
// }
// }
// }
rep(i, n) a... | replace | 6 | 15 | 6 | 19 | TLE | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a;
int l;
rep(i, n) {
cin >> l;
a.push_back(l);
}
rep(i, n) {
rep(j, n) {
if (i + 1 == a[j]) {
cout << j + 1 << " ";
}
}
}
}
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> ans(n);
rep(j, n) ans[a[j] - 1] = j + 1;
rep(k, n) cout << ans[k] << " ";
}
int main() {
solve();
return 0;
} | replace | 7 | 20 | 7 | 12 | TLE | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
uint64_t getZ() {
uint64_t v = 0;
int c;
while ((c = getchar_unlocked()) >= '0')
v = v * 10 + c - '0';
return v;
}
template <int BUFSIZE> struct ans_buf {
char buf[BUFSIZE];
int i;
ans_buf() : i(0) {}
... | #include <algorithm>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
uint64_t getZ() {
uint64_t v = 0;
int c;
while ((c = getchar_unlocked()) >= '0')
v = v * 10 + c - '0';
return v;
}
template <int BUFSIZE> struct ans_buf {
char buf[BUFSIZE];
int i;
ans_buf() : i(0) {}
... | replace | 30 | 31 | 30 | 31 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[10010];
int main() {
int n;
while (cin >> n) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[x] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i];
if (i == n)
cout << endl;
e... | #include <bits/stdc++.h>
using namespace std;
int a[100100];
int main() {
int n;
while (cin >> n) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[x] = i;
}
for (int i = 1; i <= n; i++) {
cout << a[i];
if (i == n)
cout << endl;
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int list[10001] = {0};
int N = 0;
int temp = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
list[temp - 1] = i;
} // for
for (int i = 0; i < N; i++) {
cout << list[i] + 1 << " ";
} ... | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int list[100001] = {0};
int N = 0;
int temp = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
list[temp - 1] = i;
} // for
for (int i = 0; i < N; i++) {
cout << list[i] + 1 << " ";
}... | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int B[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int j = 0; j < N; j++) {
for (int k = 0; k < N; k++) {
if (A[k] == j + 1) {
B[j] = k + 1;
}
}
}
for (int a = 0; a < ... | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int B[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int j = 0; j < N; j++) {
int x = A[j];
B[x - 1] = j + 1;
}
for (int a = 0; a < N; a++) {
cout << B[a];
cout << " ";
}
retur... | replace | 13 | 18 | 13 | 15 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[10005], b[10005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]] = i;
}
for (int i = 1; i <= n - 1; i++) {
cout << b[i] << " ";
}
cout << b[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]] = i;
}
for (int i = 1; i <= n - 1; i++) {
cout << b[i] << " ";
}
cout << b[n];
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a[n];
int b[n];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[a[i] - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> rev(N);
for (int i = 0; i < N; i++)
rev[A[i] - 1] = i + 1;
for (int i = 0; i < N; i++)
cout << rev[i] << endl;
}
| replace | 4 | 17 | 4 | 15 | -11 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
for (int j = 1; j < N + 1; j++) {
if (A.at(j) == i) {
B.at(i) = j;
br... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N + 1);
for (int i = 1; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N + 1; i++) {
B.at(A.at(i)) = i;
}
for (int i = 1; i < N + 1; i++) {
cout << B.at(i) << " ";
}
... | replace | 12 | 18 | 12 | 13 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(a.at(i)) = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b.at(i);
if (i == n - 1) {
cout << endl;
} else {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
b.at(a.at(i) - 1) = i + 1;
}
for (int i = 0; i < n; i++) {
cout << b.at(i);
if (i == n - 1) {
cout << endl;
} else {
... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using vec = vector<int>;
using intk = int64_t;
int main() {
int N;
cin >> N;
vec A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (i == A[j]) {
if (i != N)
cout << j + 1... | #include <bits/stdc++.h>
using namespace std;
using vec = vector<int>;
using intk = int64_t;
int main() {
int N;
cin >> N;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = make_pair(a, i + 1);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; i++) {
cout... | replace | 8 | 20 | 8 | 21 | TLE | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int ans_order[10010];
int A;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A;
ans_order[A - 1] = i;
}
for (int idx = 0; idx < N; idx++) {
cout << ans_order[idx];
if (idx == N - 1) {
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int ans_order[100010];
int A;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A;
ans_order[A - 1] = i;
}
for (int idx = 0; idx < N; idx++) {
cout << ans_order[idx];
if (idx == N - 1) {... | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
inline ll read() {
ll res = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -f;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
res = (res << 3) + (res << 1) + ch - '0';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
inline ll read() {
ll res = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -f;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
res = (res << 3) + (res << 1) + ch - '0';
... | replace | 27 | 28 | 27 | 28 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#includ... | replace | 31 | 36 | 31 | 32 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(N));
for (int i = 0; i < N; ++i) {
cin >> A.at(i).at(0);
A.at(i).at(1) = i + 1;
}
sort(A.begin(), A.end());
for (int i = 0; i < N; ++i) {
cout << A.at(i).at(1) << " ";
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(2));
for (int i = 0; i < N; ++i) {
cin >> A.at(i).at(0);
A.at(i).at(1) = i + 1;
}
sort(A.begin(), A.end());
for (int i = 0; i < N; ++i) {
cout << A.at(i).at(1) << " ";
}
cout <... | replace | 6 | 7 | 6 | 7 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 1; i <= N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(j) == i) {
cout << j + 1 << endl;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
B.at(A.at(i) - 1) = i + 1;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << endl;
}
}
| replace | 10 | 16 | 10 | 16 | TLE | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int qai[10100], n, t;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
qai[t] = i + 1;
}
for (int j = 1; j <= n; j++)
cout << qai[j] << " ";
cout << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int qai[101000], n, t;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
qai[t] = i + 1;
}
for (int j = 1; j <= n; j++)
cout << qai[j] << " ";
cout << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> answer(n);
for (int i = 0; i < n; i++) {
int m;
cin >> m;
answer[m] = i;
}
for (int i : answer) {
cout << i << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> answer(n);
for (int i = 0; i < n; i++) {
int m;
cin >> m;
answer[m - 1] = i + 1;
}
for (int i : answer) {
cout << i << endl;
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0, a; i < n; i++) {
cin >> a;
v[a] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << v[i] << ' ';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0, a; i < n; i++) {
cin >> a;
v[a - 1] = i + 1;
}
for (int i = 0; i < n; i++) {
cout << v[i] << ' ';
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < n; j++) {
if (a.at(j) == i)
cout << j + 1 << " ";
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<int> b(n);
for (int i = 0; i < n; i++)
b.at(a.at(i) - 1) = i + 1;
for (int i = 0; i < n; i++)
cout << b.at(i) << " ";
} | replace | 10 | 16 | 10 | 17 | TLE | |
p02899 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i_, start, end) for (ll i_ = (ll)start; i_ < (ll)end; i_++)
#define print(a) cout << a << endl... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i_, start, end) for (ll i_ = (ll)start; i_ < (ll)end; i_++)
#define print(a) cout << a << endl... | replace | 21 | 22 | 21 | 22 | 0 | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
int array[10000] = {};
vector<pair<int, int>> vect;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> array[i];
}
for (int i = 0; i < N; i++) {
vect.push_back(std::make_pair(array[i], i + 1));
}
sort(vect.b... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
int array[100000] = {};
vector<pair<int, int>> vect;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> array[i];
}
for (int i = 0; i < N; i++) {
vect.push_back(std::make_pair(array[i], i + 1));
}
sort(vect.... | replace | 7 | 8 | 7 | 8 | 0 | |
p02899 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = ll(a); i <= ll(b); i++)
int main() {
ll x, abc = 0, m, n, k, cnt = 0;
cin >> n;
ll a[n + 1];
vector<ll> v;
v.push_back(0);
REP(i, 1, n) {
cin >> x;
a[x] = i;
}
REP(i, 1, n) {
REP(j, 1, n) {
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (ll i = ll(a); i <= ll(b); i++)
int main() {
ll x, abc = 0, m, n, k, cnt = 0;
cin >> n;
ll a[n + 1];
vector<ll> v;
v.push_back(0);
REP(i, 1, n) {
cin >> x;
a[x] = i;
}
REP(i, 1, n)
cout << a[i] << " ";... | replace | 14 | 22 | 14 | 16 | TLE | |
p02899 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
a[i] = make_pair(b, i + 1);
}
sort(a.begin(), a.end());
for (int j = 0; j < n; ++j) {
cout << a[j].second;
if (j == n - 1)
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
a[i] = make_pair(b, i + 1);
}
sort(a.begin(), a.end());
for (int j = 0; j < n; ++j) {
cout << a[j].second;
if (j == n - 1)
cout... | replace | 6 | 7 | 6 | 7 | -11 | |
p02899 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int p = 1;
for (int j = 0; j < N; j++) {
for (int i = 0; i < N; i++) {
if (A[i] == p) {
cout << i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
vec[A[i] - 1] = i + 1;
}
for (int i = 0; i < N; i++) {
... | replace | 12 | 20 | 12 | 18 | TLE | |
p02899 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n;
cin >> n;
std::vector<int> a(n);
std::vector<int> b(n);
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
b[a[i]] = i + 1;
for (i = 1; i < n + 1; i++)
cout << b[i] << " ";
cout << endl;
ret... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n;
cin >> n;
std::vector<int> a(n);
std::vector<int> b(n);
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
b[a[i] - 1] = i + 1;
for (i = 0; i < n; i++)
cout << b[i] << " ";
cout << endl;
ret... | replace | 14 | 16 | 14 | 16 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.