oj.uz

답안 #788722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788722 2023-07-20T14:22:05 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
100 / 100
 2234 ms 1836 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);
        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);
            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

# 결과 실행 시간 메모리 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 980 KB Output is correct
6 Correct 1 ms 980 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 1108 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 3 ms 980 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2080 ms 1600 KB Output is correct
2 Correct 2202 ms 1604 KB Output is correct
3 Correct 2077 ms 1556 KB Output is correct
4 Correct 2093 ms 1652 KB Output is correct
5 Correct 2086 ms 1632 KB Output is correct
6 Correct 2126 ms 1588 KB Output is correct
7 Correct 2070 ms 1744 KB Output is correct
8 Correct 2161 ms 1604 KB Output is correct
9 Correct 2073 ms 1684 KB Output is correct
10 Correct 2068 ms 1480 KB Output is correct
11 Correct 2125 ms 1360 KB Output is correct
12 Correct 2141 ms 1292 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2080 ms 1600 KB Output is correct
2 Correct 2202 ms 1604 KB Output is correct
3 Correct 2077 ms 1556 KB Output is correct
4 Correct 2093 ms 1652 KB Output is correct
5 Correct 2086 ms 1632 KB Output is correct
6 Correct 2126 ms 1588 KB Output is correct
7 Correct 2070 ms 1744 KB Output is correct
8 Correct 2161 ms 1604 KB Output is correct
9 Correct 2073 ms 1684 KB Output is correct
10 Correct 2068 ms 1480 KB Output is correct
11 Correct 2125 ms 1360 KB Output is correct
12 Correct 2141 ms 1292 KB Output is correct
13 Correct 2201 ms 1608 KB Output is correct
14 Correct 2171 ms 1836 KB Output is correct
15 Correct 2180 ms 1604 KB Output is correct
16 Correct 2234 ms 1624 KB Output is correct
17 Correct 2145 ms 1580 KB Output is correct
18 Correct 2102 ms 1652 KB Output is correct
19 Correct 2136 ms 1624 KB Output is correct
20 Correct 2182 ms 1640 KB Output is correct
21 Correct 2125 ms 1700 KB Output is correct
22 Correct 2167 ms 1456 KB Output is correct
23 Correct 2108 ms 1476 KB Output is correct
24 Correct 2146 ms 1404 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 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 980 KB Output is correct
6 Correct 1 ms 980 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 1108 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 3 ms 980 KB Output is correct
19 Correct 2080 ms 1600 KB Output is correct
20 Correct 2202 ms 1604 KB Output is correct
21 Correct 2077 ms 1556 KB Output is correct
22 Correct 2093 ms 1652 KB Output is correct
23 Correct 2086 ms 1632 KB Output is correct
24 Correct 2126 ms 1588 KB Output is correct
25 Correct 2070 ms 1744 KB Output is correct
26 Correct 2161 ms 1604 KB Output is correct
27 Correct 2073 ms 1684 KB Output is correct
28 Correct 2068 ms 1480 KB Output is correct
29 Correct 2125 ms 1360 KB Output is correct
30 Correct 2141 ms 1292 KB Output is correct
31 Correct 2201 ms 1608 KB Output is correct
32 Correct 2171 ms 1836 KB Output is correct
33 Correct 2180 ms 1604 KB Output is correct
34 Correct 2234 ms 1624 KB Output is correct
35 Correct 2145 ms 1580 KB Output is correct
36 Correct 2102 ms 1652 KB Output is correct
37 Correct 2136 ms 1624 KB Output is correct
38 Correct 2182 ms 1640 KB Output is correct
39 Correct 2125 ms 1700 KB Output is correct
40 Correct 2167 ms 1456 KB Output is correct
41 Correct 2108 ms 1476 KB Output is correct
42 Correct 2146 ms 1404 KB Output is correct
43 Correct 2136 ms 1544 KB Output is correct
44 Correct 2150 ms 1612 KB Output is correct
45 Correct 2107 ms 1612 KB Output is correct
46 Correct 2216 ms 1612 KB Output is correct
47 Correct 2173 ms 1608 KB Output is correct
48 Correct 2162 ms 1372 KB Output is correct
49 Correct 2126 ms 1784 KB Output is correct
50 Correct 2109 ms 1604 KB Output is correct
51 Correct 2181 ms 1696 KB Output is correct
52 Correct 2149 ms 1540 KB Output is correct
53 Correct 2111 ms 1528 KB Output is correct