oj.uz

Submission #784670

# Submission time Handle Problem Language Result Execution time Memory
784670 2023-07-16T12:01:01 Z vjudge1 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 496 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n;
string create1(int l, int r, int x){
	string ret;
	for(int i = 0; i < n; i++){
		if(i != x && l <= i && i <= r)	ret+="0";
		else ret+="1";
	}
	return ret;
}
string create2(vi cand, int x){
	string ret;
	for(int i = 0; i < n; i++){
		if(i != x && find(cand.begin(), cand.end(), i) != cand.end())	ret += "0";
		else ret += "1";
	}
	return ret;
}
void solve1(int l, int r){
	if(l == r)	return;
	int mid = (l + r) / 2;
	for(int i = l; i <= mid; i++){
		add_element(create1(l, r, i));
	}
	solve1(l, mid);
	solve1(mid+1, r);
}
vi res;
void solve2(int l, int r, vi cand){
	if(l == r){
		res[cand[0]] = l;
		return;
	}
	int mid = (l + r) / 2;
	vi left, right;
	for(auto x : cand){
		if(check_element(create2(cand, x)))	left.pb(x);
		else right.pb(x);
	}
	solve2(l, mid, left);
	solve2(mid+1, r, right);
}
vi restore_permutation(int _n, int w, int r){
	n = _n;
	solve1(0, n-1);
	compile_set();
	vi cand(n);
	for(int i = 0; i < n; i++)
		cand[i] = i;
	
	res.resize(n);
	solve2(0, n-1, cand);
	return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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