# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310971 | Lawliet | Broken Device (JOI17_broken_device) | C++17 | 45 ms | 3312 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;
const int MAXN = 200;
bool blocked[MAXN];
void Anna(int N, long long X, int K, int P[])
{
memset( blocked , false , sizeof(blocked) );
for(int i = 0 ; i < K ; i++)
blocked[ P[i] ] = true;
for(int i = 0 ; i < N ; i += 2)
{
if( blocked[i] || blocked[i + 1] )
{
Set( i , 0 ); Set( i + 1 , 0 );
continue;
}
Set( i , 1 ); Set( i + 1 , X%2 ); X /= 2;
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
long long Bruno(int N, int A[])
{
lli ans = 0;
for(int i = N - 2 ; i >= 0 ; i -= 2)
if( A[i] == 1 ) ans *= 2, ans += A[i + 1];
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |