oj.uz

Submission #948800

# Submission time Handle Problem Language Result Execution time Memory
948800 2024-03-18T14:34:36 Z dnass Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 628 KB 
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<cmath>
#include<random>
#include<bitset>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<deque>
#include<chrono>
#include "messy.h"
using namespace std;
typedef long long int lld;
typedef long double lf;
#define INF 1000000000000000000LL
#define MOD 998244353
#define ff first
#define ss second

int n;
vector<int> perm;

void add_elems(int l, int r){
	if(r<=l) return;
	int mid = (l+r)/2;
	string s(n, '1');
	for(int i=l;i<=r;i++) s[i] = '0';
	for(int i=l;i<=mid;i++){
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	add_elems(l, mid);
	add_elems(mid+1, r);
	return;
}

void compute_perm(int l, int r){
	if(r<=l) return;
	string s(n, '1');
	for(int i=l;i<=r;i++) s[perm[i]] = '0';
	vector<int> new_perm;
	set<int> old_perm;
	for(int i=l;i<=r;i++){
		old_perm.insert(perm[i]);
		s[perm[i]] = '1';
		if(check_element(s)) new_perm.push_back(perm[i]);
		s[perm[i]] = '0';
	}
	int mid = (l+r)/2;
	for(int i=l;i<=mid;i++){
		perm[i] = new_perm[i-l];
		old_perm.erase(new_perm[i-l]);
	}
	auto it = old_perm.begin();
	for(int i=mid+1;i<=r;i++){
		perm[i] = *it;
		it++;
	}
	compute_perm(l, mid);
	compute_perm(mid+1, r);
	return;
}

vector<int> restore_permutation(int N, int W, int R){
	n = N;
	add_elems(0, n-1);
	compile_set();
	for(int i=0;i<n;i++) perm.push_back(i);
	compute_perm(0, n-1);
	vector<int> inv_perm(n);
	for(int i=0;i<n;i++) inv_perm[perm[i]] = i;
	return inv_perm;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 8
2 Correct 0 ms 348 KB n = 8
3 Correct 0 ms 348 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 0 ms 348 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 0 ms 348 KB n = 8
8 Correct 0 ms 348 KB n = 8
9 Correct 0 ms 348 KB n = 8
10 Correct 0 ms 348 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 0 ms 348 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 1 ms 344 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 1 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 344 KB n = 32
9 Correct 1 ms 344 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 0 ms 344 KB n = 32
13 Correct 1 ms 604 KB n = 32
14 Correct 1 ms 348 KB n = 32
15 Correct 1 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 1 ms 600 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 1 ms 348 KB n = 32
8 Correct 1 ms 348 KB n = 32
9 Correct 1 ms 344 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 360 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 392 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 432 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 600 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 604 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 2 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 600 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 2 ms 604 KB n = 128
12 Correct 1 ms 628 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 604 KB n = 128