oj.uz

Submission #310981

# Submission time Handle Problem Language Result Execution time Memory
310981 2020-10-09T00:43:14 Z Lawliet Broken Device (JOI17_broken_device) C++14
0 / 100
 60 ms 3328 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAXN = 200;
 
int ord[MAXN];

bool blocked[MAXN];
 
void Anna(int N, long long X, int K, int P[])
{
	srand( 43278432 );

	iota( ord , ord + N , 0 );
	random_shuffle( ord , ord + N );

	memset( blocked , false , sizeof(blocked) );
	
	for(int i = 0 ; i < K ; i++)
		blocked[ P[i] ] = true;
 
	for(int i = 0 ; i < N ; i += 2)
	{
		if( blocked[ ord[i] ] ) 
		{
			Set( ord[i] , 0 ); Set( ord[i + 1] , 0 );
			continue;
		}

		if( X%2 == 1 && blocked[i + 1] )
		{
			Set( ord[i] , 0 ); Set( ord[i + 1] , 0 );
			continue;
		}

		Set( ord[i] , 1 ); Set( ord[i + 1] , X%2 ); X /= 2;
	}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long int lli;
 
const int MAXN = 200;

int orD[MAXN];

long long Bruno(int N, int A[])
{
	srand( 43278432 );

	iota( orD , orD + N , 0 );
	random_shuffle( orD , orD + N );

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
2 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
3 Partially correct 53 ms 3056 KB Output isn't correct - L* = 0
4 Partially correct 50 ms 3056 KB Output isn't correct - L* = 0
5 Partially correct 51 ms 3064 KB Output isn't correct - L* = 0
6 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
7 Partially correct 54 ms 3072 KB Output isn't correct - L* = 0
8 Partially correct 51 ms 3064 KB Output isn't correct - L* = 0
9 Partially correct 55 ms 3312 KB Output isn't correct - L* = 0
10 Partially correct 51 ms 3328 KB Output isn't correct - L* = 0
11 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
12 Partially correct 51 ms 3072 KB Output isn't correct - L* = 0
13 Partially correct 52 ms 3016 KB Output isn't correct - L* = 0
14 Partially correct 53 ms 3072 KB Output isn't correct - L* = 0
15 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
16 Partially correct 52 ms 3072 KB Output isn't correct - L* = 0
17 Partially correct 51 ms 3072 KB Output isn't correct - L* = 0
18 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
19 Partially correct 51 ms 3072 KB Output isn't correct - L* = 0
20 Partially correct 52 ms 3312 KB Output isn't correct - L* = 0
21 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
22 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
23 Partially correct 60 ms 3056 KB Output isn't correct - L* = 0
24 Partially correct 52 ms 3072 KB Output isn't correct - L* = 0
25 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
26 Partially correct 52 ms 3072 KB Output isn't correct - L* = 0
27 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
28 Partially correct 52 ms 3072 KB Output isn't correct - L* = 0
29 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
30 Partially correct 53 ms 3072 KB Output isn't correct - L* = 0
31 Partially correct 58 ms 3056 KB Output isn't correct - L* = 0
32 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
33 Partially correct 53 ms 3136 KB Output isn't correct - L* = 0
34 Partially correct 51 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 51 ms 3072 KB Output isn't correct - L* = 0
36 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
37 Partially correct 52 ms 3072 KB Output isn't correct - L* = 0
38 Partially correct 53 ms 3056 KB Output isn't correct - L* = 0
39 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
40 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0