#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define exit exit(false)
//#define here() cerr << "herewego\n";
#define show(x) cerr << #x << ": " << x << '\n';
#define int long long
//#define double long double
#define all(a) a.begin(), a.end()
#define whole(a, p, q) a+p, a+p+q
#define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int mxsz = 1e4 + 7;
int n, m, r, k , p, a[mxsz][mxsz];
char tp;
int x, y;
signed main () { ioio();
cin >> n >> m >> r >> k >> p;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
while (k--) {
cin >> tp >> x >> y;
} cout << 4;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
4 |
Incorrect |
4 ms |
876 KB |
Output isn't correct |
5 |
Incorrect |
14 ms |
748 KB |
Output isn't correct |
6 |
Incorrect |
77 ms |
7024 KB |
Output isn't correct |
7 |
Incorrect |
158 ms |
3692 KB |
Output isn't correct |
8 |
Incorrect |
112 ms |
3564 KB |
Output isn't correct |
9 |
Incorrect |
94 ms |
2796 KB |
Output isn't correct |
10 |
Incorrect |
101 ms |
2320 KB |
Output isn't correct |
11 |
Incorrect |
88 ms |
2412 KB |
Output isn't correct |
12 |
Incorrect |
104 ms |
2156 KB |
Output isn't correct |
13 |
Runtime error |
160 ms |
71148 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
14 |
Incorrect |
111 ms |
1772 KB |
Output isn't correct |
15 |
Incorrect |
101 ms |
2924 KB |
Output isn't correct |
16 |
Incorrect |
115 ms |
4856 KB |
Output isn't correct |
17 |
Runtime error |
176 ms |
71148 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
18 |
Runtime error |
147 ms |
70764 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
19 |
Incorrect |
109 ms |
4844 KB |
Output isn't correct |
20 |
Incorrect |
127 ms |
10672 KB |
Output isn't correct |