oj.uz

Submission #788732

# Submission time Handle Problem Language Result Execution time Memory
788732 2023-07-20T14:36:25 Z prefixorsuuffiixx Examination (JOI19_examination) C++11
100 / 100
 2163 ms 1912 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);
            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:19:22: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   19 |             printf("%d\n" , ans);
      |                     ~^      ~~~
      |                      |      |
      |                      int    long long int
      |                     %lld
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 1108 KB Output is correct
3 Correct 1 ms 980 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 1108 KB Output is correct
7 Correct 4 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 1120 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 4 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 4 ms 980 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2091 ms 1624 KB Output is correct
2 Correct 2107 ms 1684 KB Output is correct
3 Correct 2119 ms 1628 KB Output is correct
4 Correct 2092 ms 1608 KB Output is correct
5 Correct 2090 ms 1700 KB Output is correct
6 Correct 2085 ms 1596 KB Output is correct
7 Correct 2089 ms 1608 KB Output is correct
8 Correct 2131 ms 1672 KB Output is correct
9 Correct 2158 ms 1592 KB Output is correct
10 Correct 2145 ms 1472 KB Output is correct
11 Correct 2163 ms 1552 KB Output is correct
12 Correct 2095 ms 1308 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2091 ms 1624 KB Output is correct
2 Correct 2107 ms 1684 KB Output is correct
3 Correct 2119 ms 1628 KB Output is correct
4 Correct 2092 ms 1608 KB Output is correct
5 Correct 2090 ms 1700 KB Output is correct
6 Correct 2085 ms 1596 KB Output is correct
7 Correct 2089 ms 1608 KB Output is correct
8 Correct 2131 ms 1672 KB Output is correct
9 Correct 2158 ms 1592 KB Output is correct
10 Correct 2145 ms 1472 KB Output is correct
11 Correct 2163 ms 1552 KB Output is correct
12 Correct 2095 ms 1308 KB Output is correct
13 Correct 2091 ms 1648 KB Output is correct
14 Correct 2114 ms 1588 KB Output is correct
15 Correct 2105 ms 1744 KB Output is correct
16 Correct 2111 ms 1760 KB Output is correct
17 Correct 2079 ms 1620 KB Output is correct
18 Correct 2084 ms 1596 KB Output is correct
19 Correct 2137 ms 1612 KB Output is correct
20 Correct 2099 ms 1644 KB Output is correct
21 Correct 2075 ms 1736 KB Output is correct
22 Correct 2084 ms 1480 KB Output is correct
23 Correct 2107 ms 1400 KB Output is correct
24 Correct 2150 ms 1224 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 1108 KB Output is correct
3 Correct 1 ms 980 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 1108 KB Output is correct
7 Correct 4 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 1120 KB Output is correct
11 Correct 4 ms 1108 KB Output is correct
12 Correct 4 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 4 ms 980 KB Output is correct
19 Correct 2091 ms 1624 KB Output is correct
20 Correct 2107 ms 1684 KB Output is correct
21 Correct 2119 ms 1628 KB Output is correct
22 Correct 2092 ms 1608 KB Output is correct
23 Correct 2090 ms 1700 KB Output is correct
24 Correct 2085 ms 1596 KB Output is correct
25 Correct 2089 ms 1608 KB Output is correct
26 Correct 2131 ms 1672 KB Output is correct
27 Correct 2158 ms 1592 KB Output is correct
28 Correct 2145 ms 1472 KB Output is correct
29 Correct 2163 ms 1552 KB Output is correct
30 Correct 2095 ms 1308 KB Output is correct
31 Correct 2091 ms 1648 KB Output is correct
32 Correct 2114 ms 1588 KB Output is correct
33 Correct 2105 ms 1744 KB Output is correct
34 Correct 2111 ms 1760 KB Output is correct
35 Correct 2079 ms 1620 KB Output is correct
36 Correct 2084 ms 1596 KB Output is correct
37 Correct 2137 ms 1612 KB Output is correct
38 Correct 2099 ms 1644 KB Output is correct
39 Correct 2075 ms 1736 KB Output is correct
40 Correct 2084 ms 1480 KB Output is correct
41 Correct 2107 ms 1400 KB Output is correct
42 Correct 2150 ms 1224 KB Output is correct
43 Correct 2079 ms 1592 KB Output is correct
44 Correct 2117 ms 1680 KB Output is correct
45 Correct 2124 ms 1596 KB Output is correct
46 Correct 2084 ms 1568 KB Output is correct
47 Correct 2118 ms 1680 KB Output is correct
48 Correct 2106 ms 1556 KB Output is correct
49 Correct 2084 ms 1912 KB Output is correct
50 Correct 2097 ms 1628 KB Output is correct
51 Correct 2133 ms 1660 KB Output is correct
52 Correct 2101 ms 1428 KB Output is correct
53 Correct 2109 ms 1484 KB Output is correct