oj.uz

답안 #489470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489470 2021-11-23T03:07:26 Z Haruto810198 송금 (JOI19_remittance) C++17
15 / 100
 340 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;

const int MAX = 1000010;

int n;
int init[MAX], target[MAX];
bool res;

set<vi> vis;

void dfs(vi arr){
	
	vis.insert(arr);
	
	bool ok = 1;
	FOR(i, 0, n - 1, 1){
		if(arr[i] != target[i]) ok = 0;
	}

	if(ok){
		res = 1;
		return;
	}
	
	FOR(i, 0, n - 1, 1){
		int ii = (i + 1) % n;
		if(arr[i] >= 2){
			arr[i] -= 2;
			arr[ii] += 1;
			if(vis.find(arr) == vis.end()) dfs(arr);
			arr[i] += 2;
			arr[ii] -= 1;
		}
	}
	
}

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	FOR(i, 0, n - 1, 1){
		cin>>init[i]>>target[i];
	}
	
	vi arr;
	FOR(i, 0, n - 1, 1){
		arr.pb(init[i]);
	}

	dfs(arr);

	if(res) cout<<"Yes"<<'\n';
	else cout<<"No"<<'\n';
	
	return 0;

}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 216 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 18 ms 2248 KB Output is correct
30 Correct 19 ms 2284 KB Output is correct
31 Correct 18 ms 2264 KB Output is correct
32 Correct 19 ms 2376 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 216 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 18 ms 2248 KB Output is correct
30 Correct 19 ms 2284 KB Output is correct
31 Correct 18 ms 2264 KB Output is correct
32 Correct 19 ms 2376 KB Output is correct
33 Runtime error 340 ms 262148 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 216 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 588 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 18 ms 2248 KB Output is correct
30 Correct 19 ms 2284 KB Output is correct
31 Correct 18 ms 2264 KB Output is correct
32 Correct 19 ms 2376 KB Output is correct
33 Runtime error 340 ms 262148 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -