# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126509 | briansu | Broken Device (JOI17_broken_device) | C++14 | 73 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;
typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i ++)
void Anna( int N, long long X, int K, int P[] ){
vector<ll> v(N, 1);
REP(i, K)v[P[i]] = 0;
ll ct = 0, tt = 0;
vector<ll> d(N, 0);
REP(i, N)
{
if(ct == 60)d[i] = 0;
else if(!v[i])tt++, d[i] = 0;
else if((tt&1) != (X&1))d[i] = 0, tt++;
else d[i] = 1, tt = 0, X /= 2, ct ++;
}
REP(i, N)Set(i, d[i]);
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i ++)
long long Bruno( int N, int A[] ){
ll n = N;
ll tt = 0, t = 1, fg = 0;
REP(i, n)
{
if(!A[i])fg = !fg;
else tt += t * fg, t *= 2, fg = 0;
}
return tt;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |