# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717223 | 2023-04-01T15:02:02 Z | ismayil | Examination (JOI19_examination) | C++17 | 3000 ms | 1504 KB |
#include<iostream> using namespace std; //#pragma GCC target ("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") const int N = 100'001; int n, q, ans; int x, y, z; int s[N], t[N]; int i; int main () { scanf("%d %d", &n, &q); for(i = 0;i<n;i++) { scanf("%d %d", &s[i], &t[i]); } while(q--) { ans=0; scanf("%d %d %d", &x, &y, &z); for(i = 0;i<n;i++) { int ff=(s[i]>=x); int ss=(t[i]>=y); int tt=(s[i]+t[i]>=z); ans+=ff&ss&tt; } printf("%d\n", ans); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 8 ms | 340 KB | Output is correct |
8 | Correct | 6 ms | 340 KB | Output is correct |
9 | Correct | 8 ms | 340 KB | Output is correct |
10 | Correct | 5 ms | 340 KB | Output is correct |
11 | Correct | 5 ms | 340 KB | Output is correct |
12 | Correct | 5 ms | 340 KB | Output is correct |
13 | Correct | 8 ms | 340 KB | Output is correct |
14 | Correct | 6 ms | 328 KB | Output is correct |
15 | Correct | 8 ms | 340 KB | Output is correct |
16 | Correct | 6 ms | 344 KB | Output is correct |
17 | Correct | 6 ms | 340 KB | Output is correct |
18 | Correct | 5 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3030 ms | 1504 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3030 ms | 1504 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 8 ms | 340 KB | Output is correct |
8 | Correct | 6 ms | 340 KB | Output is correct |
9 | Correct | 8 ms | 340 KB | Output is correct |
10 | Correct | 5 ms | 340 KB | Output is correct |
11 | Correct | 5 ms | 340 KB | Output is correct |
12 | Correct | 5 ms | 340 KB | Output is correct |
13 | Correct | 8 ms | 340 KB | Output is correct |
14 | Correct | 6 ms | 328 KB | Output is correct |
15 | Correct | 8 ms | 340 KB | Output is correct |
16 | Correct | 6 ms | 344 KB | Output is correct |
17 | Correct | 6 ms | 340 KB | Output is correct |
18 | Correct | 5 ms | 340 KB | Output is correct |
19 | Execution timed out | 3030 ms | 1504 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |