Submission #1158658

#TimeUsernameProblemLanguageResultExecution timeMemory
1158658BolatuluPrisoner Challenge (IOI22_prison)C++20
53 / 100
8 ms1352 KiB
#include "prison.h" #include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("inline") #define pb push_back #define eb emplace_back #define md ((tl + tr) >> 1) #define TL v + v, tl, md #define TR v + v + 1, md + 1, tr #define all(x) (x).begin(), (x).end() #define F first #define S second using namespace std; typedef long long ll; const int N = 3e5 + 7; const ll INF = 1e18 + 7; vector <vector <int>> devise_strategy(int n) { vector <vector <int>> res(29, vector <int> (n + 1)); res[0][0] = 0; for (int i = 1;i <= n;i++) { res[0][i] = (i >> 14 & 1) + 1; } int cur = 1; for (int i = 13;i >= 0;i--) { res[cur][0] = res[cur + 1][0] = i & 1; if (i == 0) { for (int j = 1;j <= n;j++) { if (j & 1) { res[cur][j] = -1 - !(i & 1); res[cur + 1][j] = -1 - !(i & 1); } else { res[cur][j] = -1 - (i & 1); res[cur + 1][j] = -1 - (i & 1); } } break; } for (int j = 1;j <= n;j++) { int bit = j >> i & 1, bit1 = j >> i - 1 & 1; res[cur][j] = res[cur + 1][j] = cur + 2 + bit1; if (!bit) { res[cur + 1][j] = -1 - (i & 1); } else { res[cur][j] = -1 - !(i & 1); } } cur += 2; } return res; } // void solve() { // int n, m; // cin >> n >> m; // vector <int> x(m), y(m), w(m); // for (int i = 0;i < m;i++) // cin >> x[i] >> y[i] >> w[i]; // cout << max_weights(n, m, x, y, w); // } // signed main() { // solve(); // return 0; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...