제출 #313104

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

messy

    //나는 가상 소녀들에게 큰 호감이 있습니다.
     
    #include <iostream>
    #include <cmath>
    #include <algorithm>
    #include <stdio.h>
    #include <cstring>
    #include <string>
    #include <cstdlib>
    #include <vector>
    #include <bitset>
    #include <map>
    #include <chrono>
    #include <functional>
    #include <unordered_set>
    #include <unordered_map>
    #include <numeric>
    #include <queue>
    #include <ctime>
    #include <stack>
    #include <set>
    #include <list>
    #include <deque>
    #include <iomanip>
    #include <sstream>
    #include <fstream>
    #include <stdarg.h>
    #include <utility>
     
    using namespace std;
     
    #define pb push_back
    #define mp make_pair
    #define ll long long
    #define ull unisgned long long
    #define ld long double
    #define all(a) a.begin(), a.end()
    #define SORT(a) sort(all(a))
    #define pii pair<int, int>
    #define tii triple<int, int, int>
    #define e 1e-7
    #define PI acos(-1)
    #define sz(a) (int)(a.size())
    #define inf 1e17
    #define vi vector<int>
    #define F first
    #define S second
    #define rng(x) for(int _ = 0; _ < (x); _++)
    #define rngi(i, x) for(int i = 0; i < (x); i++)
    #define rngsi(s, i, x) for(int i = (s); i <(x); i++)
    #define problem "a"
     
    template<typename A, typename B, typename C>
    struct triple {
        A X;
        B Y;
        C Z;
        triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
    };
    template<typename A, typename B, typename C>
    triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
        return triple<A, B, C>(a, b, c);
    }
    template<typename A, typename B, typename C>
    bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
        if (a.X != b.X)
            return a.X < b.X;
        if (a.Y != b.Y)
            return a.Y < b.Y;
        return a.Z < b.Z;
    }
    template<typename T, typename SS>
    ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
        ofs << "( " << p.F << " , " << p.S << " )";
        return ofs;
    }
    template<typename T>
    void print(T a) {
        for (auto i : a)
            cout << i << ' ';
        cout << '\n';
    }
    template<typename T>
    T max(T a, T b, T c) {
        return max(a, max(b, c));
    }
    template<typename T>
    T min(T a, T b, T c) {
        return min(a, min(b, c));
    }
    template<typename T, typename D>
    D min(T a) {
        return *min_element(all(a));
    }
    template<typename T, typename D>
    D max(T a) {
        return *max_element(all(a));
    }
    struct custom_hash {
        static uint64_t splitmix64(uint64_t x) {
            x += 0x9e3779b97f4a7c15;
            x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
            x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
            return x ^ (x >> 31);
        }
     
        size_t operator()(uint64_t x) const {
            static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
            return splitmix64(x + FIXED_RANDOM);
        }
    };
     
     #include "messy.h"
    std::vector<int> restore_permutation(int n, int w, int r) {
        vector<string> ad;
        for (int i = 1; i <= n; i++) {
            string s = string(i, '1');
            if (n - i) s += string(n - i, '0');
            add_element(s); ad.push_back(s);
        }
        compile_set();
        vi p(n);
        vi usd(n);
        rngi(i, n) {
            string now = string(n, '0');
            rngi(j, n) if (usd[j]) now[j] = '1';
            rngi(j, n) if(!usd[j]){
                now[j] = '1';
                if (check_element(now)) {
                    p[j] = i;
                    usd[j] = 1;
                    break;
                }
                now[j] = '0';
            }
        }
        return p;
    }

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