Submission #26807

#TimeUsernameProblemLanguageResultExecution timeMemory
26807wangyenjenBroken Device (JOI17_broken_device)C++14
45 / 100
56 ms4636 KiB
/// Author: Wang, Yen-Jen #include "Annalib.h" #include <bits/stdc++.h> using namespace std; static bool st[150]; void Anna(int N , long long X , int K , int P[]) { memset(st , 0 , sizeof(st)); for(int i = 0; i < K; i++) st[P[i]] = 1; int c = 0; for(int i = 0; i < N; i++) { if(c == 60) Set(i , 0); else { if(i + 3 < N && !st[i] && !st[i + 1] && !st[i + 2] && !st[i + 3]) { Set(i , 1); Set(i + 1 , ((X>>c)&1)); c++; Set(i + 2 , ((X>>c)&1)); c++; Set(i + 3 , ((X>>c)&1)); c++; i += 3; } else Set(i , 0); } } }
/// Author: Wang, Yen-Jen #include "Brunolib.h" #include <bits/stdc++.h> using namespace std; long long Bruno(int N , int A[]) { long long X = 0; int cc = 0; for(int i = 0; i < N - 3; i++) { if(cc == 60) break; if(A[i]) { if(A[i + 1]) X |= (1ll<<cc); cc++; if(A[i + 2]) X |= (1ll<<cc); cc++; if(A[i + 3]) X |= (1ll<<cc); cc++; i += 3; } } return X; }
#Verdict Execution timeMemoryGrader output
Fetching results...