oj.uz

Submission #284174

# Submission time Handle Problem Language Result Execution time Memory
284174 2020-08-27T00:40:07 Z jainbot27 Remittance (JOI19_remittance) C++17
100 / 100
 371 ms 8740 KB 
#include <bits/stdc++.h>
#define m std::max_element
int main(){
    int n;scanf("%d",&n);std::vector<int>a(n),b(n);
    for(int i=0;i<n;i++)scanf("%d%d",&a[i],&b[i]);
    if(*m(b.begin(),b.end())==0){
        puts(*m(a.begin(),a.end())==0?"Yes":"No");exit(0);
    }
    int g=1;
    while(g){
        g=0;
        for(int i=0;i<n;i++){
            if(a[i]>b[i]){
                int r=(a[i]-b[i]+1)/2;
                a[(i+1)%n]+=r;
                a[i]-=r*2; 
                g=1;
            }
        }
    }
    g=1;
    for(int i=0; i < n; i++){
        g&=a[i]==b[i];
    }
    puts(g?"Yes":"No");
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:4:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    4 |     int n;scanf("%d",&n);std::vector<int>a(n),b(n);
      |           ~~~~~^~~~~~~~~
remittance.cpp:5:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    5 |     for(int i=0;i<n;i++)scanf("%d%d",&a[i],&b[i]);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 1 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 0 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 0 ms 256 KB Output is correct
52 Correct 0 ms 256 KB Output is correct
53 Correct 0 ms 256 KB Output is correct
54 Correct 1 ms 256 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 0 ms 256 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 1 ms 384 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 1 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 0 ms 256 KB Output is correct
45 Correct 0 ms 256 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 0 ms 256 KB Output is correct
52 Correct 0 ms 256 KB Output is correct
53 Correct 0 ms 256 KB Output is correct
54 Correct 1 ms 256 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 0 ms 256 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 360 ms 8740 KB Output is correct
64 Correct 195 ms 8440 KB Output is correct
65 Correct 358 ms 8268 KB Output is correct
66 Correct 181 ms 8492 KB Output is correct
67 Correct 206 ms 8440 KB Output is correct
68 Correct 222 ms 8568 KB Output is correct
69 Correct 355 ms 8192 KB Output is correct
70 Correct 193 ms 8532 KB Output is correct
71 Correct 199 ms 8568 KB Output is correct
72 Correct 219 ms 8528 KB Output is correct
73 Correct 371 ms 8312 KB Output is correct
74 Correct 183 ms 8440 KB Output is correct
75 Correct 211 ms 8696 KB Output is correct
76 Correct 246 ms 8440 KB Output is correct
77 Correct 355 ms 8192 KB Output is correct
78 Correct 256 ms 8568 KB Output is correct
79 Correct 252 ms 8568 KB Output is correct
80 Correct 269 ms 8568 KB Output is correct
81 Correct 274 ms 8524 KB Output is correct
82 Correct 162 ms 8492 KB Output is correct
83 Correct 194 ms 8440 KB Output is correct
84 Correct 167 ms 8536 KB Output is correct
85 Correct 318 ms 8192 KB Output is correct
86 Correct 324 ms 8312 KB Output is correct
87 Correct 211 ms 8568 KB Output is correct
88 Correct 225 ms 8440 KB Output is correct