제출 #1192652

#제출 시각아이디문제언어결과실행 시간메모리
1192652JooDdaeMemory 2 (JOI16_memory2)C++20
0 / 100
0 ms328 KiB
#include "Memory2_lib.h" #include<bits/stdc++.h> using namespace std; void Solve(int T, int N) { int M = N+N; vector<vector<int>> q(M, vector<int>(M, -1)); array<int, 2> v = {0, 1}; q[0][1] = Flip(0, 1); for(int i=2;i<M;i++) { auto [x, y] = v; q[x][i] = Flip(x, i); q[y][i] = Flip(y, i); if(q[x][i] == q[x][y]) v = {y, i}; else if(q[y][i] == q[x][y]) v = {x, i}; } Answer(v[0], v[1], q[v[0]][v[1]]); vector<int> c(N, -1); for(int i=0;i<M;i++) if(i != v[0] && i != v[1]) { int u = Flip(i, v[0]); if(c[u] != -1) Answer(c[u], i, u); else c[u] = i; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...