oj.uz

Submission #129508

# Submission time Handle Problem Language Result Execution time Memory
129508 2019-07-12T11:33:37 Z ekrem Unscrambling a Messy Bug (IOI16_messy) C++
100 / 100
 5 ms 632 KB 
#include "messy.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define inf 1000000009
#define N 1000005
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef vector < int > vi;

int m, bs[N], sn[N];
string s;

void f(int bas, int son){
	if(bas >= son)
		return;
	for(int i = bas; i <= son; i++)s[i] = '0';
	for(int i = bas; i <= orta; i++){
		s[i] = '1';
		add_element(s);
		// cout << s << endl;
		s[i] = '0';
	}
	for(int i = bas; i <= son; i++)s[i] = '1';
	f(bas, orta);
	f(orta + 1, son);
}

void ff(int bas, int son){
	if(bas >= son)
		return;
	for(int i = 0; i < m; i++){
		if(bs[i] > son or sn[i] < bas)
			s[i] = '1';
		else
			s[i] = '0';
	}
	for(int i = 0; i < m; i++){
		if(s[i] == '1')
			continue;

		s[i] = '1';
		// cout << s << endl;
		if(check_element(s))
			sn[i] = orta;
		else
			bs[i] = orta + 1;
		s[i] = '0';
	}
	ff(bas, orta);
	ff(orta + 1, son);
}

vi restore_permutation(int n, int w, int r) {m = n;
	for(int i = 0; i < n; i++)
		s += '1';
	f(0, n - 1);
	for(int i = 0; i < n; i++){
		bs[i] = 0;
		sn[i] = n - 1;
	}
    compile_set();
    ff(0, n - 1);
    vi ans;
    for(int i = 0; i < n; i++)
    	ans.pb(bs[i]);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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