# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261485 | arnold518 | Broken Device (JOI17_broken_device) | C++14 | 70 ms | 3328 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"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static const int MAXN = 150;
static const int MAXK = 40;
static int N, K, *P;
static ll X;
static int A[MAXN+10];
static int PP[160];
static int QQ[160];
static int cnt=1;
void Anna(int _N, ll _X, int _K, int _P[])
{
N=_N; X=_X; K=_K; P=_P;
for(int i=0; i<N; i++) PP[i]=i;
srand(cnt++);
random_shuffle(PP, PP+N);
for(int i=0; i<N; i++) QQ[PP[i]]=i;
for(int i=0; i<K; i++) A[QQ[P[i]]]=-1;
ll now=X;
for(int i=0; i<N; i+=2)
{
if(A[i]==-1 || A[i+1]==-1)
{
A[i]=0; A[i+1]=0;
}
else
{
if(now%3==0) A[i]=0, A[i+1]=1;
else if(now%3==1) A[i]=1, A[i+1]=0;
else if(now%3==2) A[i]=1, A[i+1]=1;
now/=3;
}
}
for(int i=0; i<N; i++) Set(PP[i], A[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static int N, *A;
static int PP[160];
static int QQ[160];
static int cnt=1;
ll Bruno(int _N, int _A[])
{
N=_N; A=_A;
ll ret=0;
for(int i=0; i<N; i++) PP[i]=i;
srand(cnt++);
random_shuffle(PP, PP+N);
for(int i=0; i<N; i++) QQ[PP[i]]=i;
for(int i=N-2; i>=0; i-=2)
{
if(A[PP[i]]==0 && A[PP[i+1]]==0) continue;
if(A[PP[i]]==0 && A[PP[i+1]]==1) ret=ret*3+0;
if(A[PP[i]]==1 && A[PP[i+1]]==0) ret=ret*3+1;
if(A[PP[i]]==1 && A[PP[i+1]]==1) ret=ret*3+2;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |