| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325650 | eri16 | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 2 ms | 332 KiB |
#include<bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int> restore_permutation(int n, int w, int r){
string s;
bool mull;
for (int i=0; i<n; i++){s.push_back('0');}
for(int i=0; i<n; i++){
s[i]='1';
add_element(s);
}
compile_set();
vector <int> ungepruft(n,1);
vector <int> ans(n);
for(int i=0; i<n; i++){
s[i]='0';
}
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
if (ungepruft[j]){
s[j]='1';
mull=check_element(s);
if (mull){
ungepruft[j]=0;
ans[j]=i;
continue;
}
else{
s[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... | ||||
