#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 20);
const double eps = 1e-6;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve () {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= k; i++) cin >> n >> m;
cout << (rng() % k);
cout << '\n';
}
bool testcases = 0;
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
320 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
316 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
320 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
12 |
Correct |
1 ms |
208 KB |
Output is correct |
13 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
328 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
20 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
21 |
Incorrect |
1 ms |
320 KB |
Output isn't correct |
22 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
23 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
24 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
25 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
26 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
27 |
Incorrect |
1 ms |
304 KB |
Output isn't correct |
28 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
29 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
30 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
31 |
Incorrect |
7 ms |
676 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
33 |
Incorrect |
1 ms |
324 KB |
Output isn't correct |
34 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
35 |
Incorrect |
12 ms |
1052 KB |
Output isn't correct |
36 |
Incorrect |
11 ms |
924 KB |
Output isn't correct |
37 |
Incorrect |
7 ms |
712 KB |
Output isn't correct |
38 |
Incorrect |
14 ms |
1096 KB |
Output isn't correct |
39 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
40 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
41 |
Incorrect |
3 ms |
456 KB |
Output isn't correct |
42 |
Incorrect |
5 ms |
584 KB |
Output isn't correct |
43 |
Incorrect |
9 ms |
660 KB |
Output isn't correct |
44 |
Incorrect |
13 ms |
1104 KB |
Output isn't correct |
45 |
Incorrect |
6 ms |
560 KB |
Output isn't correct |
46 |
Incorrect |
13 ms |
1060 KB |
Output isn't correct |
47 |
Incorrect |
16 ms |
1200 KB |
Output isn't correct |
48 |
Incorrect |
13 ms |
1096 KB |
Output isn't correct |
49 |
Incorrect |
16 ms |
1224 KB |
Output isn't correct |
50 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |