| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1187714 | oviyan_gandhi | Examination (JOI19_examination) | C++17 | 3095 ms | 2044 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define N 100001
int S[N], T[N];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, q; cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> S[i] >> T[i];
for (int i = 1; i <= q; i++) {
int x, y, z; cin >> x >> y >> z;
int ans = 0;
for (int j = 1; j <= n; j++)
ans += (S[j] >= x && T[j] >= y && (S[j] + T[j]) >= z);
cout << ans << endl;
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
