답안 #310969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310969 2020-10-08T22:51:46 Z Lawliet Broken Device (JOI17_broken_device) C++17
0 / 100
53 ms 3584 KB
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 200;

bool blocked[MAXN];

void Anna(int N, long long X, int K, int P[] )
{
	for(int i = 0 ; i < K ; i++)
		blocked[ P[i] ] = true;

	for(int i = 0 ; i < N ; i += 2)
	{
		if( blocked[i] || blocked[i + 1] ) 
		{
			Set( i , 0 ); Set( i + 1 , 0 );
			continue;
		}

		Set( i , 1 ); Set( i + 1 , X%2 );
		X /= 2;
	}
}
#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

long long Bruno( int N, int A[] )
{
	lli ans = 0;

	for(int i = N - 2 ; i >= 0 ; i--)
		if( A[i] == 1 ) ans *= 2, ans += A[i + 1];

	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
2 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
3 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
4 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
5 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
6 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
7 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
8 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
9 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
10 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
11 Partially correct 41 ms 3208 KB Output isn't correct - L* = 0
12 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
13 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
14 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
15 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
16 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
17 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
18 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
19 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
20 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
21 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
22 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
23 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
24 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
25 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
26 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
27 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
28 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
29 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
30 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
31 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
32 Partially correct 41 ms 3584 KB Output isn't correct - L* = 0
33 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
34 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
36 Partially correct 53 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
38 Partially correct 41 ms 3328 KB Output isn't correct - L* = 0
39 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0
40 Partially correct 41 ms 3312 KB Output isn't correct - L* = 0