oj.uz

Submission #554076

# Submission time Handle Problem Language Result Execution time Memory
554076 2022-04-27T15:56:50 Z keta_tsimakuridze Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 468 KB 
#include<bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int> p, P;
int W, R;
/*
map<string,int> c;
void add_element(string s) {
	string sn = s;
	for(int i = 0; i < s.size(); i++) {
		s[i] = sn[P[i]];
	}
	c[s]++;
}
bool check_element(string s) {
	return (c[s] > 0 ? true : false);
}
*/
string get(string s) {
	string sn = "";
	for(int i = 1; i < s.size(); i++) sn += s[i];
	return sn;
}
void add(int l, int r, int n) {
	string s = "";
	if(l == r) return;
	for(int i = 0; i <= n; i++) s += '0';
	for(int i = 1; i < l; i++) s[i] = '1';
	for(int i = r + 1; i <= n; i++) s[i] = '1';
	
	int mid = (l + r) / 2;
	for(int i = l; i <= mid; i++) {
		for(int j = l; j <= mid; j++) {
			s[j] = '0';
		}
		s[i] = '1';
		W--; assert(W >= 0);
		add_element(get(s));
	}
	
	add(l, mid, n); add(mid + 1, r, n);
}

void solve(int l, int r, vector<int> v, int n) {
	string s = ""; 	
	if(l == r) {
		p[v.back()] = r - 1;
		return;
	}
	for(int i = 0; i <= n; i++) s += '1';
	vector<int> vl, vr;
	for(int j = 0; j < v.size(); j++) {
		for(int i = 0; i < v.size(); i++) 
		s[v[i] + 1] = '0';
		
		s[v[j] + 1] = '1';
		R--; assert(R >= 0);
		if(check_element(get(s))) vl.push_back(v[j]);
		else vr.push_back(v[j]);
	}
	int mid = (l + r) / 2;

	solve(l, mid, vl, n); solve(mid + 1, r, vr, n);
	
}
std::vector<int> restore_permutation(int n, int w, int r) {
    W = w; R = r;
    add(1, n, n);
    vector<int> v; p.resize(n);
    compile_set();
    for(int i = 0; i < n; i++) v.push_back(i);
    solve(1, n, v, n);
    return p;
}
/*
int main() {
	int n, w, r;
	cin >> n >> w >> r;
	P.resize(n);
	for(int i = 0; i < n; i++) {
		cin >> P[i];
	}
	vector<int> v = restore_permutation(n, w, r);
	for(int i = 0; i < v.size(); i++) cout << v[i] << " ";
	assert(v == P);
} */

Compilation message

messy.cpp: In function 'std::string get(std::string)':
messy.cpp:21:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for(int i = 1; i < s.size(); i++) sn += s[i];
      |                 ~~^~~~~~~~~~
messy.cpp: In function 'void solve(int, int, std::vector<int>, int)':
messy.cpp:52:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for(int j = 0; j < v.size(); j++) {
      |                 ~~^~~~~~~~~~
messy.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int i = 0; i < v.size(); i++)
      |                  ~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 304 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 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 212 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 296 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 296 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 212 KB n = 32
3 Correct 1 ms 300 KB n = 32
4 Correct 1 ms 296 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 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 468 KB n = 128
2 Correct 3 ms 468 KB n = 128
3 Correct 3 ms 468 KB n = 128
4 Correct 3 ms 428 KB n = 128
5 Correct 3 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 3 ms 428 KB n = 128
8 Correct 3 ms 468 KB n = 128
9 Correct 3 ms 468 KB n = 128
10 Correct 3 ms 428 KB n = 128
11 Correct 3 ms 432 KB n = 128
12 Correct 3 ms 468 KB n = 128
13 Correct 3 ms 428 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 468 KB n = 128
2 Correct 3 ms 432 KB n = 128
3 Correct 3 ms 468 KB n = 128
4 Correct 3 ms 428 KB n = 128
5 Correct 3 ms 424 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 3 ms 436 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 468 KB n = 128
15 Correct 3 ms 468 KB n = 128