oj.uz

답안 #788729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788729 2023-07-20T14:32:35 Z prefixorsuuffiixx Examination (JOI19_examination) C++14
100 / 100
 2244 ms 1908 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 a[100000],b[100000];
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    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:17:49: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |         for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                            ~~~~~^~~~
examination.cpp:17:77: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |         for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                                    ~~~~~~~~~^~~
examination.cpp:18:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   18 |         printf("%d\n" , ans);
      |                 ~^      ~~~
      |                  |      |
      |                  int    long long int
      |                 %lld
examination.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d" , &n , &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
examination.cpp:13:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
      |                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d %d %d" , &x , &y , &z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 368 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 284 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2175 ms 1660 KB Output is correct
2 Correct 2100 ms 1728 KB Output is correct
3 Correct 2149 ms 1628 KB Output is correct
4 Correct 2109 ms 1620 KB Output is correct
5 Correct 2132 ms 1720 KB Output is correct
6 Correct 2168 ms 1656 KB Output is correct
7 Correct 2191 ms 1676 KB Output is correct
8 Correct 2235 ms 1620 KB Output is correct
9 Correct 2118 ms 1668 KB Output is correct
10 Correct 2244 ms 1412 KB Output is correct
11 Correct 2221 ms 1416 KB Output is correct
12 Correct 2213 ms 1272 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2175 ms 1660 KB Output is correct
2 Correct 2100 ms 1728 KB Output is correct
3 Correct 2149 ms 1628 KB Output is correct
4 Correct 2109 ms 1620 KB Output is correct
5 Correct 2132 ms 1720 KB Output is correct
6 Correct 2168 ms 1656 KB Output is correct
7 Correct 2191 ms 1676 KB Output is correct
8 Correct 2235 ms 1620 KB Output is correct
9 Correct 2118 ms 1668 KB Output is correct
10 Correct 2244 ms 1412 KB Output is correct
11 Correct 2221 ms 1416 KB Output is correct
12 Correct 2213 ms 1272 KB Output is correct
13 Correct 2144 ms 1908 KB Output is correct
14 Correct 2075 ms 1648 KB Output is correct
15 Correct 2099 ms 1632 KB Output is correct
16 Correct 2148 ms 1636 KB Output is correct
17 Correct 2129 ms 1576 KB Output is correct
18 Correct 2188 ms 1644 KB Output is correct
19 Correct 2180 ms 1616 KB Output is correct
20 Correct 2108 ms 1712 KB Output is correct
21 Correct 2148 ms 1644 KB Output is correct
22 Correct 2143 ms 1580 KB Output is correct
23 Correct 2157 ms 1480 KB Output is correct
24 Correct 2129 ms 1392 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 368 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 4 ms 284 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 2175 ms 1660 KB Output is correct
20 Correct 2100 ms 1728 KB Output is correct
21 Correct 2149 ms 1628 KB Output is correct
22 Correct 2109 ms 1620 KB Output is correct
23 Correct 2132 ms 1720 KB Output is correct
24 Correct 2168 ms 1656 KB Output is correct
25 Correct 2191 ms 1676 KB Output is correct
26 Correct 2235 ms 1620 KB Output is correct
27 Correct 2118 ms 1668 KB Output is correct
28 Correct 2244 ms 1412 KB Output is correct
29 Correct 2221 ms 1416 KB Output is correct
30 Correct 2213 ms 1272 KB Output is correct
31 Correct 2144 ms 1908 KB Output is correct
32 Correct 2075 ms 1648 KB Output is correct
33 Correct 2099 ms 1632 KB Output is correct
34 Correct 2148 ms 1636 KB Output is correct
35 Correct 2129 ms 1576 KB Output is correct
36 Correct 2188 ms 1644 KB Output is correct
37 Correct 2180 ms 1616 KB Output is correct
38 Correct 2108 ms 1712 KB Output is correct
39 Correct 2148 ms 1644 KB Output is correct
40 Correct 2143 ms 1580 KB Output is correct
41 Correct 2157 ms 1480 KB Output is correct
42 Correct 2129 ms 1392 KB Output is correct
43 Correct 2182 ms 1708 KB Output is correct
44 Correct 2232 ms 1628 KB Output is correct
45 Correct 2159 ms 1556 KB Output is correct
46 Correct 2091 ms 1624 KB Output is correct
47 Correct 2190 ms 1656 KB Output is correct
48 Correct 2193 ms 1352 KB Output is correct
49 Correct 2174 ms 1756 KB Output is correct
50 Correct 2106 ms 1572 KB Output is correct
51 Correct 2104 ms 1688 KB Output is correct
52 Correct 2185 ms 1440 KB Output is correct
53 Correct 2121 ms 1364 KB Output is correct