oj.uz

답안 #788757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788757 2023-07-20T14:51:07 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
100 / 100
 1339 ms 1768 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]);
        for(int i = 0 ; i < m ; i++){
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1108 KB Output is correct
13 Correct 3 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 3 ms 1104 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1273 ms 1536 KB Output is correct
2 Correct 1242 ms 1648 KB Output is correct
3 Correct 1297 ms 1700 KB Output is correct
4 Correct 1281 ms 1724 KB Output is correct
5 Correct 1276 ms 1640 KB Output is correct
6 Correct 1245 ms 1760 KB Output is correct
7 Correct 1278 ms 1740 KB Output is correct
8 Correct 1245 ms 1680 KB Output is correct
9 Correct 1309 ms 1600 KB Output is correct
10 Correct 1289 ms 1484 KB Output is correct
11 Correct 1268 ms 1428 KB Output is correct
12 Correct 1290 ms 1356 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1273 ms 1536 KB Output is correct
2 Correct 1242 ms 1648 KB Output is correct
3 Correct 1297 ms 1700 KB Output is correct
4 Correct 1281 ms 1724 KB Output is correct
5 Correct 1276 ms 1640 KB Output is correct
6 Correct 1245 ms 1760 KB Output is correct
7 Correct 1278 ms 1740 KB Output is correct
8 Correct 1245 ms 1680 KB Output is correct
9 Correct 1309 ms 1600 KB Output is correct
10 Correct 1289 ms 1484 KB Output is correct
11 Correct 1268 ms 1428 KB Output is correct
12 Correct 1290 ms 1356 KB Output is correct
13 Correct 1261 ms 1616 KB Output is correct
14 Correct 1320 ms 1708 KB Output is correct
15 Correct 1273 ms 1768 KB Output is correct
16 Correct 1252 ms 1612 KB Output is correct
17 Correct 1257 ms 1560 KB Output is correct
18 Correct 1302 ms 1652 KB Output is correct
19 Correct 1284 ms 1616 KB Output is correct
20 Correct 1262 ms 1644 KB Output is correct
21 Correct 1239 ms 1624 KB Output is correct
22 Correct 1290 ms 1592 KB Output is correct
23 Correct 1312 ms 1496 KB Output is correct
24 Correct 1324 ms 1256 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1108 KB Output is correct
13 Correct 3 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 3 ms 1104 KB Output is correct
16 Correct 3 ms 1108 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 1273 ms 1536 KB Output is correct
20 Correct 1242 ms 1648 KB Output is correct
21 Correct 1297 ms 1700 KB Output is correct
22 Correct 1281 ms 1724 KB Output is correct
23 Correct 1276 ms 1640 KB Output is correct
24 Correct 1245 ms 1760 KB Output is correct
25 Correct 1278 ms 1740 KB Output is correct
26 Correct 1245 ms 1680 KB Output is correct
27 Correct 1309 ms 1600 KB Output is correct
28 Correct 1289 ms 1484 KB Output is correct
29 Correct 1268 ms 1428 KB Output is correct
30 Correct 1290 ms 1356 KB Output is correct
31 Correct 1261 ms 1616 KB Output is correct
32 Correct 1320 ms 1708 KB Output is correct
33 Correct 1273 ms 1768 KB Output is correct
34 Correct 1252 ms 1612 KB Output is correct
35 Correct 1257 ms 1560 KB Output is correct
36 Correct 1302 ms 1652 KB Output is correct
37 Correct 1284 ms 1616 KB Output is correct
38 Correct 1262 ms 1644 KB Output is correct
39 Correct 1239 ms 1624 KB Output is correct
40 Correct 1290 ms 1592 KB Output is correct
41 Correct 1312 ms 1496 KB Output is correct
42 Correct 1324 ms 1256 KB Output is correct
43 Correct 1277 ms 1680 KB Output is correct
44 Correct 1302 ms 1536 KB Output is correct
45 Correct 1312 ms 1728 KB Output is correct
46 Correct 1273 ms 1596 KB Output is correct
47 Correct 1290 ms 1628 KB Output is correct
48 Correct 1287 ms 1424 KB Output is correct
49 Correct 1318 ms 1592 KB Output is correct
50 Correct 1301 ms 1588 KB Output is correct
51 Correct 1298 ms 1732 KB Output is correct
52 Correct 1339 ms 1476 KB Output is correct
53 Correct 1271 ms 1468 KB Output is correct