oj.uz

Submission #808499

# Submission time Handle Problem Language Result Execution time Memory
808499 2023-08-05T07:19:22 Z LIF Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <vector>
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;
bool confirm[300005];
int pp[300005];
void add(int a, int b,int n) {    // [a, b)
	if(a >= b)return;
    int mid = (a + b) / 2;
	string temp;
	for(int i=0;i<n;i++)temp += '1';
	for(int i=a;i<=b;i++)temp[i] = '0';
	for(int i=a;i<=mid;i++)
	{
		temp[i] = '1';
		add_element(temp);
	//	cout<<a<<" "<<b<<" "<<temp<<endl;
		temp[i] = '0';
	}	
   add(a,mid,n);
   add(mid+1,b,n);
}
bool used[300005];
int go[300005];
void find(int l,int r,int n,vector<int> v)
{	
	//cout<<"l : "<<l<<" r : "<<r<<endl;
	if(l > r)return;
	if(l == r)
	{
		for(int i=0;i<n;i++)used[i] = false;
		for(int i=0;i<v.size();i++)used[v[i]] = true;
		for(int i=0;i<n;i++)if(used[i] == false)go[l] = i;
		return;
	}
	string temp;
	for(int i=0;i<n;i++)temp += '0';
	for(int i=0;i<v.size();i++)temp[v[i]] = '1';
	vector<int> x; // that means the [l,mid];
	vector<int> y; // that means the [mid+1,r]
	for(int i=0;i<n;i++)
	{
		if(temp[i] == '1')continue;
		temp[i] = '1';
		if(check_element(temp) == true)
		{
		//	cout<<"true"<<endl;
			x.push_back(i);
		}
		else
		{
		//	cout<<"false"<<endl;
			y.push_back(i);
		}
		temp[i] = '0';
	}
	/*cout<<"l : "<<l<<" r : "<<r<<endl;
	for(int i=0;i<v.size();i++)cout<<v[i]<<" ";
	cout<<endl;
	for(int i=0;i<x.size();i++)cout<<x[i]<<" ";
	cout<<endl;
	for(int i=0;i<y.size();i++)cout<<y[i]<<" ";
	cout<<endl;*/
	int mid = (l+r) / 2;
	for(int i=0;i<y.size();i++)v.push_back(y[i]);
	find(l,mid,n,v);
	for(int i=0;i<y.size();i++)v.pop_back();
	for(int i=0;i<x.size();i++)v.push_back(x[i]);
	find(mid+1,r,n,v);
	
}
std::vector<int> restore_permutation(int n, int w, int r) {
	add(0,n-1,n);
	compile_set();
	vector<int> vv;
	find(0,n-1,n,vv);
	/*for(int i=0;i<n;i++)cout<<go[i]<<" ";
	cout<<endl;*/
	vector<int> ans;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)if(go[j] == i)ans.push_back(j);
	}
	return ans;
}

Compilation message

messy.cpp: In function 'void find(int, int, int, std::vector<int>)':
messy.cpp:32:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for(int i=0;i<v.size();i++)used[v[i]] = true;
      |               ~^~~~~~~~~
messy.cpp:38:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for(int i=0;i<v.size();i++)temp[v[i]] = '1';
      |              ~^~~~~~~~~
messy.cpp:65:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for(int i=0;i<y.size();i++)v.push_back(y[i]);
      |              ~^~~~~~~~~
messy.cpp:67:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for(int i=0;i<y.size();i++)v.pop_back();
      |              ~^~~~~~~~~
messy.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  for(int i=0;i<x.size();i++)v.push_back(x[i]);
      |              ~^~~~~~~~~

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 0 ms 312 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 ms 312 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 212 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 1 ms 212 KB n = 8
14 Correct 0 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 308 KB n = 32
2 Correct 1 ms 340 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 1 ms 340 KB n = 32
5 Correct 1 ms 340 KB n = 32
6 Correct 1 ms 340 KB n = 32
7 Correct 1 ms 340 KB n = 32
8 Correct 1 ms 316 KB n = 32
9 Correct 1 ms 340 KB n = 32
10 Correct 1 ms 308 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 320 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 340 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 444 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 436 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 440 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 444 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 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 436 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 436 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128