oj.uz

Submission #1084788

# Submission time Handle Problem Language Result Execution time Memory
1084788 2024-09-07T02:14:46 Z Math4Life2020 Magic Show (APIO24_show) C++17
5 / 100
 3 ms 824 KB 
#include <bits/stdc++.h>
using namespace std;
#include "Alice.h"
using ll = long long; using pii = pair<ll,ll>;
const ll SEED = 82014384209183;
const ll E = 15;
const ll N = 5000;

ll l2(ll x) {
	return (31-__builtin_clz(x));
}

vector<pair<int,int>> Alice() {
	ll X = setN((int)N); //X<=10^18<2^60
	mt19937 gen(SEED);
	vector<pair<int,int>> ans; 
	for (ll x=1;x<N;x++) {
		ll y=0;
		ll lx = l2(x);
		for (ll i=0;i<lx;i++) {
			ll bv = gen()%E;
			y += (1LL<<i)*((X>>bv)&1);
		}
		ans.push_back({y+1,x+1});
	}
	return ans;
}
#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
using ll = long long; using pii = pair<ll,ll>;
const ll SEED = 82014384209183;
const ll E = 15;
const ll N = 5000;

ll l2(ll x) {
	return (31-__builtin_clz(x));
}

ll Bob(vector<pair<int,int>> V) {
	mt19937 gen(SEED);
	ll ans = 0;
	ll read[N];
	for (ll i=0;i<N;i++) {
		read[i]=-1;
	}
	for (pii p0: V) {
		ll y = p0.first; ll x = p0.second;
		x--; y--;
		read[x]=y;
	}
	for (ll x=1;x<N;x++) {
		ll RD=read[x];
		ll lx = l2(x);
		for (ll i=0;i<lx;i++) {
			ll bv = gen()%E;
			if (RD!=-1) {
				ans |= (1LL<<bv)*((RD>>i)&1);
			}
		}
	}
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 2 ms 816 KB Correct.
4 Correct 2 ms 816 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 3 ms 820 KB Correct.
7 Correct 2 ms 820 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 816 KB Correct.
10 Correct 2 ms 816 KB Correct.
11 Correct 2 ms 816 KB Correct.
12 Correct 2 ms 824 KB Correct.

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 2 ms 816 KB Correct.
4 Correct 2 ms 816 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 3 ms 820 KB Correct.
7 Correct 2 ms 820 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 816 KB Correct.
10 Correct 2 ms 816 KB Correct.
11 Correct 2 ms 816 KB Correct.
12 Correct 2 ms 824 KB Correct.
13 Incorrect 2 ms 816 KB Incorrect answer.
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 2 ms 816 KB Correct.
4 Correct 2 ms 816 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 3 ms 820 KB Correct.
7 Correct 2 ms 820 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 816 KB Correct.
10 Correct 2 ms 816 KB Correct.
11 Correct 2 ms 816 KB Correct.
12 Correct 2 ms 824 KB Correct.
13 Incorrect 2 ms 816 KB Incorrect answer.
14 Halted 0 ms 0 KB -