oj.uz

Submission #528351

# Submission time Handle Problem Language Result Execution time Memory
528351 2022-02-20T06:53:06 Z CSQ31 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 496 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define pb push_back
vector<int>ans;
int N;
void add(int l,int r,string s){
	if(l == r)return;
	int mid = (l+r)/2;
	for(int i=l;i<=mid;i++){
		s[i] = '1';
		//cout<<s<<'\n';
		add_element(s);
		s[i] = '0';
	}
	s = string(N,'0');
	for(int i=mid+1;i<=r;i++)s[i] = '1';
	add(l,mid,s);
	s = string(N,'0');
	for(int i=l;i<=mid;i++)s[i] = '1';
	add(mid+1,r,s);
}
void solve(int l,int r,vector<int>v,string s){
	if(l==r){
		ans[l] = v[0];
		return;
	}
	/*
	cout<<l<<" "<<r<<'\n';
	for(int x:v)cout<<x<<" ";
	cout<<'\n';
	cout<<s<<'\n';
	*/
	vector<int>a,b;
	int mid = (l+r)/2;
	for(int x:v){
		s[x] = '1';
		//cout<<s<<" "<<check_element(s)<<'\n';
		if(check_element(s))a.push_back(x);
		else b.push_back(x);
		s[x] = '0';
	}
	s = string(N,'0');
	for(int x:b)s[x] = '1';
	solve(l,mid,a,s);
	s = string(N,'0');
	for(int x:a)s[x] = '1';
	solve(mid+1,r,b,s);
	//a contains what [l,mid] bijects to in p[l,mid]
	//b the inverse
}
vector<int> restore_permutation(int _n, int w, int r) {
	int n = _n;
	N = _n;
    ans.resize(n);
    string s(N,'0');
    add(0,n-1,s);
    compile_set();
    vector<int>v(n);
    for(int i=0;i<n;i++)v[i] = i;
    solve(0,n-1,v,s);
    vector<int>p(n);
    for(int i=0;i<n;i++)p[ans[i]] = i;
    return p;
    
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB n = 128
2 Correct 1 ms 464 KB n = 128
3 Correct 2 ms 464 KB n = 128
4 Correct 2 ms 428 KB n = 128
5 Correct 1 ms 464 KB n = 128
6 Correct 3 ms 464 KB n = 128
7 Correct 2 ms 464 KB n = 128
8 Correct 1 ms 420 KB n = 128
9 Correct 1 ms 464 KB n = 128
10 Correct 1 ms 464 KB n = 128
11 Correct 1 ms 464 KB n = 128
12 Correct 1 ms 476 KB n = 128
13 Correct 2 ms 416 KB n = 128
14 Correct 1 ms 464 KB n = 128
15 Correct 1 ms 464 KB n = 128