# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
448145 | JovanB | Broken Device (JOI17_broken_device) | C++17 | 44 ms | 2516 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;
using ll = long long;
static const ll K = 626237348924392349LL;
static int radi[1005];
static int ord[] = {129, 130, 126, 98, 96, 136, 122, 82, 86, 102, 18, 124, 32, 40, 71, 51, 91, 108, 94, 17, 113, 47, 64, 66, 65, 7, 131, 76, 138, 99, 77, 81, 54, 35, 56, 39, 25, 3, 87, 101, 61, 68, 14, 112, 24, 107, 97, 19, 104, 59, 75, 33, 21, 145, 78, 15, 120, 140, 36, 44, 83, 38, 46, 103, 84, 95, 57, 22, 37, 23, 70, 149, 31, 148, 121, 110, 11, 2, 100, 42, 30, 52, 72, 53, 67, 29, 132, 139, 144, 146, 45, 26, 93, 147, 135, 80, 116, 114, 49, 4, 88, 16, 90, 127, 20, 143, 85, 55, 41, 123, 92, 10, 13, 105, 63, 58, 0, 60, 109, 34, 50, 141, 115, 117, 134, 28, 9, 118, 48, 1, 12, 6, 142, 119, 62, 128, 27, 133, 5, 43, 137, 73, 106, 8, 74, 125, 69, 111, 79, 89};
void Anna(int _n, long long X, int _k, int P[] ){
int n = _n;
int k = _k;
for(int i=0; i<n; i++) radi[i] = 1;
for(int i=0; i<k; i++) radi[P[i]] = 0;
if(k > 38){
for(int i=0; i<n; i++) Set(i, 1);
return;
}
X ^= K;
int j = 0;
for(int i=0; i<38; i++){
int treba = X%3;
X /= 3;
treba++;
for(;;){
if(treba/2 <= radi[ord[j]] && treba%2 <= radi[ord[j+1]]){
Set(ord[j], treba/2);
Set(ord[j+1], treba%2);
j += 2;
break;
}
Set(ord[j], 0);
Set(ord[j+1], 0);
j += 2;
}
}
while(j < n){
Set(ord[j], 0);
j++;
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll K = 626237348924392349LL;
static int ord[] = {129, 130, 126, 98, 96, 136, 122, 82, 86, 102, 18, 124, 32, 40, 71, 51, 91, 108, 94, 17, 113, 47, 64, 66, 65, 7, 131, 76, 138, 99, 77, 81, 54, 35, 56, 39, 25, 3, 87, 101, 61, 68, 14, 112, 24, 107, 97, 19, 104, 59, 75, 33, 21, 145, 78, 15, 120, 140, 36, 44, 83, 38, 46, 103, 84, 95, 57, 22, 37, 23, 70, 149, 31, 148, 121, 110, 11, 2, 100, 42, 30, 52, 72, 53, 67, 29, 132, 139, 144, 146, 45, 26, 93, 147, 135, 80, 116, 114, 49, 4, 88, 16, 90, 127, 20, 143, 85, 55, 41, 123, 92, 10, 13, 105, 63, 58, 0, 60, 109, 34, 50, 141, 115, 117, 134, 28, 9, 118, 48, 1, 12, 6, 142, 119, 62, 128, 27, 133, 5, 43, 137, 73, 106, 8, 74, 125, 69, 111, 79, 89};
long long Bruno( int N, int A[] ){
int j = 0;
ll p3 = 1;
ll res = 0;
for(int i=0; i<38; i++){
int tr;
for(;;){
tr = 2*A[ord[j]] + A[ord[j+1]];
j++;
if(tr) break;
}
res += (tr-1)*p3;
p3 *= 3;
}
return res ^ K;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |