# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
413717 | 2021-05-29T09:29:25 Z | rabbitsthecat | 송금 (JOI19_remittance) | C++17 | 1000 ms | 26332 KB |
#include "bits/stdc++.h" using namespace std; #define ffor(n) for(int i = 0; i < n; i++) #define fffor(n) for(int j = 0; j < n; j++) #define uwu ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize("Ofast") const int INF = 1e9 + 7; const long long INF2 = 1e17; int main(void) { uwu auto print = [] (vector <int>& v) { for(int x: v) cout << x << ' '; cout << '\n'; }; int n; cin >> n; vector <int> left(n), right(n); ffor(n) cin >> left[i] >> right[i]; map <vector <int>, bool> reachable; vector <int> v = left; auto bfs = [&] (auto&& bfs) -> void { if (reachable[v]) return; reachable[v] = true; for(int i = 0; i < n; i++) { for(int delta = 2; delta <= v[i]; delta += 2) { v[i] -= delta; v[(i + 1) % n] += (delta / 2); bfs(bfs); v[(i + 1) % n] -= (delta / 2); v[(i + n - 1) % n] += (delta / 2); bfs(bfs); v[(i + n - 1) % n] -= (delta / 2); v[i] += delta; } } }; bfs(bfs); if (reachable[right]) cout << "Yes\n"; else cout << "No\n"; } /* C:\Users\kenne\OneDrive\Desktop\competitive_programming\main.cpp */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 2500 KB | Output is correct |
2 | Correct | 4 ms | 204 KB | Output is correct |
3 | Correct | 4 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 6 ms | 716 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |
9 | Correct | 4 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
11 | Correct | 1 ms | 332 KB | Output is correct |
12 | Correct | 1 ms | 204 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 5 ms | 332 KB | Output is correct |
15 | Correct | 1 ms | 204 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 4 ms | 204 KB | Output is correct |
18 | Correct | 2 ms | 332 KB | Output is correct |
19 | Correct | 5 ms | 332 KB | Output is correct |
20 | Correct | 2 ms | 332 KB | Output is correct |
21 | Correct | 281 ms | 9772 KB | Output is correct |
22 | Correct | 4 ms | 460 KB | Output is correct |
23 | Correct | 238 ms | 6728 KB | Output is correct |
24 | Execution timed out | 1083 ms | 26332 KB | Time limit exceeded |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 2500 KB | Output is correct |
2 | Correct | 4 ms | 204 KB | Output is correct |
3 | Correct | 4 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 6 ms | 716 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |
9 | Correct | 4 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
11 | Correct | 1 ms | 332 KB | Output is correct |
12 | Correct | 1 ms | 204 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 5 ms | 332 KB | Output is correct |
15 | Correct | 1 ms | 204 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 4 ms | 204 KB | Output is correct |
18 | Correct | 2 ms | 332 KB | Output is correct |
19 | Correct | 5 ms | 332 KB | Output is correct |
20 | Correct | 2 ms | 332 KB | Output is correct |
21 | Correct | 281 ms | 9772 KB | Output is correct |
22 | Correct | 4 ms | 460 KB | Output is correct |
23 | Correct | 238 ms | 6728 KB | Output is correct |
24 | Execution timed out | 1083 ms | 26332 KB | Time limit exceeded |
25 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 2500 KB | Output is correct |
2 | Correct | 4 ms | 204 KB | Output is correct |
3 | Correct | 4 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 204 KB | Output is correct |
7 | Correct | 6 ms | 716 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |
9 | Correct | 4 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
11 | Correct | 1 ms | 332 KB | Output is correct |
12 | Correct | 1 ms | 204 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 5 ms | 332 KB | Output is correct |
15 | Correct | 1 ms | 204 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 4 ms | 204 KB | Output is correct |
18 | Correct | 2 ms | 332 KB | Output is correct |
19 | Correct | 5 ms | 332 KB | Output is correct |
20 | Correct | 2 ms | 332 KB | Output is correct |
21 | Correct | 281 ms | 9772 KB | Output is correct |
22 | Correct | 4 ms | 460 KB | Output is correct |
23 | Correct | 238 ms | 6728 KB | Output is correct |
24 | Execution timed out | 1083 ms | 26332 KB | Time limit exceeded |
25 | Halted | 0 ms | 0 KB | - |