# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
462550 | 2021-08-10T18:01:43 Z | David1425 | Examination (JOI19_examination) | C++17 | 3000 ms | 1084 KB |
#include <bits/stdc++.h> #pragma GCC target("avx,avx2,fma") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") using namespace std; int a[100000], b[100000]; int n, q; int c, x, y, z; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> q; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (int t = 0; t < q; t++) { cin >> x >> y >> z; c = 0; for (int i = 0; i < n; i++) { if (a[i] >= x && b[i] >= y && a[i]+b[i] >= z) { c++; } } cout << c << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 332 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 52 ms | 344 KB | Output is correct |
8 | Correct | 52 ms | 344 KB | Output is correct |
9 | Correct | 52 ms | 332 KB | Output is correct |
10 | Correct | 53 ms | 348 KB | Output is correct |
11 | Correct | 55 ms | 340 KB | Output is correct |
12 | Correct | 53 ms | 460 KB | Output is correct |
13 | Correct | 47 ms | 348 KB | Output is correct |
14 | Correct | 48 ms | 348 KB | Output is correct |
15 | Correct | 53 ms | 336 KB | Output is correct |
16 | Correct | 23 ms | 332 KB | Output is correct |
17 | Correct | 40 ms | 332 KB | Output is correct |
18 | Correct | 12 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3056 ms | 1084 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3056 ms | 1084 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 332 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 52 ms | 344 KB | Output is correct |
8 | Correct | 52 ms | 344 KB | Output is correct |
9 | Correct | 52 ms | 332 KB | Output is correct |
10 | Correct | 53 ms | 348 KB | Output is correct |
11 | Correct | 55 ms | 340 KB | Output is correct |
12 | Correct | 53 ms | 460 KB | Output is correct |
13 | Correct | 47 ms | 348 KB | Output is correct |
14 | Correct | 48 ms | 348 KB | Output is correct |
15 | Correct | 53 ms | 336 KB | Output is correct |
16 | Correct | 23 ms | 332 KB | Output is correct |
17 | Correct | 40 ms | 332 KB | Output is correct |
18 | Correct | 12 ms | 332 KB | Output is correct |
19 | Execution timed out | 3056 ms | 1084 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |