Submission #578817

#TimeUsernameProblemLanguageResultExecution timeMemory
578817maomao90Memory 2 (JOI16_memory2)C++17
0 / 100
1 ms212 KiB
// Hallelujah, praise the one who set me free // Hallelujah, death has lost its grip on me // You have broken every chain, There's salvation in your name // Jesus Christ, my living hope #include <bits/stdc++.h> #include "Memory2_lib.h" using namespace std; #define REP(i, s, e) for (int i = (s); i < (e); i++) #define RREP(i, s, e) for (int i = (s); i >= (e); i--) template <class T> inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;} template <class T> inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;} typedef long long ll; typedef long double ld; #define FI first #define SE second typedef pair<int, int> ii; typedef pair<ll, ll> pll; typedef tuple<int, int, int> iii; #define ALL(_a) _a.begin(), _a.end() #define SZ(_a) (int) _a.size() #define pb push_back typedef vector<int> vi; typedef vector<ll> vll; typedef vector<ii> vii; typedef vector<iii> viii; #ifndef DEBUG #define cerr if (0) cerr #endif const int INF = 1000000005; const ll LINF = 1000000000000000005ll; const int MAXN = 105; int n; int a[MAXN]; vi ans[MAXN]; void Solve(int T, int N){ n = N; int ptr = 0; memset(a, -1, sizeof a); while (ptr < 2 * n) { int bad = -1; REP (i, ptr + 1, 2 * n) { if (a[i] != -1) { continue; } a[i] = Flip(ptr, i); cerr << ptr << ' ' << i << ' ' << a[i] << '\n'; ans[a[i]].pb(i); if (SZ(ans[a[i]]) >= 3) { bad = a[i]; break; } } cerr << bad << '\n'; if (bad != -1) { a[ptr] = bad; for (int i : ans[bad]) { a[i] = -1; } int nptr = ans[bad][0]; ans[bad].clear(); ans[bad].pb(ptr); ptr = nptr; } else { REP (i, 0, n) { if (SZ(ans[i]) == 1) { a[ptr] = i; ans[i].pb(ptr); break; } } assert(a[ptr] != 0); break; } } REP (i, 0, n) { assert(SZ(ans[i]) == 2); Answer(ans[i][0], ans[i][1], i); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...