Submission #691241

#TimeUsernameProblemLanguageResultExecution timeMemory
691241amunduzbaevBroken Device (JOI17_broken_device)C++17
0 / 100
36 ms2516 KiB
#include "Annalib.h" #include "bits/stdc++.h" using namespace std; typedef long long ll; #define ar array //~ #define int ll void Anna(int n, ll x, int k, int p[] ){ vector<int> used(n, 0); for(int i=0;i<k;i++){ used[p[i]] = 1; Set(p[i], 0); } int j = 0; vector<int> a(n, 0); //~ cout<<n<<endl; for(int i=1;i<n;i++){ if(!used[i] && !used[i-1] && j < 60){ used[i] = used[i-1] = 1; //~ cout<<i - 1<<" "<<i<<" "<<(x >> j & 1)<<"\n"; a[i - 1] = 1, a[i] = (x >> j & 1); Set(i - 1, 1); Set(i, (x >> j & 1)); j++; } } for(int i=0;i<n;i++){ if(!used[i]) Set(i, 0); } //~ cout<<x<<"<-\n"; }
#include "Brunolib.h" #include "bits/stdc++.h" using namespace std; typedef long long ll; #define ar array //~ #define int ll ll Bruno(int n, int a[] ){ int j = 0; ll res = 0; for(int i=0;i<n;i++){ if(a[i]){ res |= (a[i + 1] << j); j++, i++; } } //~ cout<<res<<" <-\n"; return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...