oj.uz

Submission #592065

# Submission time Handle Problem Language Result Execution time Memory
592065 2022-07-08T12:51:38 Z fuad27 Examination (JOI19_examination) C++17
2 / 100
 3000 ms 1448 KB 
#include<iostream>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main () {
	int n, q;
	scanf("%d %d", &n, &q);
	int s[n], t[n];
	for(int i = 0;i<n;i++) {
		scanf("%d %d", &s[i], &t[i]);
	}
	while(q--) {
		int x, y, z;
		scanf("%d %d %d", &x, &y, &z);
		int ans=0;
		for(int i = 0;i<n;i++) {
			if(s[i] >= x and t[i] >= y and s[i]+t[i]>=z)ans++;
		}
		printf("%d\n", ans);
	}
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d %d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~
examination.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   scanf("%d %d", &s[i], &t[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
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", &x, &y, &z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 10 ms 212 KB Output is correct
8 Correct 9 ms 324 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 9 ms 320 KB Output is correct
11 Correct 9 ms 212 KB Output is correct
12 Correct 9 ms 212 KB Output is correct
13 Correct 11 ms 320 KB Output is correct
14 Correct 11 ms 212 KB Output is correct
15 Correct 10 ms 320 KB Output is correct
16 Correct 10 ms 212 KB Output is correct
17 Correct 12 ms 212 KB Output is correct
18 Correct 9 ms 212 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3099 ms 1448 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 3099 ms 1448 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 10 ms 212 KB Output is correct
8 Correct 9 ms 324 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 9 ms 320 KB Output is correct
11 Correct 9 ms 212 KB Output is correct
12 Correct 9 ms 212 KB Output is correct
13 Correct 11 ms 320 KB Output is correct
14 Correct 11 ms 212 KB Output is correct
15 Correct 10 ms 320 KB Output is correct
16 Correct 10 ms 212 KB Output is correct
17 Correct 12 ms 212 KB Output is correct
18 Correct 9 ms 212 KB Output is correct
19 Execution timed out 3099 ms 1448 KB Time limit exceeded
20 Halted 0 ms 0 KB -