제출 #425169

#제출 시각아이디문제언어결과실행 시간메모리
425169abdzag송금 (JOI19_remittance)C++17
0 / 100
1 ms204 KiB
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=int(a);i<int(b);i++) #define rrep(i,a,b) for(int i=int(a);i>int(b);i--) #define trav(a,v) for(auto& a: v) #define sz(v) v.size() #define all(v) v.begin(),v.end() #define vi vector<int> typedef long long ll; typedef long double ld; typedef unsigned long long ull; const long long inf = 1e15; using namespace std; ll ops = 0; vector<int> wanted; vector<int> v; int main() { ll n; cin >> n; wanted.resize(n); v.resize(n); rep(i, 0, n) { cin >> v[i] >> wanted[i]; } string res = "No"; rep(i, 0, 1 << n) { rep(j, 0, n) { if (!(1<<j & i))continue; vector<int> v2 = v; rep(o, 0, n) { ll ind = (j + o) % n; if (v2[ind] < wanted[ind])break; if ((v2[ind] - wanted[ind]) % 2) { break; } if (1 << ind & i) { v2[(ind + 1) % n] += (v2[ind] - wanted[ind]) / 2; v2[ind] -= (v2[ind] - wanted[ind]); } else if (v2[ind] != wanted[ind])break; if (o == n - 1)res = "Yes"; } } } cout << res << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...