Submission #70118

#TimeUsernameProblemLanguageResultExecution timeMemory
70118Just_Solve_The_ProblemBroken Device (JOI17_broken_device)C++11
0 / 100
74 ms3824 KiB
#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] || u[i - 1] == 1) { continue; } else { u[i] = 1; cur--; i++; } } } for (int i = 0; i < N; i++) { Set(i, u[i]); } }
#include <bits/stdc++.h> #include "Brunolib.h" #define ll long long using namespace std; long long Bruno( int N, int A[] ){ ll ret = 0; int cur = 59; for (int i = 0; i + 1 < N; i++) { if (A[i]) { if (A[i + 1]) { ret |= (1 << cur); } i++; cur--; } } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...