제출 #1294072

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1294072		M_SH_O	송금 (JOI19_remittance)	C++20	0 / 100	1093 ms	332 KiB

remittance

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

const ll INF = 1e18+7;
const int lg = 20;
const ll MOD = 1e9+7;
//const ll MOD2 = 998244353;
//const ll MOD3 = 1e6+3;

mt19937 rng(1488);
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main() {
    speed;

    ll n;
    cin >> n;
    vll a(n), b(n);
    for (int i = 0; i < n; i ++) {
        cin >> a[i] >> b[i];
    }
    ll k = 0, k1 = 0;;

    for (int i = 0; i < n; i = (i+1)%n) {
        ll x = 0;
        if (a[i] > b[i]) {
            x = (a[i]-b[i])/2;
            k1 = 0;
        }
        else k1 ++;
        if (k1 > n*2) break;

        a[i] -= x*2;
        a[(i+1)%n] += x;
        if (a[i] == b[i]) {
            k ++;
        }
        else k = 0;
        if (k == n) break;
    }

    if (k == n) cout << "Yes" << endl;
    else cout << "No" << endl;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45