# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126534 | briansu | Broken Device (JOI17_broken_device) | C++14 | 40 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;
vector<ll> d(N, 0);
REP(i, N)
{
ll a = (X & 1) > 0;
ll b = (X & 2) > 0;
ll c = (X & 4) > 0;
if(ct == 60 || i >= N - 3)d[i] = 0;
else if(v[i] && (!a || v[i + 1]) && (!b || v[i + 2]) && (!c || v[i + 3]))d[i] = 1, d[i + 1] = a, d[i + 2] = b, d[i + 3] = c, i += 3, ct += 3, X >>= 3;
else d[i] = 0;
}
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])tt += t * A[i + 1] + (t * 2) * A[i + 2] + (t * 4) * A[i + 3], t <<= 3, i += 3;
}
return tt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |