답안 #310968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310968 2020-10-08T22:50:46 Z Lawliet Broken Device (JOI17_broken_device) C++17
0 / 100
2 ms 1164 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 , 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 Incorrect 1 ms 1040 KB Wrong Answer [2]
2 Incorrect 1 ms 916 KB Wrong Answer [2]
3 Incorrect 1 ms 916 KB Wrong Answer [2]
4 Incorrect 1 ms 1044 KB Wrong Answer [2]
5 Incorrect 1 ms 1160 KB Wrong Answer [2]
6 Incorrect 1 ms 1044 KB Wrong Answer [2]
7 Incorrect 1 ms 1032 KB Wrong Answer [2]
8 Incorrect 1 ms 1028 KB Wrong Answer [2]
9 Incorrect 0 ms 916 KB Wrong Answer [2]
10 Incorrect 1 ms 1036 KB Wrong Answer [2]
11 Incorrect 1 ms 916 KB Wrong Answer [2]
12 Incorrect 1 ms 916 KB Wrong Answer [2]
13 Incorrect 1 ms 1028 KB Wrong Answer [2]
14 Incorrect 2 ms 788 KB Wrong Answer [2]
15 Incorrect 1 ms 908 KB Wrong Answer [2]
16 Incorrect 2 ms 1164 KB Wrong Answer [2]
17 Incorrect 1 ms 1032 KB Wrong Answer [2]
18 Incorrect 2 ms 916 KB Wrong Answer [2]
19 Incorrect 1 ms 1024 KB Wrong Answer [2]
20 Incorrect 1 ms 1032 KB Wrong Answer [2]
21 Incorrect 0 ms 916 KB Wrong Answer [2]
22 Incorrect 1 ms 1032 KB Wrong Answer [2]
23 Incorrect 0 ms 916 KB Wrong Answer [2]
24 Incorrect 1 ms 1036 KB Wrong Answer [2]
25 Incorrect 0 ms 916 KB Wrong Answer [2]
26 Incorrect 1 ms 916 KB Wrong Answer [2]
27 Incorrect 1 ms 916 KB Wrong Answer [2]
28 Incorrect 2 ms 1032 KB Wrong Answer [2]
29 Incorrect 1 ms 788 KB Wrong Answer [2]
30 Incorrect 1 ms 788 KB Wrong Answer [2]
31 Incorrect 2 ms 1160 KB Wrong Answer [2]
32 Incorrect 1 ms 916 KB Wrong Answer [2]
33 Incorrect 1 ms 1032 KB Wrong Answer [2]
34 Incorrect 2 ms 916 KB Wrong Answer [2]
35 Incorrect 1 ms 1036 KB Wrong Answer [2]
36 Incorrect 0 ms 916 KB Wrong Answer [2]
37 Incorrect 1 ms 1036 KB Wrong Answer [2]
38 Incorrect 1 ms 916 KB Wrong Answer [2]
39 Incorrect 1 ms 916 KB Wrong Answer [2]
40 Incorrect 1 ms 1032 KB Wrong Answer [2]