제출 #635359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635359		radal	송금 (JOI19_remittance)	C++17	15 / 100	1093 ms	384 KiB

remittance

#include <bits/stdc++.h>
#pragma GCC target("sse,sse2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e6+20,mod = 1e9+7,inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k /= 2;
    } 
    return z; 
}
 
int a[N],b[N],n,x[N],j,tmp[N];
ll s,s2;
int nxt(int i){
    return ((i == n-1) ? 0 : i+1);
}
 
bool check2(){
    rep(i,0,n) tmp[i] = a[i];
    while (1){
        bool fl = 0;
        rep(i,0,n) fl |= (tmp[i] != b[i]);
        if (!fl) return 1;
        rep(i,0,n){
           if (tmp[i] > 1+b[i]){
              tmp[i] -= 2;
              tmp[nxt(i)] ++;
              fl = 0;
           }
           else if (tmp[i] == 1+b[i] && b[i]){
              tmp[i] -= 2;
              tmp[nxt(i)] ++;
              fl = 0;
           }
        }
        if (fl) return 0;
    }
}
int main(){
    ios_base :: sync_with_stdio(0); cin.tie(0);
    cin >> n;
    rep(i,0,n){
        cin >> a[i] >> b[i];
        s += a[i]-b[i];
    }
    if (s < 0){
        cout << "No";
        return 0;
    }
    if (check2()) cout << "Yes";
    else cout << "No";
    return 0;
}

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