답안 #859743

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859743	2023-10-10T15:09:33 Z	nnhzzz	송금 (JOI19_remittance)	C++14	100 / 100	176 ms	34672 KB

remittance

// cre: Nguyen Ngoc Hung - Train VOI 2024 :>

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>

using namespace std;

#define        __nnhzzz__  signed main()
#define          BIT(i,j)  ((i>>j)&1LL)
#define           MASK(i)  (1LL<<i)
#define            ALL(x)  (x).begin(),(x).end()
#define             SZ(x)  (int)(x).size()
#define                fi  first
#define                se  second
#define                ll  long long
#define                vi  vector<int>
#define               vvi  vector<vi>
#define               pii  pair<int,int>
#define              vpii  vector<pii>
#define REPDIS(i,be,en,j)  for(int i = (be); i<=(en); i+=j)
#define     REPD(i,be,en)  for(int i = (be); i>=(en); i--)
#define      REP(i,be,en)  for(int i = (be); i<=(en); i++)
#define               int  ll
//-------------------------------------------------------------//
const int oo = 1e9,LOG = 20,MAXN = 1e6+7,N = 1e2+3;
const int MOD = 1e9+7,MOD1 = 1e9+207,MOD2 = 1e9+407,MOD3 = 998244353;
//-------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }

/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Nguyen Ngoc Hung - nnhzzz
    Training for VOI24 gold medal
----------------------------------------------------------------
*/

int a[MAXN],b[MAXN];

void solve(){
    int n; cin >> n;
    REP(i,0,n-1) cin >> a[i] >> b[i];
    int ok = 1;
    while(ok){
        ok = 0;
        REP(i,0,n-1){
            if(a[i]<=1 || a[i]<=b[i]) continue;
            int x = max(1LL,(a[i]-b[i])>>1LL);
            a[i] -= x<<1LL;
            a[(i+1)%n] += x;
            if(x) ok = 1;
        }
    }
    REP(i,0,n-1){
        if(a[i]!=b[i]){
            cout << "No"; return ;
        }
    }
    cout << "Yes";
}

__nnhzzz__{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define name "test"
    if(fopen(name".inp","r")){
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    #define name1 "nnhzzz"
    if(fopen(name1".inp","r")){
        freopen(name1".inp","r",stdin);
        freopen(name1".out","w",stdout);
    }

    int test = 1;

    while(test--){
      solve();
    }
    cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:108:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |         freopen(name1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
remittance.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(name1".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	0 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	0 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	0 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	0 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	0 ms	2396 KB	Output is correct
52	Correct	1 ms	2648 KB	Output is correct
53	Correct	0 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	0 ms	2396 KB	Output is correct
56	Correct	1 ms	2396 KB	Output is correct
57	Correct	0 ms	2396 KB	Output is correct
58	Correct	1 ms	2580 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	1 ms	2396 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	1 ms	2396 KB	Output is correct

Subtask #3
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	0 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	0 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	0 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2396 KB	Output is correct
46	Correct	1 ms	2396 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2396 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	0 ms	2396 KB	Output is correct
52	Correct	1 ms	2648 KB	Output is correct
53	Correct	0 ms	2396 KB	Output is correct
54	Correct	1 ms	2396 KB	Output is correct
55	Correct	0 ms	2396 KB	Output is correct
56	Correct	1 ms	2396 KB	Output is correct
57	Correct	0 ms	2396 KB	Output is correct
58	Correct	1 ms	2580 KB	Output is correct
59	Correct	1 ms	2396 KB	Output is correct
60	Correct	1 ms	2396 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	1 ms	2396 KB	Output is correct
63	Correct	162 ms	24932 KB	Output is correct
64	Correct	93 ms	19980 KB	Output is correct
65	Correct	164 ms	33476 KB	Output is correct
66	Correct	89 ms	19796 KB	Output is correct
67	Correct	97 ms	21608 KB	Output is correct
68	Correct	101 ms	23264 KB	Output is correct
69	Correct	172 ms	33616 KB	Output is correct
70	Correct	88 ms	19956 KB	Output is correct
71	Correct	97 ms	21368 KB	Output is correct
72	Correct	100 ms	23380 KB	Output is correct
73	Correct	163 ms	33620 KB	Output is correct
74	Correct	88 ms	19828 KB	Output is correct
75	Correct	101 ms	21216 KB	Output is correct
76	Correct	100 ms	23376 KB	Output is correct
77	Correct	159 ms	33656 KB	Output is correct
78	Correct	124 ms	26992 KB	Output is correct
79	Correct	115 ms	26864 KB	Output is correct
80	Correct	121 ms	27076 KB	Output is correct
81	Correct	125 ms	26960 KB	Output is correct
82	Correct	74 ms	19992 KB	Output is correct
83	Correct	72 ms	19824 KB	Output is correct
84	Correct	72 ms	19828 KB	Output is correct
85	Correct	176 ms	34440 KB	Output is correct
86	Correct	165 ms	34672 KB	Output is correct
87	Correct	117 ms	27692 KB	Output is correct
88	Correct	124 ms	27732 KB	Output is correct

답안 #859743

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 40.0 / 40.0

Subtask #3 45.0 / 45.0

Subtask #1
15.0 / 15.0

Subtask #2
40.0 / 40.0

Subtask #3
45.0 / 45.0