| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1193104 | GoBananas69 | Examination (JOI19_examination) | C++20 | 3095 ms | 1260 KiB |
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <vector>
#include <cstdint>
using namespace std;
typedef int64_t ll;
int main() {
cin.tie(0) -> sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> s(n), t(n);
for (int i = 0; i<n; ++i) {
cin >> s[i] >> t[i];
}
while (q--) {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = 0; i<n; ++i) {
if (s[i] >= a && t[i] >= b && s[i] + t[i] >= c) {
++cnt;
}
}
cout << cnt << '\n';
}
}| # | 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... | ||||
