#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
vector<pair<int, int>> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, q;
cin >> n >> m >> q;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v.push_back({x, y});
}
for (int i = 0; i < q; i++) {
int type, x, y;
cin >> type >> x;
if (type == 1) {
x--;
cout << v[x].first << " " << v[x].second << "\n";
}
else if (type == 2) {
for (auto &p : v) {
if (p.first < n - x && p.second <= x) {
p.first = n - x;
}
}
}
else if (type == 3) {
for (auto &p : v) {
if (p.second < n - x && p.first <= x) {
p.second = n - x;
}
}
}
else {
cin >> y;
v.push_back({x, y});
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
512 KB |
Output is correct |
2 |
Correct |
9 ms |
512 KB |
Output is correct |
3 |
Correct |
7 ms |
512 KB |
Output is correct |
4 |
Correct |
15 ms |
512 KB |
Output is correct |
5 |
Correct |
29 ms |
512 KB |
Output is correct |
6 |
Correct |
9 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
18104 ms |
15236 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
18019 ms |
16336 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
18019 ms |
16336 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
512 KB |
Output is correct |
2 |
Correct |
9 ms |
512 KB |
Output is correct |
3 |
Correct |
7 ms |
512 KB |
Output is correct |
4 |
Correct |
15 ms |
512 KB |
Output is correct |
5 |
Correct |
29 ms |
512 KB |
Output is correct |
6 |
Correct |
9 ms |
512 KB |
Output is correct |
7 |
Execution timed out |
18104 ms |
15236 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |