oj.uz

Submission #788755

# Submission time Handle Problem Language Result Execution time Memory
788755 2023-07-20T14:48:42 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
100 / 100
 1328 ms 2128 KB 
 #include <iostream>
    #pragma GCC target ("avx2")
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast,unroll-loops")
    using namespace std;
    int ans;
    int x,y,z;
    int n,m;

    int main() {
        ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
        int a[100001],b[100001];
        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);
            printf("%d\n" , ans);
        }
    }

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 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 4 ms 1220 KB Output is correct
9 Correct 3 ms 1248 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 3 ms 1120 KB Output is correct
13 Correct 3 ms 1236 KB Output is correct
14 Correct 4 ms 1236 KB Output is correct
15 Correct 4 ms 1120 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 3 ms 1116 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 1290 ms 2084 KB Output is correct
2 Correct 1245 ms 2128 KB Output is correct
3 Correct 1283 ms 1880 KB Output is correct
4 Correct 1328 ms 1976 KB Output is correct
5 Correct 1251 ms 2084 KB Output is correct
6 Correct 1296 ms 2028 KB Output is correct
7 Correct 1261 ms 1900 KB Output is correct
8 Correct 1292 ms 1904 KB Output is correct
9 Correct 1235 ms 1928 KB Output is correct
10 Correct 1257 ms 1712 KB Output is correct
11 Correct 1313 ms 1612 KB Output is correct
12 Correct 1303 ms 1668 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1290 ms 2084 KB Output is correct
2 Correct 1245 ms 2128 KB Output is correct
3 Correct 1283 ms 1880 KB Output is correct
4 Correct 1328 ms 1976 KB Output is correct
5 Correct 1251 ms 2084 KB Output is correct
6 Correct 1296 ms 2028 KB Output is correct
7 Correct 1261 ms 1900 KB Output is correct
8 Correct 1292 ms 1904 KB Output is correct
9 Correct 1235 ms 1928 KB Output is correct
10 Correct 1257 ms 1712 KB Output is correct
11 Correct 1313 ms 1612 KB Output is correct
12 Correct 1303 ms 1668 KB Output is correct
13 Correct 1255 ms 2088 KB Output is correct
14 Correct 1281 ms 1984 KB Output is correct
15 Correct 1240 ms 1892 KB Output is correct
16 Correct 1248 ms 1992 KB Output is correct
17 Correct 1273 ms 1964 KB Output is correct
18 Correct 1266 ms 1908 KB Output is correct
19 Correct 1274 ms 2000 KB Output is correct
20 Correct 1253 ms 1856 KB Output is correct
21 Correct 1316 ms 1852 KB Output is correct
22 Correct 1291 ms 1760 KB Output is correct
23 Correct 1277 ms 1904 KB Output is correct
24 Correct 1270 ms 1520 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 4 ms 1220 KB Output is correct
9 Correct 3 ms 1248 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 3 ms 1120 KB Output is correct
13 Correct 3 ms 1236 KB Output is correct
14 Correct 4 ms 1236 KB Output is correct
15 Correct 4 ms 1120 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 1290 ms 2084 KB Output is correct
20 Correct 1245 ms 2128 KB Output is correct
21 Correct 1283 ms 1880 KB Output is correct
22 Correct 1328 ms 1976 KB Output is correct
23 Correct 1251 ms 2084 KB Output is correct
24 Correct 1296 ms 2028 KB Output is correct
25 Correct 1261 ms 1900 KB Output is correct
26 Correct 1292 ms 1904 KB Output is correct
27 Correct 1235 ms 1928 KB Output is correct
28 Correct 1257 ms 1712 KB Output is correct
29 Correct 1313 ms 1612 KB Output is correct
30 Correct 1303 ms 1668 KB Output is correct
31 Correct 1255 ms 2088 KB Output is correct
32 Correct 1281 ms 1984 KB Output is correct
33 Correct 1240 ms 1892 KB Output is correct
34 Correct 1248 ms 1992 KB Output is correct
35 Correct 1273 ms 1964 KB Output is correct
36 Correct 1266 ms 1908 KB Output is correct
37 Correct 1274 ms 2000 KB Output is correct
38 Correct 1253 ms 1856 KB Output is correct
39 Correct 1316 ms 1852 KB Output is correct
40 Correct 1291 ms 1760 KB Output is correct
41 Correct 1277 ms 1904 KB Output is correct
42 Correct 1270 ms 1520 KB Output is correct
43 Correct 1256 ms 1880 KB Output is correct
44 Correct 1295 ms 2024 KB Output is correct
45 Correct 1273 ms 1932 KB Output is correct
46 Correct 1276 ms 1996 KB Output is correct
47 Correct 1270 ms 1888 KB Output is correct
48 Correct 1265 ms 1664 KB Output is correct
49 Correct 1311 ms 1900 KB Output is correct
50 Correct 1265 ms 1828 KB Output is correct
51 Correct 1265 ms 1820 KB Output is correct
52 Correct 1270 ms 2084 KB Output is correct
53 Correct 1322 ms 1768 KB Output is correct