# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1265269 | silentloop | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define pb push_back
#define se second
#define fr first
#define mp make_pair
#define all(x) x.begin(), x.end()
using namespace std;
void add_element(string x);
void compile_set();
bool check_element(string x);
ll N;
std::vector<int> restore_permutation(int n, int w, int r)
{
ll i, j;
vector<int>p(n,-1);
N=n;
string num="";
num.resize(n,'1');
for(i=0; i<n-1; i++)
{
num[i]='0';
add_element(num);
}
compile_set();
ll cant=0;
num="";
num.resize(n,'1');
for(j=1; j<n; j++)
{
for(i=0; i<n; i++)
{
if(num[i]=='0')
continue;
num[i]='0';
if(check_element(num))
{
p[i]=j-1;
break;
}
num[i]='1';
}
}
for(i=0; i<n; i++)
if(p[i]==-1)
{
p[i]=n-1;
break;
}
return p;
}
컴파일 시 표준 에러 (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... |