oj.uz

Submission #788725

# Submission time Handle Problem Language Result Execution time Memory
788725 2023-07-20T14:27:10 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
100 / 100
 2217 ms 1764 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(0);cout.tie(0);
        int a[100000],b[100000];
        scanf("%d %d" , &n , &m);
        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:18:53: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   18 |             for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                ~~~~~^~~~
examination.cpp:18:81: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   18 |             for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                                        ~~~~~~~~~^~~
examination.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         scanf("%d %d" , &n , &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
examination.cpp:14:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:17:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |             scanf("%d %d %d" , &x , &y , &z);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2217 ms 1760 KB Output is correct
2 Correct 2154 ms 1632 KB Output is correct
3 Correct 2141 ms 1624 KB Output is correct
4 Correct 2090 ms 1644 KB Output is correct
5 Correct 2094 ms 1636 KB Output is correct
6 Correct 2121 ms 1636 KB Output is correct
7 Correct 2099 ms 1600 KB Output is correct
8 Correct 2074 ms 1556 KB Output is correct
9 Correct 2063 ms 1744 KB Output is correct
10 Correct 2115 ms 1376 KB Output is correct
11 Correct 2092 ms 1516 KB Output is correct
12 Correct 2098 ms 1320 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2217 ms 1760 KB Output is correct
2 Correct 2154 ms 1632 KB Output is correct
3 Correct 2141 ms 1624 KB Output is correct
4 Correct 2090 ms 1644 KB Output is correct
5 Correct 2094 ms 1636 KB Output is correct
6 Correct 2121 ms 1636 KB Output is correct
7 Correct 2099 ms 1600 KB Output is correct
8 Correct 2074 ms 1556 KB Output is correct
9 Correct 2063 ms 1744 KB Output is correct
10 Correct 2115 ms 1376 KB Output is correct
11 Correct 2092 ms 1516 KB Output is correct
12 Correct 2098 ms 1320 KB Output is correct
13 Correct 2083 ms 1636 KB Output is correct
14 Correct 2124 ms 1588 KB Output is correct
15 Correct 2101 ms 1596 KB Output is correct
16 Correct 2082 ms 1632 KB Output is correct
17 Correct 2078 ms 1652 KB Output is correct
18 Correct 2156 ms 1632 KB Output is correct
19 Correct 2075 ms 1616 KB Output is correct
20 Correct 2186 ms 1764 KB Output is correct
21 Correct 2122 ms 1740 KB Output is correct
22 Correct 2077 ms 1584 KB Output is correct
23 Correct 2093 ms 1472 KB Output is correct
24 Correct 2065 ms 1312 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 4 ms 1108 KB Output is correct
9 Correct 4 ms 1108 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 4 ms 1108 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2217 ms 1760 KB Output is correct
20 Correct 2154 ms 1632 KB Output is correct
21 Correct 2141 ms 1624 KB Output is correct
22 Correct 2090 ms 1644 KB Output is correct
23 Correct 2094 ms 1636 KB Output is correct
24 Correct 2121 ms 1636 KB Output is correct
25 Correct 2099 ms 1600 KB Output is correct
26 Correct 2074 ms 1556 KB Output is correct
27 Correct 2063 ms 1744 KB Output is correct
28 Correct 2115 ms 1376 KB Output is correct
29 Correct 2092 ms 1516 KB Output is correct
30 Correct 2098 ms 1320 KB Output is correct
31 Correct 2083 ms 1636 KB Output is correct
32 Correct 2124 ms 1588 KB Output is correct
33 Correct 2101 ms 1596 KB Output is correct
34 Correct 2082 ms 1632 KB Output is correct
35 Correct 2078 ms 1652 KB Output is correct
36 Correct 2156 ms 1632 KB Output is correct
37 Correct 2075 ms 1616 KB Output is correct
38 Correct 2186 ms 1764 KB Output is correct
39 Correct 2122 ms 1740 KB Output is correct
40 Correct 2077 ms 1584 KB Output is correct
41 Correct 2093 ms 1472 KB Output is correct
42 Correct 2065 ms 1312 KB Output is correct
43 Correct 2102 ms 1520 KB Output is correct
44 Correct 2100 ms 1620 KB Output is correct
45 Correct 2100 ms 1700 KB Output is correct
46 Correct 2112 ms 1592 KB Output is correct
47 Correct 2134 ms 1620 KB Output is correct
48 Correct 2159 ms 1388 KB Output is correct
49 Correct 2122 ms 1644 KB Output is correct
50 Correct 2139 ms 1552 KB Output is correct
51 Correct 2156 ms 1712 KB Output is correct
52 Correct 2106 ms 1652 KB Output is correct
53 Correct 2139 ms 1560 KB Output is correct