oj.uz

답안 #127895

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127895 2019-07-10T08:15:36 Z Utaha Broken Device (JOI17_broken_device) C++14
0 / 100
 50 ms 3576 KB 
#include "Annalib.h"

void Anna( int N, long long X, int K, int P[] ){
	X^=0xba84d9302917c854;
	bool ret[150]={0};
	bool notused[150]={0};
	for(int i=0;i<K;i++){
		notused[P[i]]=1;
	}
	int pt=38;
	for(int i=0;i<N;i+=2){

		long long type=X%3;
		X/=3;

		if(type==0){
			if(notused[i]) continue;
			ret[i]=1;
			ret[i+1]=0;
		}
		else if(type==1){
			if(notused[i+1]) continue;
			ret[i]=0;
			ret[i+1]=1;
		}
		else{
			if(notused[i]||notused[i+1]) continue;
			ret[i]=ret[i+1]=1;
		}
		pt--;
		if(pt==0) break;
	}
	for(int i=0;i<N;i++) Set(i,ret[i]);
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
	long long ret=0;
	long long base=1;
	for(int i=0;i<N;i+=2){
		if(A[i]==0&&A[i+1]==0) continue;

		int type=-1;
		if(A[i]==1){
			if(A[i+1]==1) type=2;
			else type=0;
		}
		else type=1;

		ret+=base*type;
		base*=3;
	}
	return ret;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
2 Incorrect 40 ms 3576 KB Output isn't correct - L* = 0
3 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
4 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
5 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
6 Incorrect 43 ms 3192 KB Output isn't correct - L* = 0
7 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
8 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
9 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
10 Incorrect 43 ms 3312 KB Output isn't correct - L* = 0
11 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
12 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
13 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
14 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
15 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
16 Incorrect 44 ms 3232 KB Output isn't correct - L* = 0
17 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
18 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
19 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
20 Incorrect 40 ms 3064 KB Output isn't correct - L* = 0
21 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
22 Incorrect 40 ms 3256 KB Output isn't correct - L* = 0
23 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
24 Incorrect 50 ms 3312 KB Output isn't correct - L* = 0
25 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
26 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
27 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
28 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
29 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
30 Incorrect 41 ms 3056 KB Output isn't correct - L* = 0
31 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
32 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
34 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
35 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
36 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
37 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
38 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
39 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
40 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0