oj.uz

Submission #470972

# Submission time Handle Problem Language Result Execution time Memory
470972 2021-09-06T13:37:41 Z spike1236 Examination (JOI19_examination) C++14
2 / 100
 3000 ms 3968 KB 
#include <iostream>
#pragma GCC optimize("-Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;

const int MAXN = 1e5 + 10;
int a[MAXN], b[MAXN];

int main() {
    int n, q;
    scanf("%d%d", &n, &q);
    for(int i = 0; i < n; ++i) scanf("%d%d", a + i, b + i);
    int x, y, z, ans = 0;
    for(int i = 0; i < q; ++i) {
        scanf("%d%d%d", &x, &y, &z);
        ans = 0;
        for(int j = 0; j < n; ++j)
            if(a[j] >= x && b[j] >= y && a[j] + b[j] >= z) ++ans;
        cout << ans << '\n';
    }
    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:12:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     for(int i = 0; i < n; ++i) scanf("%d%d", a + i, b + i);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~
examination.cpp:15:14: 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 1 ms 308 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 8 ms 460 KB Output is correct
8 Correct 6 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 8 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 6 ms 460 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3058 ms 3968 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 3058 ms 3968 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 8 ms 460 KB Output is correct
8 Correct 6 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 8 ms 332 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 6 ms 460 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Execution timed out 3058 ms 3968 KB Time limit exceeded
20 Halted 0 ms 0 KB -