oj.uz

Submission #274031

# Submission time Handle Problem Language Result Execution time Memory
274031 2020-08-19T08:15:10 Z Halit Examination (JOI19_examination) C++17
2 / 100
 3000 ms 2820 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,q,mat,in,s;
	scanf("%d %d", &n, &q);
	
	vector<pair<int, int> > v;
	for(int i = 0;i < n;++i){
		scanf("%d %d", &mat, &in);
		v.emplace_back(mat, in);
	}

	while(q--){
		scanf("%d %d %d", &mat, &in, &s);
		int ans = 0;
		for(int i = 0;i < n;++i)
			ans += (v[i].first >= mat) && (v[i].second >= in) && (v[i].first + v[i].second >= s);
		printf("%d\n", ans);
	}
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 |  scanf("%d %d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~
examination.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |   scanf("%d %d", &mat, &in);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~
examination.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |   scanf("%d %d %d", &mat, &in, &s);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 50 ms 512 KB Output is correct
8 Correct 52 ms 576 KB Output is correct
9 Correct 52 ms 512 KB Output is correct
10 Correct 56 ms 532 KB Output is correct
11 Correct 49 ms 512 KB Output is correct
12 Correct 49 ms 384 KB Output is correct
13 Correct 55 ms 512 KB Output is correct
14 Correct 56 ms 512 KB Output is correct
15 Correct 51 ms 512 KB Output is correct
16 Correct 23 ms 516 KB Output is correct
17 Correct 35 ms 536 KB Output is correct
18 Correct 11 ms 384 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 2820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 2820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 50 ms 512 KB Output is correct
8 Correct 52 ms 576 KB Output is correct
9 Correct 52 ms 512 KB Output is correct
10 Correct 56 ms 532 KB Output is correct
11 Correct 49 ms 512 KB Output is correct
12 Correct 49 ms 384 KB Output is correct
13 Correct 55 ms 512 KB Output is correct
14 Correct 56 ms 512 KB Output is correct
15 Correct 51 ms 512 KB Output is correct
16 Correct 23 ms 516 KB Output is correct
17 Correct 35 ms 536 KB Output is correct
18 Correct 11 ms 384 KB Output is correct
19 Execution timed out 3080 ms 2820 KB Time limit exceeded
20 Halted 0 ms 0 KB -