oj.uz

Submission #958053

# Submission time Handle Problem Language Result Execution time Memory
958053 2024-04-04T18:44:43 Z Lalic Unscrambling a Messy Bug (IOI16_messy) C++17
20 / 100
 1 ms 436 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5+10;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

vector<int> restore_permutation(int n, int w, int r) {
    //add_element("0");
    //compile_set();
    //check_element("0");
    
    string s="";
    for(int i=0;i<n;i++) s+='0';
	for(int i=0;i<n;i++){
		s[i]='1';
		add_element(s);
		//cout << "added: " << s << "\n";
	}
	
	compile_set();
	
	s="";
	for(int i=0;i<n;i++) s+='0';
	
	srand(time(0));
	
	vector<int> ans(n);
	for(int i=0;i<n;i++){
		vector<int> ord;
		for(int j=0;j<n;j++){
			if(s[j]=='1') continue;
			ord.pb(j);
		}
		
		//random_shuffle(all(ord));
		
		//cout << s << "\n";
		
		for(auto u : ord){
			s[u]='1';
			if(check_element(s)){
				//cout << s << "\n";
				ans[i]=u;
				break;
			}
			s[u]='0';
		}
	}
	
	//cout << (int)ans.size() << "\n";
	
	return ans;	
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Incorrect 1 ms 348 KB grader returned WA
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 436 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB grader returned WA
2 Halted 0 ms 0 KB -