oj.uz

답안 #550026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550026 2022-04-17T05:11:39 Z balbit Park (JOI17_park) C++14
100 / 100
 241 ms 2128 KB 
#ifndef BALBIT
#include "park.h"
#endif
#include <bits/stdc++.h>
//#define int ll
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;



const int maxn = 1500+5;

#ifdef BALBIT

vector<int> gra[maxn];
bool seen[maxn];
bool dfs(int v, int b, int Place[]) {
    if (v == b) return 1;
    seen[v] = 1;
    for (int u : gra[v]) {
        if (!seen[u] && Place[u]) {
            if (dfs(u,b,Place)) return 1;
        }
    }
    return 0;
}

bool Ask(int a, int b, int Place[]) {
    assert(Place[a] && Place[b]);
    memset(seen, 0, sizeof seen);
    return dfs(a,b,Place);
}

void Answer(int a, int b) {
    bug("answering ", a,b);
}

#endif // BALBIT



namespace {
    vector<int> tree[maxn];
    bool intree[maxn];
    int deg[maxn]; // additional degree
    int n;
    int from[maxn];
    set<pii> done;
}
static int Place[1400];

bool ask(int a,int b,vector<int> v) {
    if (a==b) return 1;
    if (a > b) swap(a,b);
    memset(Place, 0, sizeof Place);
    for (int x : v) Place[x] = 1;
    assert(Place[a] && Place[b]);
    return Ask(a,b,Place);
}

void answer(int a, int b) {
    if (a > b) swap(a,b);
    if (done.count({a,b})) return;
    done.insert({a,b});
    Answer(a,b);
    ++deg[a]; ++deg[b];
}

void addtree (int a, int b) {
    bug("edge ", a,b);
    answer(a,b);
    tree[a].pb(b); tree[b].pb(a);
    intree[a] = intree[b] = 1;
}

void build(int a, int b) {
    assert(a!=b);
    if (ask(a,b,{a,b})) {
        addtree(a,b); return;
    }
    vector<int> can; // candidates
    REP(i,n) {
        if (i!=a && i!=b && !intree[i]) {
            can.pb(i);
        }
    }
    int l = 0, r = SZ(can); // the graph should be connected, so it'll find something?????
    while (l!=r) {
        int mid = (l+r)/2;
        vector<int> go(can.begin(), can.begin() + mid);
        go.pb(a); go.pb(b);
        if (ask(a,b,go)) {
            // maybe i can go lower
            r = mid;
        }else{
            l = mid+1;
        }
    }
    assert(l!=0); // otherwise they'd be connected!?
    int ele = can[l-1];
    build(a,ele);
    build(ele,b);
}

void dfs(int v, int p, vector<int> &tnodes) {
    from[v] = p;
    tnodes.pb(v);
    for (int u : tree[v]) {
        if( u != p) {
            dfs(u, v, tnodes);
        }
    }
}

void buildtree(){
    intree[0] = 1;
    for (int i = 1; i<n; ++i) {
        if (!intree[i]) {
            // find a person in the current tree to branch off of
            vector<int> tnodes; // ok tnodes should be sorted by dfs order or depth... sorry
            dfs(0, -1, tnodes);
            vector<int> nottnodes;
            REP(j,n) if (!intree[j]) nottnodes.pb(j);
            int l = 1, r = SZ(tnodes);
            while (l!=r) {
                int mid = (l+r)/2;
                vector<int> go (tnodes.begin(), tnodes.begin() + mid);
                go.insert(go.end(), nottnodes.begin(), nottnodes.end());
                if (ask(0, i, go)) {
                    // reachable... i can use fewer nodes
                    r = mid;
                }else {
                    l = mid+1;
                }
            }
            int a = tnodes[l-1];
            bug(a, i);
            build(a,i);
        }
    }
}

void findculprit(int v, int u, int uno) {
    // find stuff on the other side of u
    // u cannot take stuff in the subtree of uno
    bug(v,u,uno);
    for (int x : tree[u]) {
        if (x != uno) {
            if (deg[v] >= 7) break;
            // is there some sneaker in this subtree????
            vector<int> gt;
            dfs(x,u,gt);
            bug(SZ(gt));
            int L = 0;
            vector<int> nope(n); // nope[i] = 1 if i was erased by one of the subtrees
            while (deg[v] < 7 && L < SZ(gt)) {
                vector<int> go;
                REP(j, SZ(gt)) {
                    if (!nope[gt[j]]) go.pb(gt[j]);
                }
                go.pb(v);
                if (!ask(v,x,go)) break;
                bug("yoooo");
                // dammit! there is an edge pointing in here!
                // find the edge pointing in here with the smallest dfs index
                int l = L, r = SZ(gt)-1;
                while (l!=r) {
                    int mid = (l+r)/2;
                    go.clear();
                    REP(it, mid+1) {
                        if (!nope[gt[it]]) go.pb(gt[it]);
                    }
                    go.pb(v);
                    if (ask(v,x,go)) {
                        // i can take fewer
                        r = mid;
                    }else{
                        l = mid+1;
                    }
                }
                int yo = gt[l];
                answer(v,yo);
                findculprit(v, yo, from[yo]);
                vector<int> underyo;
                dfs(yo, from[yo], underyo);
                for (int ele : underyo) {
                    nope[ele] = 1;
                }
                for (L = l; L < SZ(gt) && nope[gt[L]]; ++L);
            }
        }

    }
}



void Detect(int T, int N) {
    n=N;
    buildtree();
    vector<int> dord;
    dfs(0, -1, dord);
    REP(i,n) {
        int v = dord[i];
        if (deg[v] < 7) {
            // sneaky!!!
            // i can do more pruning later
            for (int u : tree[v]) {
                {
                    findculprit(v,u,v);
                }
            }
        }
    }
}

#ifdef BALBIT
signed main(){
    IOS();
    vector<pii> edges = {{0,4}, {0,2}, {1,2}, {1,3}, {2,5}, {4,6}, {4,7}, {3,4}, {2,7}};
    REP(i, SZ(edges)) {
        gra[edges[i].f].pb(edges[i].s);
        gra[edges[i].s].pb(edges[i].f);
    }
    int N = 8;
    Detect(-1, N);

}
#endif

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 9 ms 552 KB Output is correct
3 Correct 8 ms 488 KB Output is correct
4 Correct 24 ms 468 KB Output is correct
5 Correct 33 ms 508 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 680 KB Output is correct
2 Correct 178 ms 736 KB Output is correct
3 Correct 145 ms 2128 KB Output is correct
4 Correct 108 ms 724 KB Output is correct
5 Correct 100 ms 704 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 544 KB Output is correct
2 Correct 204 ms 560 KB Output is correct
3 Correct 201 ms 680 KB Output is correct
4 Correct 200 ms 672 KB Output is correct
5 Correct 197 ms 728 KB Output is correct
6 Correct 203 ms 740 KB Output is correct
7 Correct 196 ms 576 KB Output is correct
8 Correct 200 ms 640 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 532 KB Output is correct
2 Correct 197 ms 672 KB Output is correct
3 Correct 199 ms 596 KB Output is correct
4 Correct 161 ms 620 KB Output is correct
5 Correct 186 ms 700 KB Output is correct
6 Correct 156 ms 716 KB Output is correct
7 Correct 122 ms 748 KB Output is correct
8 Correct 188 ms 620 KB Output is correct
9 Correct 158 ms 616 KB Output is correct
10 Correct 189 ms 700 KB Output is correct
11 Correct 195 ms 704 KB Output is correct
12 Correct 192 ms 596 KB Output is correct
13 Correct 133 ms 652 KB Output is correct
14 Correct 203 ms 700 KB Output is correct
15 Correct 134 ms 672 KB Output is correct
16 Correct 202 ms 588 KB Output is correct
17 Correct 103 ms 724 KB Output is correct
18 Correct 190 ms 668 KB Output is correct
19 Correct 132 ms 716 KB Output is correct
20 Correct 178 ms 624 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 688 KB Output is correct
2 Correct 232 ms 884 KB Output is correct
3 Correct 218 ms 576 KB Output is correct
4 Correct 197 ms 688 KB Output is correct
5 Correct 241 ms 608 KB Output is correct
6 Correct 126 ms 768 KB Output is correct
7 Correct 202 ms 692 KB Output is correct
8 Correct 186 ms 720 KB Output is correct
9 Correct 191 ms 836 KB Output is correct
10 Correct 197 ms 724 KB Output is correct
11 Correct 175 ms 636 KB Output is correct
12 Correct 183 ms 652 KB Output is correct
13 Correct 191 ms 668 KB Output is correct
14 Correct 236 ms 740 KB Output is correct
15 Correct 186 ms 680 KB Output is correct
16 Correct 198 ms 588 KB Output is correct
17 Correct 104 ms 860 KB Output is correct
18 Correct 171 ms 716 KB Output is correct