oj.uz

Submission #49657

# Submission time Handle Problem Language Result Execution time Memory
49657 2018-06-01T17:20:50 Z khsoo01 Unscrambling a Messy Bug (IOI16_messy) C++11
100 / 100
 4 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int n;

void Add (int S, int E) {
	if(S >= E) return;
	int M = (S+E)/2;
	for(int k=S;k<=M;k++) {
		string R = "";
		for(int i=0;i<n;i++) {
			if(i < S || i > E || i == k) R += '1';
			else R += '0';
		}
		add_element(R);
	}
	Add(S, M);
	Add(M+1, E);
}

vector<int> Solve (vector<int> C) {
	vector<int> va, vb, a, b;
	if(C.size() == 1) {
		a.push_back(C[0]);
		return a;
	}
	string tmp = "";
	for(int i=0;i<n;i++) {
		tmp += '1';
	}
	for(int i=0;i<C.size();i++) {
		tmp[C[i]] = '0';
	}
	for(int i=0;i<C.size();i++) {
		tmp[C[i]] = '1';
		if(check_element(tmp)) va.push_back(C[i]);
		else vb.push_back(C[i]);
		tmp[C[i]] = '0';
	}
	a = Solve(va);
	b = Solve(vb);
	for(int i=0;i<b.size();i++) {
		a.push_back(b[i]);
	}
	return a;
}


std::vector<int> restore_permutation(int N, int W, int R) {
	n = N;
	Add(0, n-1);
	compile_set();
	vector<int> C, A;
	for(int i=0;i<n;i++) {
		C.push_back(i);
	}
	vector<int> T = Solve(C);
	for(int i=0;i<n;i++) {
		for(int j=0;j<n;j++) {
			if(T[j] == i) {
				A.push_back(j);
				break;
			}
		}
	}
	return A;
}

Compilation message

messy.cpp: In function 'std::vector<int> Solve(std::vector<int>)':
messy.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<C.size();i++) {
              ~^~~~~~~~~
messy.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<C.size();i++) {
              ~^~~~~~~~~
messy.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<b.size();i++) {
              ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 384 KB n = 8
4 Correct 3 ms 384 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 256 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 384 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 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 384 KB n = 32
2 Correct 2 ms 256 KB n = 32
3 Correct 2 ms 384 KB n = 32
4 Correct 2 ms 384 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 256 KB n = 32
13 Correct 2 ms 384 KB n = 32
14 Correct 2 ms 384 KB n = 32
15 Correct 2 ms 256 KB n = 32

Subtask #3
11.0 / 11.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 384 KB n = 32
6 Correct 2 ms 384 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 256 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 #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB n = 128
2 Correct 3 ms 512 KB n = 128
3 Correct 4 ms 512 KB n = 128
4 Correct 4 ms 512 KB n = 128
5 Correct 4 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 4 ms 512 KB n = 128
11 Correct 4 ms 512 KB n = 128
12 Correct 3 ms 640 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 4 ms 512 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 4 ms 512 KB n = 128
5 Correct 3 ms 512 KB n = 128
6 Correct 3 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