# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69079 | IvanC | Broken Device (JOI17_broken_device) | C++17 | 78 ms | 4072 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+1<N && !digitos.empty();i+=2){
if(digitos.front() == 0){
if(!possivel[i+1]) continue;
resposta[i] = 0;
resposta[i+1] = 1;
digitos.pop_front();
if(!possivel[i] || digitos.front() != 0) continue;
resposta[i] = 1;
digitos.pop_front();
}
else{
if(!possivel[i]) continue;
resposta[i] = 1;
resposta[i+1] = 0;
digitos.pop_front();
}
}
for(int i = 0;i<N;i++){
Set( i, resposta[i] );
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
vector<int> digitos;
long long ans = 0;
for(int i = 0;i+1<N;i+=2){
int numero = A[i] + 2*A[i+1];
if(numero == 1){
digitos.push_back(1);
}
else if(numero == 2){
digitos.push_back(0);
}
else if(numero == 3){
digitos.push_back(0);
digitos.push_back(0);
}
}
while(!digitos.empty() && digitos.back() == 0){
digitos.pop_back();
}
for(int i = 0;i<digitos.size();i++){
if(digitos[i]) ans += (1LL << i);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |