# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
799853 |
2023-08-01T06:57:36 Z |
이동현(#10084) |
청소 (JOI20_sweeping) |
C++17 |
|
18000 ms |
38040 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> pos;
for(int i = 0; i < m + q; ++i){
int op = 4;
if(i >= m){
cin >> op;
}
if(op == 1){
int id;
cin >> id;
--id;
cout << pos[id][0] << ' ' << pos[id][1] << '\n';
}
else if(op == 2){
int len;
cin >> len;
for(auto&j:pos){
if(j[1] <= len){
j[0] = max(j[0], n - len);
}
}
}
else if(op == 3){
int len;
cin >> len;
for(auto&j:pos){
if(j[0] <= len){
j[1] = max(j[1], n - len);
}
}
}
else{
int x, y;
cin >> x >> y;
pos.push_back({x, y});
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
596 KB |
Output is correct |
2 |
Correct |
4 ms |
456 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Correct |
9 ms |
596 KB |
Output is correct |
5 |
Correct |
23 ms |
544 KB |
Output is correct |
6 |
Correct |
5 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
18059 ms |
38040 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
18050 ms |
37272 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
18050 ms |
37272 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
596 KB |
Output is correct |
2 |
Correct |
4 ms |
456 KB |
Output is correct |
3 |
Correct |
2 ms |
596 KB |
Output is correct |
4 |
Correct |
9 ms |
596 KB |
Output is correct |
5 |
Correct |
23 ms |
544 KB |
Output is correct |
6 |
Correct |
5 ms |
468 KB |
Output is correct |
7 |
Execution timed out |
18059 ms |
38040 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |