# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861197 | vgtcross | Abracadabra (CEOI22_abracadabra) | C++17 | 3017 ms | 27216 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n, q;
cin >> n >> q;
vector<int> a(n), b(n);
for (int &i : a) cin >> i;
vector<array<int, 3>> que(q);
for (int i = 0; i < q; ++i) {
cin >> que[i][0] >> que[i][1];
que[i][2] = i;
}
sort(que.begin(), que.end());
vector<int> ans(q);
int j = 0;
for (int i = 0; true; ++i) {
while (j < q && que[j][0] == i) {
ans[que[j][2]] = a[que[j][1]-1];
++j;
}
int x = 0, y = 0, z = n/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |