# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1244996 | matisito | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 1 ms | 328 KiB |
#include "messy.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
using namespace std;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";
/*
I love VN uwu
*/
vector<int> restore_permutation(int n, int w, int r) {
string s;
for(int i=0 ; i<n ; i++) s+='0';
for(int i=0 ; i<n ; i++){
s[i]='1';
// dbg(s)
add_element(s);
}
compile_set();
string curr;
for(int i=0 ; i<n ; i++) curr+='0';
vector<int>ans(n);
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<n ; j++){
if(curr[j]=='1') continue;
curr[j]='1';
if(check_element(curr)){
// dbg(curr)
ans[j]=i;
break;
}
curr[j]='0';
}
}
return ans;
}
컴파일 시 표준 에러 (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... |