# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83781 | nikolapesic2802 | Broken Device (JOI17_broken_device) | C++14 | 53 ms | 3368 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 = 150;
static int possivel[MAXN],resposta[MAXN];
void Anna( int N, long long X, int K, int P[] ){
memset(possivel,1,sizeof(possivel));
memset(resposta,0,sizeof(resposta));
possivel[N] = 0;
for(int i = 0;i<K;i++) possivel[P[i]] = 0;
deque<int> digitos;
while(X != 0){
digitos.push_back(X % 2);
X /= 2;
}
for(int i = 0;i<100;i++) digitos.push_back(0);
for(int i = 0;i+2<N;i+=3){
int nao_pode = (possivel[i] + 2*possivel[i+1] + 4*possivel[i+2]) ^ 7;
int best_qtd = 0,mascara = 0;
if(!(nao_pode & 4) && digitos[0] == 1){
best_qtd = 1;
mascara = 4;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |