oj.uz

답안 #232405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232405 2020-05-16T23:55:09 Z limabeans 송금 (JOI19_remittance) C++17
0 / 100
 1000 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 10;






vector<int> b;

bool solve(vector<int> a) {

    int n = a.size();
    if (a == b) return true;
    for (int i=0; i<n; i++) {
	if (a[i]<=b[i]) continue;

	
	for (int x=0; x<=8; x+=2) {
	    for (int y=0; y<=8; y+=2) {
		if (x>0||y>0) {
		    if (a[i]>=x+y) {
			vector<int> _a = a;
			_a[i]-=x;
			_a[(i+1)%n]+=x/2;
			_a[i]-=y;
			_a[(i-1+n)%n]+=y/2;
			if (solve(_a)) return true;
		    }
		}
	    }
	}
    }
    return false;
}

int n;
vector<int> _a;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    _a.resize(n);
    b.resize(n);
    
    for (int i=0; i<n; i++) {
	cin>>_a[i]>>b[i];
    }

    if (solve(_a)) out("Yes");
    out("No");

    return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 30 ms 376 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 13 ms 384 KB Output is correct
21 Execution timed out 1093 ms 384 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 30 ms 376 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 13 ms 384 KB Output is correct
21 Execution timed out 1093 ms 384 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 30 ms 376 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 13 ms 384 KB Output is correct
21 Execution timed out 1093 ms 384 KB Time limit exceeded
22 Halted 0 ms 0 KB -