# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1003469 | 2024-06-20T11:25:24 Z | ZeroCool | Examination (JOI19_examination) | C++14 | 3000 ms | 3420 KB |
#include <bits/stdc++.h> using namespace std; #define int long long //#define ll long long #define ar array #define ld long double const int N = 2005; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") signed main(){ios::sync_with_stdio(false);cin.tie(0); int n, q; cin>>n>>q; ar<int, 2> A[n]; for(int i = 0;i < n;i++)cin>>A[i][0]>>A[i][1]; while(q--){ int a, b, c; cin>>a>>b>>c; int ans = 0; for(int i = 0;i < n;i++){ if(A[i][0] >= a && A[i][1] >= b && (A[i][0] + A[i][1]) >= c)ans++; } cout<<ans<<'\n'; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 29 ms | 648 KB | Output is correct |
8 | Correct | 30 ms | 600 KB | Output is correct |
9 | Correct | 30 ms | 604 KB | Output is correct |
10 | Correct | 31 ms | 348 KB | Output is correct |
11 | Correct | 31 ms | 348 KB | Output is correct |
12 | Correct | 28 ms | 344 KB | Output is correct |
13 | Correct | 31 ms | 636 KB | Output is correct |
14 | Correct | 31 ms | 604 KB | Output is correct |
15 | Correct | 31 ms | 604 KB | Output is correct |
16 | Correct | 16 ms | 348 KB | Output is correct |
17 | Correct | 21 ms | 596 KB | Output is correct |
18 | Correct | 7 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3090 ms | 3420 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3090 ms | 3420 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 29 ms | 648 KB | Output is correct |
8 | Correct | 30 ms | 600 KB | Output is correct |
9 | Correct | 30 ms | 604 KB | Output is correct |
10 | Correct | 31 ms | 348 KB | Output is correct |
11 | Correct | 31 ms | 348 KB | Output is correct |
12 | Correct | 28 ms | 344 KB | Output is correct |
13 | Correct | 31 ms | 636 KB | Output is correct |
14 | Correct | 31 ms | 604 KB | Output is correct |
15 | Correct | 31 ms | 604 KB | Output is correct |
16 | Correct | 16 ms | 348 KB | Output is correct |
17 | Correct | 21 ms | 596 KB | Output is correct |
18 | Correct | 7 ms | 348 KB | Output is correct |
19 | Execution timed out | 3090 ms | 3420 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |