제출 #1245085

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

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 1e9+7;

/*
using namespace std;

namespace helper {

    set<string> set_;
    bool compiled = false;
    int n;
    vector<int> p;
    int w;
    int r;

    int read_int() {
        int x;
        cin >> x;
        return x;
    }

}

using namespace helper;

// A convenience function.
int get_p(int i) {
    int ret = p[i];
    return ret;
}

void wa() {
    printf("WA\n");
    exit(0);
}

bool check(const string& x) {
    if ((int)x.length() != n) {
        return false;
    }
    for (int i = 0; i < n; i++) {
        if (x[i] != '0' && x[i] != '1') {
            return false;
        }
    }
    return true;
}

void add_element(string x) {
    if (--w < 0 || compiled || !check(x)) {
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    return set_.count(x);
}

void compile_set() {
    if (compiled) {
        wa();
    }
    compiled = true;
    set<string> compiledSet;
    string compiledElement = string(n, ' ');
    for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
        string s = *it;
        for (int i = 0; i < n; i++) {
            compiledElement[i] = s[get_p(i)];
        }
        compiledSet.insert(compiledElement);
    }
    set_ = compiledSet;
}


*/


std::vector<int> restore_permutation(int n, int w, int r) {
    ff(i, 0, n){
		string str(n, '0');
		ff(j, 0, i+1){
			str[j] = '1';
		}
		//cout << str << ed;
		add_element(str);
	}
	compile_set();
	vector<int> ans(n, -1);
	vb marked(n, false);
	string query(n, '0');
	ff(q, 1, n+1){
		//cout << "Q " << q << " ";
		ff(i, 0, n){
			if(!marked[i]){
				query[i] = '1';
				if(check_element(query)){
					//cout << query << ed;
					ans[i] = q-1;
					marked[i] = true;
					break;
				}
				else{
					query[i] = '0';
				}
			}
		}
	}
	//cout << ed;
	return ans;
}
/*
int main() {
    n = read_int();
    w = read_int();
    r = read_int();
    p = vector<int>(n);
    for (int i = 0; i < n; i++) {
        p[i] = read_int();
    }
    vector<int> answer = restore_permutation(n, w, r);
    
    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[i]);
    }
    printf("\n");
    return 0;
}
*/

컴파일 시 표준 에러 (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