oj.uz

Submission #92382

# Submission time Handle Problem Language Result Execution time Memory
92382 2019-01-02T17:21:16 Z igzi Broken Device (JOI17_broken_device) C++17
85 / 100
 37 ms 3568 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;

void Anna( int N, long long x, int K, int P[]){
int i;
bool b[155];
int a[155]={67, 70, 94, 21, 88, 97, 77, 78, 89, 138, 111, 13, 75, 123, 145, 26, 62, 91, 105, 115, 76, 114, 144, 16, 106, 74, 108, 102, 86, 46, 28, 98, 5, 149, 126, 38, 130, 90, 27, 14, 119, 128, 139, 20, 53, 85, 117, 109, 39, 100, 24, 49, 0, 65, 143, 36, 61, 134, 73, 99, 4, 69, 82, 33, 136, 137, 147, 66, 6, 25, 19, 127, 133, 56, 40, 116, 23, 83, 68, 84, 71, 48, 54, 51, 30, 52, 31, 7, 12, 107, 55, 35, 22, 103, 8, 140, 121, 135, 141, 131, 57, 15, 101, 81, 118, 18, 129, 93, 11, 45, 9, 125, 148, 146, 63, 64, 72, 41, 50, 29, 80, 120, 79, 110, 47, 87, 60, 95, 1, 142, 42, 44, 58, 10, 132, 37, 113, 122, 43, 17, 2, 124, 104, 59, 92, 32, 3, 112, 34, 96};
for(i=0;i<N;i++) b[i]=false;
for(i=0;i<K;i++){
b[P[i]]=true;}
for(i=0;i<N;i+=2){
if(b[a[i]] || b[a[i+1]]) {Set(a[i],0); Set(a[i+1],0); continue;}
if(x%3==0) {Set(a[i],0); Set(a[i+1],1);}
if(x%3==1) {Set(a[i],1); Set(a[i+1],0);}
if(x%3==2) {Set(a[i],1); Set(a[i+1],1);}
x/=3;
}
}
#include <bits/stdc++.h>
#include "Brunolib.h"

using namespace std;

long long Bruno( int N, int A[]){
long long ans,st,i;
int a[155]={67, 70, 94, 21, 88, 97, 77, 78, 89, 138, 111, 13, 75, 123, 145, 26, 62, 91, 105, 115, 76, 114, 144, 16, 106, 74, 108, 102, 86, 46, 28, 98, 5, 149, 126, 38, 130, 90, 27, 14, 119, 128, 139, 20, 53, 85, 117, 109, 39, 100, 24, 49, 0, 65, 143, 36, 61, 134, 73, 99, 4, 69, 82, 33, 136, 137, 147, 66, 6, 25, 19, 127, 133, 56, 40, 116, 23, 83, 68, 84, 71, 48, 54, 51, 30, 52, 31, 7, 12, 107, 55, 35, 22, 103, 8, 140, 121, 135, 141, 131, 57, 15, 101, 81, 118, 18, 129, 93, 11, 45, 9, 125, 148, 146, 63, 64, 72, 41, 50, 29, 80, 120, 79, 110, 47, 87, 60, 95, 1, 142, 42, 44, 58, 10, 132, 37, 113, 122, 43, 17, 2, 124, 104, 59, 92, 32, 3, 112, 34, 96};
ans=0;
st=1;
for(i=0;i<N;i+=2){
if(A[a[i]]==0 && A[a[i+1]]==0) continue;
if(A[a[i]]==1 && A[a[i+1]]==0) ans+=st;
if(A[a[i]]==1 && A[a[i+1]]==1) ans+=2*st;
st*=3;
}
return ans;
}

Subtask #1
85.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 35 ms 3568 KB Output is partially correct - L* = 38
2 Correct 35 ms 3312 KB Output is correct - L* = 40
3 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
4 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
5 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
6 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
7 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
8 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
9 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
10 Partially correct 36 ms 3056 KB Output is partially correct - L* = 38
11 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
12 Partially correct 35 ms 3256 KB Output is partially correct - L* = 39
13 Partially correct 36 ms 3312 KB Output is partially correct - L* = 38
14 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
15 Partially correct 34 ms 3312 KB Output is partially correct - L* = 38
16 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
17 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
18 Correct 35 ms 3312 KB Output is correct - L* = 40
19 Partially correct 34 ms 3312 KB Output is partially correct - L* = 38
20 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
21 Partially correct 36 ms 3384 KB Output is partially correct - L* = 39
22 Correct 36 ms 3312 KB Output is correct - L* = 40
23 Partially correct 34 ms 3312 KB Output is partially correct - L* = 38
24 Correct 34 ms 3256 KB Output is correct - L* = 40
25 Partially correct 34 ms 3312 KB Output is partially correct - L* = 39
26 Correct 35 ms 3312 KB Output is correct - L* = 40
27 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
28 Partially correct 35 ms 3056 KB Output is partially correct - L* = 39
29 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
30 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
31 Partially correct 37 ms 3312 KB Output is partially correct - L* = 39
32 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
33 Partially correct 35 ms 3312 KB Output is partially correct - L* = 37
34 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
35 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
36 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
37 Partially correct 35 ms 3312 KB Output is partially correct - L* = 38
38 Partially correct 35 ms 3312 KB Output is partially correct - L* = 39
39 Partially correct 35 ms 3056 KB Output is partially correct - L* = 37
40 Partially correct 36 ms 3568 KB Output is partially correct - L* = 39