oj.uz

답안 #313394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313394 2020-10-15T23:45:37 Z Kenzo_1114 Broken Device (JOI17_broken_device) C++17
0 / 100
 55 ms 3072 KB 
#include<bits/stdc++.h>
#include "Annalib.h"
using namespace std;
const int MAXN = 160;

bool marc[MAXN];

void Anna(int n, long long x, int k, int p[])
{
	for(int i = 0; i < k; i++)	marc[p[i]] = true;
	marc[n] = true;

	int bit = 0;
	for(int i = 0; i < n; i++)
	{	
		if(bit >= 60 || marc[i] || marc[i + 1])	Set(i, 0);
		else 
		{
			Set(i, 1);	i++;
			Set(i, (int) ((x & (1LL << bit)) > 0)); bit++;
		}
	}
}
#include<bits/stdc++.h>
#include "Brunolib.h"
using namespace std;

long long Bruno(int n, int a[])
{
	long long x = 0;
	int bit = 0;

	for(int i = 0; i < n; i++)	
		if(a[i])
		{	
			x += (long long) a[i + 1] << bit;
			i++, bit++;
		}

	return x;
}

Subtask #1
0.0 / 100.0

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