oj.uz

답안 #425169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425169 2021-06-12T14:28:47 Z abdzag 송금 (JOI19_remittance) C++17
0 / 100
 1 ms 204 KB 
#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;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -