# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974392 | 12345678 | Broken Device (JOI17_broken_device) | C++17 | 33 ms | 3060 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 nx=150;
void Anna( int N, long long X, int K, int P[] ){
vector<int> b(nx);
for (int i=0; i<K; i++) b[P[i]]=1;
for (int i=0; i<75; i++)
{
if (b[2*i]||b[2*i+1]) Set(2*i, 0), Set(2*i+1, 0);
else Set(2*i, 1), Set(2*i+1, X%2), X/=2;
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int kx=65;
long long Bruno( int N, int A[] ){
vector<ll> p(kx);
ll res=0, cnt=0;
p[0]=1;
for (int i=1; i<kx; i++) p[i]=p[i-1]*2;
for (int i=0; i<75; i++) if (A[2*i]) res+=p[cnt]*A[2*i+1], cnt++;
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |