oj.uz

Submission #788718

# Submission time Handle Problem Language Result Execution time Memory
788718 2023-07-20T14:18:10 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
2 / 100
 3000 ms 4184 KB 
    #include <iostream>
    #pragma GCC target ("avx2")
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast,unroll-loops")
    using namespace std;
    long long ans;
    int x,y,z;
    int n,m;
    int main() {
        ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        scanf("%d %d" , &n , &m);
        int a[n],b[n];
        for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
        while(m--){
            ans = 0;
            scanf("%d %d %d" , &x , &y , &z);
            for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
            cout << ans << '\n';
        }
    }

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:17:53: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |             for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                ~~~~~^~~~
examination.cpp:17:81: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |             for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                                        ~~~~~~~~~^~~
examination.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%d %d" , &n , &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
examination.cpp:13:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:16:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |             scanf("%d %d %d" , &x , &y , &z);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2998 ms 1624 KB Output is correct
2 Correct 2981 ms 1876 KB Output is correct
3 Correct 2972 ms 4184 KB Output is correct
4 Execution timed out 3004 ms 3504 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2998 ms 1624 KB Output is correct
2 Correct 2981 ms 1876 KB Output is correct
3 Correct 2972 ms 4184 KB Output is correct
4 Execution timed out 3004 ms 3504 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 336 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 2998 ms 1624 KB Output is correct
20 Correct 2981 ms 1876 KB Output is correct
21 Correct 2972 ms 4184 KB Output is correct
22 Execution timed out 3004 ms 3504 KB Time limit exceeded
23 Halted 0 ms 0 KB -