oj.uz

Submission #55108

# Submission time Handle Problem Language Result Execution time Memory
55108 2018-07-06T05:11:06 Z ksun48 Broken Device (JOI17_broken_device) C++14
100 / 100
 107 ms 3848 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

void done(vector<LL> message, vector<LL> perm){
	for(int i = 0; i < message.size(); i++){
		Set(i, message[perm[i]]);
	}
}

void Anna(int N, long long X, int K, int P[]){

	// shared initialization
	static mt19937_64 mt1(4848);
	static mt19937_64 mt2(48222);
	static LL B = 60;
	LL Y = mt1() & ((1LL << B) - 1);
	vector<LL> perm(N);
	for(int i = 0; i < N; i++){
		perm[i] = i;
	}
	for(int i = N-1; i >= 0; i--){
		int d = mt2() % (i+1);
		if(d < 0){
			d += (i+1);
		}
		swap(perm[i], perm[d]);
	}
	// shared initialization

	X ^= Y;

	vector<LL> message(N, 0);
	// boilerplate
	// ----------------------------------

	vector<LL> bad(N, 0);
	for(int i = 0; i < K; i++){
		bad[perm[P[i]]] = 1;
	}

	vector<LL> usable;
	for(int i = 0; i * 2 < N; i++){
		if(!bad[2*i] && !bad[2*i+1]){
			usable.push_back(i);
		}
	}

	// 01 10 11
	vector<LL> num;
	for(int i = 0; i < 38; i++){
		num.push_back(1 + (X % 3));
		X /= 3;
	}
	reverse(num.begin(), num.end());
	int r = 0;
	for(int j = 0; j < 75; j++){
		if(r == 38) continue;
		int a = num[r] / 2;
		int b = num[r] % 2;
		if(a == 1 && bad[2*j]) continue;
		if(b == 1 && bad[2*j+1]) continue;
		message[2*j] = a;
		message[2*j+1] = b;
		r++;
	}

	// ----------------------------------
	done(message, perm);
}

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

using namespace std;

long long Bruno(int N, int A[]){

	// shared initialization
	static mt19937_64 mt1(4848);
	static mt19937_64 mt2(48222);
	static LL B = 60;
	LL Y = mt1() & ((1LL << B) - 1);
	vector<LL> perm(N);
	for(int i = 0; i < N; i++){
		perm[i] = i;
	}
	for(int i = N-1; i >= 0; i--){
		int d = mt2() % (i+1);
		if(d < 0){
			d += (i+1);
		}
		swap(perm[i], perm[d]);
	}
	// shared initialization

	vector<LL> message(N);
	for(int i = 0; i < N; i++){
		message[perm[i]] = A[i];
	}

	// boilerplate
	// ----------------------------------

	LL X = 0;
	for(int i = 0; i * 2 < N; i++){
		if(message[2*i] == 0 && message[2*i+1] == 0) continue;
		LL r = message[2*i] * 2 + message[2*i+1] - 1;
		X = (X * 3 + r);
	}

	// ----------------------------------
	return X ^ Y;
}

Compilation message

Anna.cpp: In function 'void done(std::vector<long long int>, std::vector<long long int>)':
Anna.cpp:7:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < message.size(); i++){
                 ~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3056 KB Output is correct - L* = 40
2 Correct 54 ms 3368 KB Output is correct - L* = 40
3 Correct 63 ms 3472 KB Output is correct - L* = 40
4 Correct 65 ms 3616 KB Output is correct - L* = 40
5 Correct 50 ms 3808 KB Output is correct - L* = 40
6 Correct 56 ms 3808 KB Output is correct - L* = 40
7 Correct 57 ms 3808 KB Output is correct - L* = 40
8 Correct 59 ms 3840 KB Output is correct - L* = 40
9 Correct 79 ms 3840 KB Output is correct - L* = 40
10 Correct 68 ms 3840 KB Output is correct - L* = 40
11 Correct 57 ms 3840 KB Output is correct - L* = 40
12 Correct 54 ms 3840 KB Output is correct - L* = 40
13 Correct 55 ms 3840 KB Output is correct - L* = 40
14 Correct 51 ms 3840 KB Output is correct - L* = 40
15 Correct 59 ms 3840 KB Output is correct - L* = 40
16 Correct 57 ms 3840 KB Output is correct - L* = 40
17 Correct 71 ms 3840 KB Output is correct - L* = 40
18 Correct 60 ms 3840 KB Output is correct - L* = 40
19 Correct 69 ms 3840 KB Output is correct - L* = 40
20 Correct 61 ms 3840 KB Output is correct - L* = 40
21 Correct 59 ms 3840 KB Output is correct - L* = 40
22 Correct 54 ms 3840 KB Output is correct - L* = 40
23 Correct 63 ms 3840 KB Output is correct - L* = 40
24 Correct 102 ms 3840 KB Output is correct - L* = 40
25 Correct 107 ms 3840 KB Output is correct - L* = 40
26 Correct 60 ms 3840 KB Output is correct - L* = 40
27 Correct 71 ms 3848 KB Output is correct - L* = 40
28 Correct 51 ms 3848 KB Output is correct - L* = 40
29 Correct 52 ms 3848 KB Output is correct - L* = 40
30 Correct 50 ms 3848 KB Output is correct - L* = 40
31 Correct 49 ms 3848 KB Output is correct - L* = 40
32 Correct 52 ms 3848 KB Output is correct - L* = 40
33 Correct 59 ms 3848 KB Output is correct - L* = 40
34 Correct 76 ms 3848 KB Output is correct - L* = 40
35 Correct 78 ms 3848 KB Output is correct - L* = 40
36 Correct 49 ms 3848 KB Output is correct - L* = 40
37 Correct 58 ms 3848 KB Output is correct - L* = 40
38 Correct 59 ms 3848 KB Output is correct - L* = 40
39 Correct 69 ms 3848 KB Output is correct - L* = 40
40 Correct 70 ms 3848 KB Output is correct - L* = 40