#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define f first
#define s second
const int maxn = 1 << 17;
int n;
pii p[maxn];
vector<pii> seg[2 * maxn];
void init(int i, int l, int r) {
if(l == r) {
seg[i].push_back(p[i]);
}
int m = (l + r + 1) / 2;
init(i * 2, l, m - 1);
init(i * 2 + 1, m, r);
seg[i].reserve(seg[i * 2].size() + seg[i * 2 + 1].size());
for(const pii &j : seg[i * 2])
seg[i].push_back(j);
for(const pii &j : seg[i * 2 + 1])
seg[i].push_back(j);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
// assert(n <= 1000);
for(int i = 0; i < n; i++) {
cin >> p[i].f >> p[i].s;
}
cout << 0 << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
9 ms |
6520 KB |
Output isn't correct |
2 |
Incorrect |
10 ms |
6628 KB |
Output isn't correct |
3 |
Incorrect |
10 ms |
6728 KB |
Output isn't correct |
4 |
Incorrect |
9 ms |
6728 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
6728 KB |
Output isn't correct |
6 |
Incorrect |
11 ms |
6728 KB |
Output isn't correct |
7 |
Incorrect |
13 ms |
6776 KB |
Output isn't correct |
8 |
Incorrect |
9 ms |
6776 KB |
Output isn't correct |
9 |
Incorrect |
12 ms |
6776 KB |
Output isn't correct |
10 |
Incorrect |
10 ms |
6776 KB |
Output isn't correct |
11 |
Incorrect |
9 ms |
6776 KB |
Output isn't correct |
12 |
Incorrect |
11 ms |
6936 KB |
Output isn't correct |
13 |
Incorrect |
17 ms |
6968 KB |
Output isn't correct |
14 |
Incorrect |
14 ms |
6976 KB |
Output isn't correct |
15 |
Incorrect |
17 ms |
7140 KB |
Output isn't correct |
16 |
Incorrect |
27 ms |
7524 KB |
Output isn't correct |
17 |
Incorrect |
36 ms |
7652 KB |
Output isn't correct |
18 |
Runtime error |
46 ms |
15200 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
19 |
Runtime error |
49 ms |
15280 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
20 |
Incorrect |
55 ms |
15280 KB |
Output isn't correct |