제출 #1312614

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1312614		settop	Unscrambling a Messy Bug (IOI16_messy)	C++20	38 / 100	2 ms	356 KiB

messy

#include "messy.h"
#include<bits/stdc++.h>

using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ll long long
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define sz(x) (int)x.size()
typedef pair<ll,ll> pii;

std::vector<int> restore_permutation(int n, int w, int r) {
    string s="";

    fall(i,0,n-1) s+="0";
    
    fall(i,0,n-1){
        s[i]='1';
        add_element(s);
    }

    compile_set();

    fall(i,0,n-1) s[i]='0';

    vector<int> p(n);

    fall(i,0,n-1){
        fall(j,0,n-1){
            if(s[j]=='1') continue;
            s[j]='1';
            if(check_element(s)){
                p[j]=i;
                break;
            }
            s[j]='0';
        }
    }

    return p;
}

컴파일 시 표준 에러 (stderr) 메시지

messy.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
messy_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30