oj.uz

Submission #705281

# Submission time Handle Problem Language Result Execution time Memory
705281 2023-03-03T18:32:59 Z lukameladze Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair <int, int> 
#define pb push_back
vector <int> pp;
int nn,rr,ww;
void solve(int le, int ri) {
	if (le == ri) return ;
	string s = "";
	for (int i = 0; i < nn; i++) {
		s += "0";
	}
	for (int i = 0; i < le; i++) {
		s[i] = '1';
	}
	for (int i = ri + 1; i < nn; i++) {
		s[i] = '1';
	}
	int mid = (le + ri) / 2;
	for (int i = le; i <= mid; i++) {
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	solve(le,mid);
	solve(mid + 1, ri);
}
void solve1(int le, int ri, vector <int> v) {
	if (le == ri) {
		pp[v[0]] = le;
		return ;
	}
	int mid = (le + ri) / 2;
	string s;
	for (int i = 0; i < nn; i++) {
		s += "1";
	}
	for (int i = 0; i < (int)v.size(); i++) {
		s[v[i]] = '0';
	}
	vector <int> lef,rig;
	for (int i = 0; i < (int)v.size(); i++) {
		s[v[i]] = '1';
		if (check_element(s)) lef.pb(v[i]);
		else rig.pb(v[i]);
		s[v[i]] = '0';
	}
	solve1(le,mid,lef);
	solve1(mid + 1, ri, rig);
}
std::vector<int> restore_permutation(int n, int w, int r) {
	nn = n;
	ww = w;
	rr = r;
	pp = vector <int>(nn, 0);
    solve(0,nn - 1);
    compile_set();
    vector <int> v;
    for (int i = 0; i < nn; i++) {
    	v.pb(i);
	}
	solve1(0, nn - 1,v);
    return pp;
}

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 212 KB n = 8
4 Correct 1 ms 300 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 0 ms 300 KB n = 8
8 Correct 1 ms 300 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 300 KB n = 8
14 Correct 1 ms 304 KB n = 8
15 Correct 0 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 212 KB n = 32
3 Correct 1 ms 300 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 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 300 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 300 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 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 312 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 296 KB n = 32
9 Correct 1 ms 300 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 300 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 300 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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