제출 #131606

#제출 시각아이디문제언어결과실행 시간메모리
131606zoooma13Broken Device (JOI17_broken_device)C++14
41 / 100
44 ms3312 KiB
#include "bits/stdc++.h" #include "Annalib.h" using namespace std; void Anna( int N, long long X, int K, int P[] ){ vector <bool> bad(N, false); for(int i=0; i<K; i++) bad[P[i]] = true; int len = log2(X)+1 ,j = 0; vector <bool> enc(N ,0); for(int i=0; i<N-1; i++){ if(bad[i]) continue; bool bit = bool(X&(1LL<<j)); if(!bit) { enc[i] = 1 ,enc[i+1] = 0; j++ ,i++; } else if(bit && !bad[i+1]) { enc[i] = 1 ,enc[i+1] = 1; j++ ,i++; } if(j >= len) break; } for(int i=0; i<N; i++) Set(i ,enc[i]); //assert(false); }
#include "bits/stdc++.h" #include "Brunolib.h" using namespace std; long long Bruno( int N, int A[] ){ int j = 0; long long X = 0LL; for(int i=0; i<N-1; i++){ if(A[i]) { X |= (1LL<<j)*A[i+1]; j++ ,i++; } } return X; }
#Verdict Execution timeMemoryGrader output
Fetching results...