oj.uz

Submission #71486

# Submission time Handle Problem Language Result Execution time Memory
71486 2018-08-24T22:49:26 Z Bruteforceman Broken Device (JOI17_broken_device) C++11
0 / 100
 74 ms 11792 KB 
#include "Annalib.h"

void Anna( int N, long long X, int K, int P[] ){
	int broke[N];
	int val[N];
	for(int i = 0; i < N; i++) {
		broke[i] = 0;
		val[i] = 0;
	}
	for(int i = 0; i < K; i++) {
		broke[P[i]] = 1;
	}
	int bit = 0;
	for(int i = 0; i < N; i += 3) {
		if(bit > 62) break;
		int cnt = broke[i] + broke[i+1] + broke[i+2];
		if(cnt == 1) {
			if((X >> bit) & 1) {
				if(!broke[i]) val[i] = 1;
				else if (!broke[i+1]) val[i+1] = 1;
				else val[i+2] = 1;
			} else {
				if(!broke[i]) val[i] = 1;
				if(!broke[i+1]) val[i+1] = 1;
				if(!broke[i+2]) val[i+2] = 1;
			} 
			++bit;
		} else if (cnt == 0) {
			val[i] = 1;
			if((X >> bit) & 1) val[i+1] = 0;
			else val[i+1] = 1;
			++bit;
		}
	}
	for(int i = 0; i < N; i++) {
		Set(i, val[i]);
	} 
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
	int bit = 0;
	long long ans = 0;
	for(int i = 0; i < N; i += 3) {
		if(bit > 62) break;
		int cnt = A[i] + A[i+1] + A[i+2];
		if(cnt) {
			if(cnt & 1) ans |= 1LL << bit;
			++bit; 
		}
	}
	return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 41 ms 3592 KB Output isn't correct - L* = 0
3 Incorrect 55 ms 4168 KB Output isn't correct - L* = 0
4 Incorrect 46 ms 4456 KB Output isn't correct - L* = 0
5 Incorrect 49 ms 4712 KB Output isn't correct - L* = 0
6 Incorrect 51 ms 4928 KB Output isn't correct - L* = 0
7 Incorrect 74 ms 5024 KB Output isn't correct - L* = 0
8 Incorrect 52 ms 5272 KB Output isn't correct - L* = 0
9 Incorrect 56 ms 5520 KB Output isn't correct - L* = 0
10 Incorrect 67 ms 5824 KB Output isn't correct - L* = 0
11 Incorrect 50 ms 6152 KB Output isn't correct - L* = 0
12 Incorrect 46 ms 6344 KB Output isn't correct - L* = 0
13 Incorrect 47 ms 6528 KB Output isn't correct - L* = 0
14 Incorrect 43 ms 6776 KB Output isn't correct - L* = 0
15 Incorrect 48 ms 7016 KB Output isn't correct - L* = 0
16 Incorrect 53 ms 7256 KB Output isn't correct - L* = 0
17 Incorrect 55 ms 7504 KB Output isn't correct - L* = 0
18 Incorrect 47 ms 7800 KB Output isn't correct - L* = 0
19 Incorrect 57 ms 7984 KB Output isn't correct - L* = 0
20 Incorrect 47 ms 8232 KB Output isn't correct - L* = 0
21 Incorrect 45 ms 8456 KB Output isn't correct - L* = 0
22 Incorrect 47 ms 8760 KB Output isn't correct - L* = 0
23 Incorrect 50 ms 8936 KB Output isn't correct - L* = 0
24 Incorrect 63 ms 9376 KB Output isn't correct - L* = 0
25 Incorrect 55 ms 9424 KB Output isn't correct - L* = 0
26 Incorrect 49 ms 9928 KB Output isn't correct - L* = 0
27 Incorrect 45 ms 9928 KB Output isn't correct - L* = 0
28 Incorrect 44 ms 10168 KB Output isn't correct - L* = 0
29 Incorrect 46 ms 10472 KB Output isn't correct - L* = 0
30 Incorrect 45 ms 10792 KB Output isn't correct - L* = 0
31 Incorrect 46 ms 11000 KB Output isn't correct - L* = 0
32 Incorrect 47 ms 11136 KB Output isn't correct - L* = 0
33 Incorrect 61 ms 11408 KB Output isn't correct - L* = 0
34 Incorrect 48 ms 11704 KB Output isn't correct - L* = 0
35 Incorrect 61 ms 11704 KB Output isn't correct - L* = 0
36 Incorrect 54 ms 11792 KB Output isn't correct - L* = 0
37 Incorrect 47 ms 11792 KB Output isn't correct - L* = 0
38 Incorrect 53 ms 11792 KB Output isn't correct - L* = 0
39 Incorrect 44 ms 11792 KB Output isn't correct - L* = 0
40 Incorrect 47 ms 11792 KB Output isn't correct - L* = 0