oj.uz

답안 #468780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468780 2021-08-29T15:24:39 Z Omegaman Broken Device (JOI17_broken_device) C++14
0 / 100
 57 ms 2504 KB 
#include "Annalib.h"
#include <math.h>

bool isInArr(int ArrLen, int Arr[], int val) {
	for ( int i = 0; i < ArrLen; i++ )
		if (Arr[i] == val)
			return true;
	return false;
}

void Anna(int N, long long X, int K, int P[]){
	const int xl = int(log2(X) + 0.5);

	bool xa[N];
	long long x = X;
	for( int i = 0; i < N; i++ ){
		xa[i] = x % 2;
		x /= 2;
	}

	bool F[N];

	for ( int i = 0; i < N; i++ ) {
		F[i] = !isInArr(K, P, i);
	}
	
	bool M[N];

	int j = 0;
	for( int i = 0; i < N; i++){
		if (j < (xl/3+0.5)*3 &&
			F[i] &&
			(F[i + 1] == xa[j + 0] || F[i + 1]) &&
			(F[i + 2] == xa[j + 1] || F[i + 2])) {
			
			M[i + 0] =         1;
			M[i + 1] = xa[j + 0];
			M[i + 2] = xa[j + 1];

			j += 2;
			i += 2;
		} else {
			M[i] = 0;
		}
	}

	for ( int i = 0; i < N; i++ ) {
		Set(i, (int)M[i]);
	}
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
	long long X = 0;
	long long inc = 1;

	int len = 0;

	for( int i = 0; i < N; i++){
		if (A[i]) {
			len += 2;
			i += 2;
		}
	}

	bool M[len];

	int j = 0;
	for( int i = 0; i < N && j < len; i++){
		if (A[i]) {
			M[j + 0] = A[i + 1];
			M[j + 1] = A[i + 2];
			
			i += 2;
			j += 2;
		}
	}

	for (int i = 0; i < len; i++) {
		X += inc * M[i];
		inc *= 2;
	}

	return X;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 50 ms 2264 KB Output isn't correct - L* = 0
2 Partially correct 43 ms 2324 KB Output is partially correct - L* = 14
3 Partially correct 43 ms 2272 KB Output isn't correct - L* = 0
4 Partially correct 41 ms 2240 KB Output isn't correct - L* = 0
5 Partially correct 41 ms 2200 KB Output isn't correct - L* = 0
6 Partially correct 44 ms 2208 KB Output is partially correct - L* = 18
7 Partially correct 49 ms 2276 KB Output isn't correct - L* = 0
8 Partially correct 43 ms 2228 KB Output isn't correct - L* = 0
9 Partially correct 44 ms 2364 KB Output isn't correct - L* = 0
10 Partially correct 44 ms 2200 KB Output isn't correct - L* = 0
11 Partially correct 44 ms 2296 KB Output isn't correct - L* = 0
12 Partially correct 45 ms 2228 KB Output isn't correct - L* = 0
13 Partially correct 45 ms 2504 KB Output is partially correct - L* = 18
14 Partially correct 41 ms 2332 KB Output isn't correct - L* = 0
15 Partially correct 41 ms 2356 KB Output isn't correct - L* = 0
16 Partially correct 41 ms 2280 KB Output isn't correct - L* = 0
17 Partially correct 41 ms 2196 KB Output isn't correct - L* = 0
18 Partially correct 41 ms 2192 KB Output isn't correct - L* = 0
19 Partially correct 41 ms 2272 KB Output isn't correct - L* = 0
20 Partially correct 41 ms 2244 KB Output isn't correct - L* = 0
21 Partially correct 41 ms 2296 KB Output isn't correct - L* = 0
22 Partially correct 41 ms 2200 KB Output is partially correct - L* = 15
23 Partially correct 41 ms 2220 KB Output isn't correct - L* = 0
24 Partially correct 44 ms 2268 KB Output isn't correct - L* = 0
25 Partially correct 49 ms 2312 KB Output isn't correct - L* = 0
26 Partially correct 57 ms 2160 KB Output isn't correct - L* = 0
27 Partially correct 43 ms 2304 KB Output isn't correct - L* = 0
28 Partially correct 41 ms 2204 KB Output isn't correct - L* = 0
29 Partially correct 43 ms 2312 KB Output isn't correct - L* = 0
30 Partially correct 48 ms 2300 KB Output is partially correct - L* = 15
31 Partially correct 51 ms 2260 KB Output isn't correct - L* = 0
32 Partially correct 43 ms 2320 KB Output is partially correct - L* = 14
33 Partially correct 44 ms 2348 KB Output is partially correct - L* = 16
34 Partially correct 41 ms 2176 KB Output isn't correct - L* = 0
35 Partially correct 41 ms 2256 KB Output is partially correct - L* = 23
36 Partially correct 43 ms 2320 KB Output is partially correct - L* = 15
37 Partially correct 43 ms 2196 KB Output isn't correct - L* = 0
38 Partially correct 43 ms 2220 KB Output isn't correct - L* = 0
39 Partially correct 44 ms 2180 KB Output isn't correct - L* = 0
40 Partially correct 41 ms 2212 KB Output isn't correct - L* = 0