# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586903 | eecs | Tenis (COI19_tenis) | C++17 | 1092 ms | 6268 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;
const int maxn = 100010;
int n, q, p[3][maxn], tmp[3][maxn];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> q;
for (int i : {0, 1, 2}) {
for (int j = 1; j <= n; j++) {
cin >> p[i][j], tmp[i][p[i][j]] = j;
}
}
while (q--) {
int op, x, y, z;
cin >> op >> x;
if (op == 1) {
set<int> S;
for (int i = 1; i <= n; i++) {
for (int j : {0, 1, 2}) {
S.insert(p[j][i]);
}
if (S.size() == i) {
cout << (S.count(x) ? "DA\n" : "NE\n"); break;
}
}
} else {
cin >> y >> z, x--;
swap(p[x][tmp[x][y]], p[x][tmp[x][z]]);
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |