oj.uz

Submission #1028855

# Submission time Handle Problem Language Result Execution time Memory
1028855 2024-07-20T09:30:51 Z underwaterkillerwhale Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 472 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 2e5 + 7;
const int Mod = 1e9 + 7;
const int szBL = 320;
const int INF = 1e9;
const int BASE = 1337;

int n;
pair<int,int> a[N];

void solution () {
    cin >> n;
//    n = 1e5;
//    rep (i, 1, n) a[i].fs = Rand(1, 1e5), a[i].se = Rand(1, 1e5);
    rep (i, 1, n) cin >> a[i].fs >> a[i].se;
    while (1) {
        rep (i, 1, n) {
            if (a[i].fs > a[i].se + 1) {
                int pos = i;
                while (a[pos].fs > a[pos].se + 1) {
                    int nxt = 1 + pos % n;
//                    cout << pos <<": "<<a[pos].fs<<"->"<<a[pos].fs -(a[pos].fs - a[pos].se) / 2 * 2 <<"\n";
                    a[nxt].fs += (a[pos].fs - a[pos].se) / 2;
                    a[pos].fs -= (a[pos].fs - a[pos].se) / 2 * 2;
                    pos = nxt;
                }
            }
//            rep (j, 1, n) cout << a[j].fs<< " "; cout<<"\n";
        }
        int ok = 1;
        rep (i, 1, n) if (a[i].fs > a[i].se + 1) {
            ok = 0;
        }
        if (ok) break;
    }
    int edcase = 1;
    rep (i, 1, n) {
        if (a[i].fs != a[i].se + 1 || a[i].se == 0) edcase = 0;
    }
    if (edcase  ) {
        cout <<"Yes\n";
        return;
    }
    rep (i, 1, n) if (a[i].fs != a[i].se) {
    cout <<"No\n"; return; }
    cout <<"Yes\n";
}

#define file(name) freopen(name".inp", "r", stdin); \
freopen(name".out", "w", stdout);

int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
nếu mình nghĩ sẽ thay đổi định nghĩa, kiểu dữ liệu của hàm hay mảng j thì mình phải nghĩ xem nó sẽ ảnh hưởng đến các phần nào
0 0
1 0
0 0
*/

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 408 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -