Submission #131610

#TimeUsernameProblemLanguageResultExecution timeMemory
131610Osama_AlkhodairyBroken Device (JOI17_broken_device)C++17
0 / 100
4 ms1004 KiB
#include <bits/stdc++.h> //~ #include "grader.cpp" //~ #include "Bruno.cpp" #include "Annalib.h" using namespace std; void Anna( int N, long long X, int K, int P[] ){ auto set = [&](int x, int y){ if(x < 0 || x >= N) return; Set(x, y); }; vector <int> p; for(int i = 0 ; i < K ; i++){ p.push_back(P[i]); } int ind = 0; for(int i = 59 ; i >= 0 ; i--){ if(count(p.begin(), p.end(), ind + 1)){ Set(ind++, 0); i++; continue; } if(count(p.begin(), p.end(), ind)){ Set(ind++, 0); i++; continue; } Set(ind++, 1); set(ind++, (X >> i) & 1); } while(ind < N) set(ind++, 0); }
#include <bits/stdc++.h> #include "Brunolib.h" using namespace std; #define ll long long long long Bruno( int N, int A[] ){ ll ret = 0; int ind = 0; while(ind < N){ if(A[ind] == 0){ ind++; continue; } ret = ret * 2 + A[ind + 1]; ind += 2; } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...