# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70122 | 2018-08-22T11:34:04 Z | Just_Solve_The_Problem | Broken Device (JOI17_broken_device) | C++11 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "Annalib.h" //#include "grader.cpp" #define ll long long using namespace std; void Anna( int N, long long X, int K, int P[] ){ vector < int > used(N, 0); vector < int > u(N, 0); for (int i = 0; i < K; i++) { used[P[i]] = 1; } int cur = 59; for (int i = 0; i + 1 < N && cur >= 0; i++) { if ((X >> cur) & 1) { if (used[i] || used[i + 1]) { continue; } else { u[i] = u[i + 1] = 1; i++; cur--; } } else { if (used[i]) { continue; } else { u[i] = 1; cur--; i++; } } } assert(cur == -1); for (int i = 0; i < N; i++) { Set(i, u[i]); } }