Submission #1055763

#TimeUsernameProblemLanguageResultExecution timeMemory
1055763ForestedPrisoner Challenge (IOI22_prison)C++17
44 / 100
9 ms1628 KiB
#include <bits/stdc++.h> using namespace std; using i32 = int; using i64 = long long; template <typename T> using V = vector<T>; template <typename T> using VV = V<V<T>>; template <typename T> using VVV = V<V<V<T>>>; template <typename T> bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } #define OVERRIDE4(a, b, c, d, ...) d #define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i) #define REP3(i, l, r) for (i32 i = (i32)(l); i < (i32)(r); ++i) #define REP(...) OVERRIDE4(__VA_ARGS__, REP3, REP2)(__VA_ARGS__) #define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i) #define PER3(i, l, r) for (i32 i = (i32)(r)-1; i >= (i32)(l); --i) #define PER(...) OVERRIDE4(__VA_ARGS__, PER3, PER2)(__VA_ARGS__) #define ALL(x) begin(x), end(x) #define LEN(x) (i32) size(x) void dbg(i32 x) { cerr << x; } void dbg(i64 x) { cerr << x; } template <typename T, typename U> void dbg(pair<T, U> p) { cerr << '(' << p.first << ", " << p.second << ')'; } template <typename T> void dbg(V<T> arr) { cerr << '['; REP(i, LEN(arr)) { if (i) { cerr << ", "; } dbg(arr[i]); } cerr << ']'; } void debug() { cerr << '\n'; } template <typename Head, typename... Tail> void debug(Head head, Tail... tail) { dbg(head); cerr << ", "; debug(tail...); } #ifdef DEBUGF #define DBG(...) \ do { \ cerr << #__VA_ARGS__ << " : "; \ debug(__VA_ARGS__); \ } while (false) #else #define DBG(...) (void)0 #endif #include "prison.h" VV<i32> devise_strategy(i32 n) { i32 k = 0; while (n >= (1 << (2 * k))) { ++k; } i32 h = 5 * k; VV<i32> s(h, V<i32>(n + 1)); REP(i, h) { i32 d = i / 5; i32 e = i % 5; s[i][0] = !!e; REP(j, 1, n + 1) { i32 rd = (j >> (2 * (k - 1 - d))) & 3; if (e == 0) { s[i][j] = d * 5 + rd + 1; } else if (rd > e - 1) { s[i][j] = -1; } else if (rd < e - 1) { s[i][j] = -2; } else if (d == k - 1) { s[i][j] = 0; } else { s[i][j] = 5 * (d + 1); } } } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...