답안 #1039736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1039736	2024-07-31T08:15:15 Z	phong	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	2440 KB

remittance

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>

#define ll long long
const int nmax = 1e6 + 5, N = 1e5;
const ll oo = 1e9;
const int lg = 31, M = 2, mod = 1e6;
#define pii pair<ll, ll>
#define fi first
#define se second
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << "\n";
#define endl "\n"
#define task "code"
using namespace std;

int n;
pii a[nmax], b[nmax];
bool check(){
    int bs = 40;
    while(bs--){
        for(int i = 0; i < n; ++i){
            if(a[i].fi > a[i].se){
                ll x = (a[i].fi - a[i].se) / 2;
                a[i].fi -= x * 2;
                a[(i + 1) % n].fi += x;
            }
        }
    }
    bool ok = 1;
    for(int i = 0; i < n;++i){
        ok &= (a[i].fi == a[i].se);
    }
    return ok;

}
main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
//    freopen(task".inp", "r", stdin);
//    freopen(task".out", "w", stdout);
    cin >> n;
    for(int i = 0; i < n; ++i) cin >> a[i].fi >> a[i].se;
    if(check()) cout << "Yes", exit(0);
    int lc = -1, pc = -1;
    for(int i = 0; i < n; ++i){
        if(a[i].fi > a[i].se){
            if(lc == -1) lc = i;
            pc = i;
        }
        b[i] = a[i];
    }
    if(lc != -1){
        ll x = (a[lc].fi - a[lc].se + 1) / 2;
        a[lc].fi -= x * 2;
        a[(lc + 1) % n].fi += x;
        if(check()) cout << "Yes", exit(0);
        for(int i = 0; i < n; ++i) a[i] = b[i];
        x = (a[pc].fi - a[pc].se + 1) / 2;
        a[pc].fi -= x * 2;
        a[(pc + 1) % n].fi += x;
        if(check()) cout << "Yes", exit(0);
    }
    cout << "No";
}
/*

*/

Compilation message

remittance.cpp:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main(){
      | ^~~~

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2440 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 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	0 ms	2396 KB	Output is correct
20	Incorrect	0 ms	2396 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2440 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 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	0 ms	2396 KB	Output is correct
20	Incorrect	0 ms	2396 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2440 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 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	0 ms	2396 KB	Output is correct
20	Incorrect	0 ms	2396 KB	Output isn't correct
21	Halted	0 ms	0 KB	-