# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086867 | alexdumitru | Abracadabra (CEOI22_abracadabra) | C++17 | 1 ms | 856 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 <iostream>
#include <vector>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
const int NMAX = 100;
const int QMAX = 100;
int n, q;
int a[NMAX + 2];
pair<int, int> qr[QMAX + 1];
int ans[QMAX + 1];
vector<int> idQ[NMAX + 1];
int nxt[NMAX + 2];
void read() {
cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[n + 1] = n + 1;
for (int i = 1; i <= q; i++) {
cin >> qr[i].first >> qr[i].second;
qr[i].first = min(qr[i].first, n - 1);
idQ[qr[i].first].push_back(i);
}
}
# | 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... |