# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131706 | mahmoudbadawy | Broken Device (JOI17_broken_device) | C++17 | 43 ms | 3064 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Annalib.h"
int br[155];
void Anna( int N, long long X, int K, int P[] ){
for(int i=0;i<N;i++) br[i]=0;
for(int i=0;i<K;i++) br[P[i]]=br[P[i]^1]=1;
for(int i=0;i<N;i+=2)
{
if(br[i]) {Set(i,0); Set(i+1,0); continue;}
int b=X%3; X/=3;
if(b==0) {Set(i,0); Set(i+1,1);}
else if(b==1) {Set(i,1); Set(i+1,0);}
else {Set(i,1); Set(i+1,1);}
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
vector<int> v;
for(int i=0;i<N;i+=2)
{
if(A[i]+A[i+1]==0) continue;
if(A[i]==0&&A[i+1]==1) v.push_back(0);
else if(A[i]==1&&A[i+1]==0) v.push_back(1);
else v.push_back(2);
}
long long x=0;
for(int i=v.size()-1;i>=0;i--){x*=3; x+=v[i];}
return x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |