제출 #144995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144995		osaaateiasavtnl	도서관 (JOI18_library)	C++14	0 / 100	762 ms	664 KiB

library

#include <bits/stdc++.h>
using namespace std; 
mt19937 rnd(228);
vector <int> ans;
#ifdef HOME
int Q = 0;
vector <int> pos;
int Query(vector <int> m) { 
    ++Q;
    vector <bool> used(m.size());
    for (int i = 0; i < m.size(); ++i) {
        if (m[i]) used[pos[i]] = 1;
    }   
    int ans = 0;
    for (int i = 0; i < used.size(); ++i) {
        ans += used[i] && (!i || !used[i - 1]);
    }   
    return ans;
}
void Answer(vector <int> a) { 
    cout << "Q = " << Q << '\n';
    auto b = a; reverse(b.begin(), b.end());
    if (a == ans || b == ans) cout << "correct\n";
    else cout << "WA\n";
}
#else
#include "library.h"
#endif

#define ii pair <int, int>
#define app push_back
// Query()
// Answer()
int n_glob;
vector <ii> ed;
int query(vector<int> v) {
    vector<int> m(n_glob,0);
    for(int i:v) m[i]=1;
    return Query(m);
}
int new_edge(vector <int> v) {
    int ans = v.size() - query(v);
    vector<int> m(n_glob,0);
    for(int i:v) m[i]=1;    
    for (auto e : ed) ans -= m[e.first] && m[e.second];
    return ans; 
}
const int N = 2007;
vector <int> g[N];
void Solve(int n) {
    n_glob = n;
    for (int t = 0; t < n - 1; ++t) {
        vector <int> cur;
        for (int i = 0; i < n; ++i) cur.app(i);
        while (cur.size() > 2) {
            int m = (cur.size() + 1) >> 1;
            while (1) {
                shuffle(cur.begin(), cur.end(), rnd);
                vector <int> tmp;
                for (int i = 0; i < m; ++i) tmp.app(cur[i]);
                if (new_edge(tmp)) {
                    cur = tmp;
                    break;
                }
            }   
        }
        ed.app({cur[0], cur[1]});
        g[cur[0]].app(cur[1]); g[cur[1]].app(cur[0]);
    }    
    vector <int> ans;
    for (int i = 0; i < n; ++i) {
        if (g[i].size() == 1) {
            ans.app(i); break;
        }
    }       
    int p = -1;
    for (int i = 0; i < n - 1; ++i) {
        for (int v : g[ans.back()]) {
            if (v != p) {
                p = ans.back();
                ans.app(v);
                break;
            }
        }
    }
    for (auto &e : ans) ++e;
    Answer(ans);
}
#ifdef HOME 
int main() {
    for (int i = 1; i <= 800; ++i) ans.app(i);
    shuffle(ans.begin(), ans.end(), rnd);
    pos.resize(ans.size());
    for (int i = 0; i < ans.size(); ++i) pos[ans[i] - 1] = i;
    Solve(ans.size());
}
#endif

• Subtask 1: 0 / 19
• Subtask 2: 0 / 81