oj.uz

Submission #375073

# Submission time Handle Problem Language Result Execution time Memory
375073 2021-03-09T02:11:34 Z Kevin_Zhang_TW Examination (JOI19_examination) C++17
2 / 100
 62 ms 2540 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif 
const int MAX_N = 100010;
int n, q, s[MAX_N], t[MAX_N];
int a[MAX_N], b[MAX_N], c[MAX_N], res[MAX_N];

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> q;
	for (int i = 0;i < n;++i) cin >> s[i] >> t[i];
	for (int i = 0;i < q;++i) cin >> a[i] >> b[i] >> c[i];

	if (n <= 3000 && q <= 3000) {
		for (int i = 0;i < q;++i) {
			for (int j = 0;j < n;++j) {
				res[i] += ( s[j] >= a[i] &&
							t[j] >= b[i] &&
							s[j] + t[j] >= c[i] );
			}
		}
	}


	for (int i = 0;i < q;++i)
		cout << res[i] << '\n';
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 54 ms 492 KB Output is correct
8 Correct 52 ms 492 KB Output is correct
9 Correct 54 ms 492 KB Output is correct
10 Correct 56 ms 492 KB Output is correct
11 Correct 56 ms 492 KB Output is correct
12 Correct 62 ms 492 KB Output is correct
13 Correct 48 ms 524 KB Output is correct
14 Correct 48 ms 492 KB Output is correct
15 Correct 49 ms 612 KB Output is correct
16 Correct 22 ms 492 KB Output is correct
17 Correct 42 ms 492 KB Output is correct
18 Correct 12 ms 492 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 2540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 2540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 54 ms 492 KB Output is correct
8 Correct 52 ms 492 KB Output is correct
9 Correct 54 ms 492 KB Output is correct
10 Correct 56 ms 492 KB Output is correct
11 Correct 56 ms 492 KB Output is correct
12 Correct 62 ms 492 KB Output is correct
13 Correct 48 ms 524 KB Output is correct
14 Correct 48 ms 492 KB Output is correct
15 Correct 49 ms 612 KB Output is correct
16 Correct 22 ms 492 KB Output is correct
17 Correct 42 ms 492 KB Output is correct
18 Correct 12 ms 492 KB Output is correct
19 Incorrect 52 ms 2540 KB Output isn't correct
20 Halted 0 ms 0 KB -