Submission #112568

#TimeUsernameProblemLanguageResultExecution timeMemory
112568tincamateiBroken Device (JOI17_broken_device)C++14
41 / 100
83 ms3072 KiB
#include "Annalib.h" #include <cstdio> const int MAX_N = 150; bool broken[MAX_N]; void Anna(int N, long long X, int k, int P[]) { int lb = 0; for(int i = 0; i < N; ++i) broken[i] = false; for(int i = 0; i < k; ++i) broken[P[i]] = true; for(int i = 0; i < N; i += 2) { if(broken[i] || broken[i + 1] || lb >= 62) { Set(i, 0); Set(i + 1, 0); } else if(lb < 62) { Set(i, 1); Set(i + 1, ((1LL << lb) & X) > 0); ++lb; } } }
#include "Brunolib.h" #include <cstdio> long long Bruno(int N, int A[]) { int lb = 0; long long rez = 0LL; for(int i = 0; i < N; i += 2) { if(lb < 62 && A[i] == 1) { rez = ((((long long)A[i + 1]) << lb) | rez); ++lb; } } return rez; }
#Verdict Execution timeMemoryGrader output
Fetching results...