oj.uz

Submission #425134

# Submission time Handle Problem Language Result Execution time Memory
425134 2021-06-12T13:50:14 Z abdzag Remittance (JOI19_remittance) C++17
15 / 100
 1000 ms 101360 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];
	}
	queue<vector<int>> q;
	q.push(v);
	string res = "No";
	map<vector<int>, bool> mp;
	mp[v] = 1;
	while (!q.empty()) {
		if (q.front() == wanted) {
			res = "Yes";
		}
		rep(i, 0, q.front().size()) {
			vector<int> nxt = q.front();
			rep(j, 0, 3) {
				if (nxt[i] - j * 2 >= 0) {
					nxt[i] -= j * 2;
					nxt[(i + 1) % nxt.size()] += j;
					if (!mp[nxt]) {
						q.push(nxt);
						mp[nxt] = 1;
					}
				}
			}
		}
		q.pop();
	}
	cout << res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 292 KB Output is correct
24 Correct 9 ms 680 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 48 ms 2372 KB Output is correct
30 Correct 62 ms 2360 KB Output is correct
31 Correct 59 ms 2384 KB Output is correct
32 Correct 48 ms 2356 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 292 KB Output is correct
24 Correct 9 ms 680 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 48 ms 2372 KB Output is correct
30 Correct 62 ms 2360 KB Output is correct
31 Correct 59 ms 2384 KB Output is correct
32 Correct 48 ms 2356 KB Output is correct
33 Execution timed out 1096 ms 101360 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 292 KB Output is correct
24 Correct 9 ms 680 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 48 ms 2372 KB Output is correct
30 Correct 62 ms 2360 KB Output is correct
31 Correct 59 ms 2384 KB Output is correct
32 Correct 48 ms 2356 KB Output is correct
33 Execution timed out 1096 ms 101360 KB Time limit exceeded
34 Halted 0 ms 0 KB -