oj.uz

답안 #123061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123061 2019-06-30T07:03:03 Z tjd229 Broken Device (JOI17_broken_device) C++14
0 / 100
 47 ms 3320 KB 
#include "Annalib.h"
void Anna(int N, long long X, int K, int P[]) {
	int mem[150];
	int b[60] = { 0 };
	for (int i = 0; i < N; ++i) mem[i] = 1;
	for (int i = 0; i < K; ++i) mem[P[i]] = 0;
	for (int i = 0; X; ++i,X>>=1) 
		b[i] = X & 1;
	int pos = 0;
	for (int i = 0; i < 150; i += 3) {
		int s = mem[i] + mem[i + 1] + mem[i + 2];
		int mask = (mem[i] << 2) + mem[i + 1] + mem[i + 1] + mem[i + 2];
		if (s == 0) continue;
		//pos chk
		if (pos >= 60) {
			mem[i] = mem[i + 1] = mem[i + 2] = 0;
			continue;
		}
		else if (pos == 59) s = 1;
		if (s == 3) {
			if (b[pos] + b[pos + 1] == 2) mem[i] = mem[i + 1] = mem[i + 2] = 1;
			else if (b[pos] + b[pos + 1] == 0) {
				mem[i] = mem[i + 2] = 1;
				mem[i + 1] = 0;
			}
			else {
				mem[i] = mem[i + 2] = 0;
				mem[i + 1] = 1;
				mem[b[pos] ? i : i + 2] = 1;
			}
			pos += 2;
			continue;
		}
		if (s == 2) {
			if (mask == 3) {
				if (b[pos] == 0 && b[pos+1] == 1) {
					mem[i] = 0;
					mem[i + 1] = mem[i + 2] = 1;
					pos += 2;
				}
				else s = 1;
			}
			else if (mask == 6) {
				if (b[pos] == 1 && b[pos+1] == 0) {
					mem[i] = mem[i + 1] = 1;
					mem[i + 2] = 0;
					pos += 2;
				}
				else s = 1;
			}
			else {
				if (b[pos] + b[pos + 1] == 0) {
					mem[i] = mem[i + 2] = 1;
					mem[i + 1] = 0;
					pos += 2;
				}
				else s = 1;
			}
		}
		if (s == 1) {
			if (b[pos]) {
				if (mask & 6) {
					mem[i] = mem[i + 1] = mem[i + 2] = 0;
					mem[mask & 4 ? i + 1 : i] = 1;
					++pos;
				}
				else s = 0;
			}
			else {
				if (mask & 1) {
					mem[i] = mem[i + 1] = 0;
					mem[i + 2] = 1;
					++pos;
				}
				else s = 0;
			}
		}
		if (s == 0) mem[i] = mem[i + 1] = mem[i + 2] = 0;
	}
	for (int i = 0; i < N; ++i) Set(i, mem[i]);
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
	long long X = 0;
	int recon[60] = { 0 };
	int pos = 0;
	for (int i = 0; i < N; i += 3) {
		int mask = (A[i] << 2) + A[i + 1] + A[i + 1] + A[i + 2];
		if (mask == 1) ++pos;
		else if (mask == 2 || mask == 4) recon[pos++] = 1;
		else if (mask == 3)//01
			recon[++pos] = 1, ++pos;
		else if (mask == 5) pos += 2;//0
		else if (mask == 6) recon[pos++] = 1, ++pos;
		else if (mask == 7)
			recon[pos] = recon[pos + 1] = 1, pos += 2;		
	}
	while (pos--) {
		X <<= 1;
		X += recon[pos];
	}
	return X;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 40 ms 3056 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 39 ms 3312 KB Output isn't correct - L* = 0
6 Incorrect 39 ms 3248 KB Output isn't correct - L* = 0
7 Incorrect 39 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 40 ms 3256 KB Output isn't correct - L* = 0
11 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
12 Incorrect 41 ms 3256 KB Output isn't correct - L* = 0
13 Incorrect 41 ms 3312 KB Output isn't correct - L* = 0
14 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
15 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
16 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
17 Incorrect 41 ms 3064 KB Output isn't correct - L* = 0
18 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
20 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
21 Incorrect 40 ms 3256 KB Output isn't correct - L* = 0
22 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
23 Incorrect 47 ms 3144 KB Output isn't correct - L* = 0
24 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
25 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 39 ms 3320 KB Output isn't correct - L* = 0
27 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
28 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
29 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
30 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
31 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
32 Incorrect 39 ms 3320 KB Output isn't correct - L* = 0
33 Incorrect 39 ms 3104 KB Output isn't correct - L* = 0
34 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
35 Incorrect 40 ms 3312 KB Output isn't correct - L* = 0
36 Incorrect 39 ms 3320 KB Output isn't correct - L* = 0
37 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
38 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
39 Incorrect 39 ms 3312 KB Output isn't correct - L* = 0
40 Incorrect 39 ms 3064 KB Output isn't correct - L* = 0