Submission #990653

#TimeUsernameProblemLanguageResultExecution timeMemory
990653MarwenElarbiBroken Device (JOI17_broken_device)C++17
0 / 100
31 ms2900 KiB
#include "Annalib.h" #include <bits/stdc++.h> using namespace std; void Anna( int N, long long X, int K, int P[] ){ int tab[N]; memset(tab,0,sizeof tab); for (int i = 0; i < K; ++i) { tab[P[i]]=-1; } int convert[65]; for (int i = 0; i < 64; ++i) { convert[i]=((1ll*(1<<i))&X)>0; //cout <<convert[i]<<" "; }//cout <<endl; int lst=0; for (int i = 0; i < N-1; ++i) { if(tab[i]!=-1&&tab[i+1]!=-1){ tab[i]=(convert[lst]==1); tab[i+1]=1; lst++; i+=2; } } for (int i = 0; i < N; ++i) { //cout <<tab[i]<<" "; if(tab[i]==1) Set(i,1); else Set(i,0); }//cout <<endl; }
#include "Brunolib.h" #include<bits/stdc++.h> using namespace std; long long Bruno( int N, int A[] ){ int lst=0; long long x=0; for (int i = 0; i < N-2; ++i) { if(A[i+1]==1&&A[i+2]!=1){ if(A[i]==1) x+=(1<<lst); lst++; } } if(A[N-1]==1&&A[N-2]==1) x+=(1<<lst); //cout <<x<<endl; return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...