oj.uz

Submission #502641

# Submission time Handle Problem Language Result Execution time Memory
502641 2022-01-06T11:25:23 Z MilosMilutinovic Broken Device (JOI17_broken_device) C++14
0 / 100
 41 ms 2740 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

int b[]={2,4,5,6,7,8,12,15,17,19,21,22,24,27,33,36,37,38,39,43,44,47,49,52,57,61,62,63,68,72,75,76,78,79,81,82,87,88,89,91,94,97,99,101,107,108,109,113,115,117,118,124,126,127,134,135,136,137,138,139,145,147,148,149};

void Anna(int N,long long X,int K,int P[]){
	vector<int> arr(150);
	for (int i=0;i<64;i++) {
		if (X&(1ll<<i)) {
			arr[b[i]-1]=1;
		}
	}
	for (int i=0;i<150;i++) Set(i,arr[i]);
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;

int b[]={2,4,5,6,7,8,12,15,17,19,21,22,24,27,33,36,37,38,39,43,44,47,49,52,57,61,62,63,68,72,75,76,78,79,81,82,87,88,89,91,94,97,99,101,107,108,109,113,115,117,118,124,126,127,134,135,136,137,138,139,145,147,148,149};

long long Bruno(int N,int A[]) {
	long long x=0;
	for (int i=0;i<64;i++) {
		if (A[b[i]-1]) x+=(1ll<<i);
	}
	return x;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 41 ms 2416 KB Output isn't correct - L* = 0
2 Partially correct 33 ms 2660 KB Output isn't correct - L* = 0
3 Partially correct 37 ms 2468 KB Output isn't correct - L* = 0
4 Partially correct 32 ms 2544 KB Output isn't correct - L* = 0
5 Partially correct 33 ms 2564 KB Output isn't correct - L* = 0
6 Partially correct 30 ms 2440 KB Output isn't correct - L* = 0
7 Partially correct 28 ms 2572 KB Output isn't correct - L* = 0
8 Partially correct 28 ms 2456 KB Output isn't correct - L* = 0
9 Partially correct 30 ms 2412 KB Output isn't correct - L* = 0
10 Partially correct 28 ms 2480 KB Output isn't correct - L* = 0
11 Partially correct 28 ms 2480 KB Output isn't correct - L* = 0
12 Partially correct 36 ms 2496 KB Output isn't correct - L* = 0
13 Partially correct 28 ms 2460 KB Output isn't correct - L* = 0
14 Partially correct 28 ms 2480 KB Output isn't correct - L* = 0
15 Partially correct 28 ms 2456 KB Output isn't correct - L* = 0
16 Partially correct 36 ms 2412 KB Output isn't correct - L* = 0
17 Partially correct 39 ms 2452 KB Output isn't correct - L* = 0
18 Partially correct 35 ms 2560 KB Output isn't correct - L* = 0
19 Partially correct 28 ms 2460 KB Output isn't correct - L* = 0
20 Partially correct 32 ms 2480 KB Output isn't correct - L* = 0
21 Partially correct 28 ms 2580 KB Output isn't correct - L* = 0
22 Partially correct 36 ms 2564 KB Output isn't correct - L* = 0
23 Partially correct 41 ms 2428 KB Output isn't correct - L* = 0
24 Partially correct 34 ms 2740 KB Output isn't correct - L* = 0
25 Partially correct 28 ms 2460 KB Output isn't correct - L* = 0
26 Partially correct 27 ms 2540 KB Output isn't correct - L* = 0
27 Partially correct 27 ms 2552 KB Output isn't correct - L* = 0
28 Partially correct 39 ms 2464 KB Output isn't correct - L* = 0
29 Partially correct 37 ms 2496 KB Output isn't correct - L* = 0
30 Partially correct 28 ms 2604 KB Output isn't correct - L* = 0
31 Partially correct 28 ms 2428 KB Output isn't correct - L* = 0
32 Partially correct 30 ms 2564 KB Output isn't correct - L* = 0
33 Partially correct 28 ms 2404 KB Output isn't correct - L* = 0
34 Partially correct 31 ms 2488 KB Output isn't correct - L* = 0
35 Partially correct 30 ms 2508 KB Output isn't correct - L* = 0
36 Partially correct 30 ms 2460 KB Output isn't correct - L* = 0
37 Partially correct 28 ms 2572 KB Output isn't correct - L* = 0
38 Partially correct 27 ms 2596 KB Output isn't correct - L* = 0
39 Partially correct 28 ms 2476 KB Output isn't correct - L* = 0
40 Partially correct 27 ms 2592 KB Output isn't correct - L* = 0