# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1211662 | cpdreamer | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 328 KiB |
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e12;
typedef long long ll;
const ll MOD=(ll) 998244353;
#define P pair
#define S second
#define F first
#define pb push_back
#define V vector
#define all(v) v.begin(),v.end()
std::vector<int> restore_permutation(int n, int w, int r) {
string s;
V<int>perm(n);
for(int i=0;i<n;i++){
perm[i]=i;
}
for(int i=0;i<n;i++){
s+='0';
}
for(int i=0;i<n;i++){
s[i]='1';
add_element(s);
}
for(int i=0;i<n;i++){
s[i]='0';
}
compile_set();
int id=0;
V<int>vp;
for(int i=0;i<n;i++){
id++;
s[i]='1';
if(!check_element(s)){
vp.pb(i);
break;
}
}
for(int i=id;i<n;i++){
s[i]='1';
if(check_element(s)){
vp.pb(i);
}
}
if(!vp.empty()){
swap(perm[vp[0]],perm[vp[1]]);
}
return perm;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |