oj.uz

Submission #220721

# Submission time Handle Problem Language Result Execution time Memory
220721 2020-04-08T13:00:24 Z DodgeBallMan Remittance (JOI19_remittance) C++14
55 / 100
 41 ms 1920 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
long long a[N], b[N];
int n;
int main()
{
    scanf("%d",&n);
    for( int i = 0 ; i < n ; i++ ) scanf("%lld %lld",&a[i],&b[i]);
    for( int j = 1 ; j <= 30 ; j++ ) {
        for( int i = 0 ; i < n ; i++ ) {
            int nxt = ( i + 1 ) % n;
            if( a[i] - b[i] >= 2 ) {
                int d = ( a[i] - b[i] ) / 2;
                a[i] -= 2*d;
                a[nxt] += d;
            }
            else if( a[i] - b[i] == 1 && a[i] > 1 ) {
                a[i] -= 2;
                a[nxt] += 1;
            }
        }
    }
    for( int i = 0 ; i < n ; i++ ) if( a[i] ^ b[i] ) return !printf("No\n");
    printf("Yes\n");
    return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
remittance.cpp:11:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for( int i = 0 ; i < n ; i++ ) scanf("%lld %lld",&a[i],&b[i]);
                                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 45.0

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