oj.uz

답안 #101856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101856 2019-03-20T14:40:04 Z hugo_pm Broken Device (JOI17_broken_device) C++17
0 / 100
 61 ms 3312 KB 
#include "Annalib.h"

typedef long long llg;
const int borne = 155;
int lenSeq, nbCas;
bool bloque[borne];
int ret[borne];
long long nombre;


void solve()
{
	int i = 0;
	for (int b = 62; b >= 0; --b) {
		while (bloque[i] || bloque[i+1]) ++i;
		ret[i] = 1;
		if (nombre & (1LL << (long long)(b))) ret[i+1] = 1;
		i += 2;
	}
}

void Anna( int N, long long X, int K, int P[] ){
	lenSeq = N;
	nombre = X;

	for (int i = 0; i < N; ++i) { bloque[i] = false; ret[i] = 0; }
	for (int i = 0; i < K; ++i) bloque[P[i]] = true;
	solve();
	for (int i = 0; i < N; ++i) Set(i, ret[i]);
	return;
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
	long long X = 0;
	int i = 0;
	for (int b = 62; b >= 0; --b) {
		while (A[i] == 0) ++i;
		++i;	
		if (A[i] == 1) X += 1LL << (long long)(b);
		++i;
	}
	return X;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 3072 KB Output isn't correct - L* = 0
2 Runtime error 24 ms 3072 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Incorrect 39 ms 2816 KB Output isn't correct - L* = 0
4 Incorrect 40 ms 2744 KB Output isn't correct - L* = 0
5 Incorrect 49 ms 3000 KB Output isn't correct - L* = 0
6 Runtime error 22 ms 2816 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 39 ms 2808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 24 ms 3056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 24 ms 2816 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Incorrect 50 ms 2560 KB Output isn't correct - L* = 0
11 Incorrect 43 ms 2800 KB Output isn't correct - L* = 0
12 Incorrect 41 ms 3056 KB Output isn't correct - L* = 0
13 Incorrect 55 ms 3000 KB Output isn't correct - L* = 0
14 Incorrect 53 ms 2800 KB Output isn't correct - L* = 0
15 Partially correct 40 ms 2816 KB Output is partially correct - L* = 15
16 Incorrect 61 ms 2800 KB Output isn't correct - L* = 0
17 Incorrect 44 ms 2968 KB Output isn't correct - L* = 0
18 Incorrect 37 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 50 ms 3312 KB Output isn't correct - L* = 0
20 Incorrect 45 ms 2800 KB Output isn't correct - L* = 0
21 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
22 Partially correct 47 ms 2816 KB Output is partially correct - L* = 14
23 Incorrect 49 ms 3056 KB Output isn't correct - L* = 0
24 Incorrect 52 ms 3000 KB Output isn't correct - L* = 0
25 Incorrect 47 ms 2816 KB Output isn't correct - L* = 0
26 Runtime error 27 ms 2800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Incorrect 39 ms 2800 KB Output isn't correct - L* = 0
28 Incorrect 43 ms 2808 KB Output isn't correct - L* = 0
29 Partially correct 37 ms 2816 KB Output is partially correct - L* = 14
30 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
31 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
32 Incorrect 57 ms 2800 KB Output isn't correct - L* = 0
33 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
34 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
35 Incorrect 37 ms 3056 KB Output isn't correct - L* = 0
36 Incorrect 43 ms 3016 KB Output isn't correct - L* = 0
37 Runtime error 28 ms 3056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Incorrect 48 ms 2816 KB Output isn't correct - L* = 0
39 Incorrect 49 ms 3072 KB Output isn't correct - L* = 0
40 Partially correct 43 ms 2800 KB Output is partially correct - L* = 14