oj.uz

Submission #24600

# Submission time Handle Problem Language Result Execution time Memory
24600 2017-06-10T15:14:18 Z kdh9949 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 4 ms 512 KB 
#include <vector>
#include <cstdio>
#include "messy.h"
using namespace std;

int n;
char Q[129];

void f(vector<int> x){
	string q = Q;
    for(auto &i : x) q[i] = '0';
    vector<int> nl, nr;
    for(int i = 0; i < x.size() / 2; i++){
		nl.push_back(x[i]);
        q[x[i]] = '1';
        add_element(q);
        q[x[i]] = '0';
    }
    for(int i = x.size() / 2; i < x.size(); i++) nr.push_back(x[i]);
    if(!nl.empty()){
		f(nl);
		f(nr);
    }
}

void g(vector<int> &ans, vector<int> x, vector<int> y){
	if(x.size() == 1){
		ans[y[0]] = x[0];
		return;
	}
    string q = Q;
	for(auto &i : y) q[i] = '0';
	vector<int> nlx, nly, nrx, nry;
	for(int i = 0; i < x.size() / 2; i++) nlx.push_back(x[i]);
	for(int i = x.size() / 2; i < x.size(); i++) nrx.push_back(x[i]);
	for(int i = 0; i < x.size(); i++){
		q[y[i]] = '1';
		if(check_element(q)) nly.push_back(y[i]);
		else nry.push_back(y[i]);
		q[y[i]] = '0';
	}
	g(ans, nlx, nly);
	g(ans, nrx, nry);
}

vector<int> restore_permutation(int n, int w, int r) {
	vector<int> x;
	for(int i = 0; i < n; i++) x.push_back(i);
	for(int i = 0; i < n; i++) Q[i] = '1';
	f(x);
    compile_set();
	vector<int> ans(n, 0);
	g(ans, x, x);
    return ans;
}

Compilation message

messy.cpp: In function 'void f(std::vector<int>)':
messy.cpp:13:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < x.size() / 2; i++){
                    ~~^~~~~~~~~~~~~~
messy.cpp:19:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = x.size() / 2; i < x.size(); i++) nr.push_back(x[i]);
                               ~~^~~~~~~~~~
messy.cpp: In function 'void g(std::vector<int>&, std::vector<int>, std::vector<int>)':
messy.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < x.size() / 2; i++) nlx.push_back(x[i]);
                 ~~^~~~~~~~~~~~~~
messy.cpp:35:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = x.size() / 2; i < x.size(); i++) nrx.push_back(x[i]);
                            ~~^~~~~~~~~~
messy.cpp:36:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < x.size(); i++){
                 ~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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