# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
788750 | 2023-07-20T14:46:04 Z | prefixorsuuffiixx | Examination (JOI19_examination) | C++14 | 3000 ms | 1916 KB |
#include <iostream> #pragma GCC target ("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,unroll-loops") using namespace std; long long ans; int x,y,z; int n,m; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); scanf("%d %d" , &n , &m); int a[n],b[n]; for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]); while(m--){ ans = 0; scanf("%d %d %d" , &x , &y , &z); for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z); printf("%d\n" , ans); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 328 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 320 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 5 ms | 468 KB | Output is correct |
8 | Correct | 5 ms | 468 KB | Output is correct |
9 | Correct | 5 ms | 468 KB | Output is correct |
10 | Correct | 5 ms | 340 KB | Output is correct |
11 | Correct | 4 ms | 340 KB | Output is correct |
12 | Correct | 4 ms | 336 KB | Output is correct |
13 | Correct | 5 ms | 468 KB | Output is correct |
14 | Correct | 5 ms | 452 KB | Output is correct |
15 | Correct | 5 ms | 460 KB | Output is correct |
16 | Correct | 4 ms | 336 KB | Output is correct |
17 | Correct | 5 ms | 332 KB | Output is correct |
18 | Correct | 5 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3050 ms | 1916 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3050 ms | 1916 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 328 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 320 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 5 ms | 468 KB | Output is correct |
8 | Correct | 5 ms | 468 KB | Output is correct |
9 | Correct | 5 ms | 468 KB | Output is correct |
10 | Correct | 5 ms | 340 KB | Output is correct |
11 | Correct | 4 ms | 340 KB | Output is correct |
12 | Correct | 4 ms | 336 KB | Output is correct |
13 | Correct | 5 ms | 468 KB | Output is correct |
14 | Correct | 5 ms | 452 KB | Output is correct |
15 | Correct | 5 ms | 460 KB | Output is correct |
16 | Correct | 4 ms | 336 KB | Output is correct |
17 | Correct | 5 ms | 332 KB | Output is correct |
18 | Correct | 5 ms | 340 KB | Output is correct |
19 | Execution timed out | 3050 ms | 1916 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |