Submission #27132

#	Time	Username	Problem	Language	Result	Execution time	Memory
27132		wangyenjen	Park (JOI17_park)	C++14	20 / 100	173 ms	2132 KiB

park

// Author: Wang, Yen-Jen
#include "park.h"
#include <bits/stdc++.h>

using namespace std;

static int N;
static int place[1400];

inline static void subtask1() {
    memset(place , 0 , sizeof(place));
    for(int i = 0; i < N; i++) {
        for(int j = i + 1; j < N; j++) {
            place[i] = 1;
            place[j] = 1;
            if(Ask(i , j , place)) Answer(i , j);
            place[i] = 0;
            place[j] = 0;
        }
    }
}

inline static void subtask2() {
    for(int i = 0; i < N; i++) place[i] = 1;
    vector<int> vec;
    for(int i = 1; i < N - 1; i++) vec.push_back(i);
    stable_sort(vec.begin() , vec.end() , [&](const int x , const int y) {
        place[x] = 0;
        int t = Ask(0 , y , place);
        place[x] = 1;
        return t == 0;
    });
    for(int i = 1; i < (int)vec.size(); i++) Answer(min(vec[i - 1] , vec[i]) , max(vec[i - 1] , vec[i]));
    Answer(0 , vec[0]);
    Answer(vec.back() , N - 1);
}

static void dfs_for_subtask3(int p , int l , int r ,  vector<int> &vec) {
    if(l > r) return;
    if(l == r) {
        vec.push_back(l);
        return;
    }
    int m = (l + r) >> 1;
    for(int i = 0; i < N; i++) place[i] = 1;
    for(int i = l; i <= m; i++) place[i] = 0;
    place[p] = 1;
    if(!Ask(0 , p , place)) dfs_for_subtask3(p , l , m , vec);
    for(int i = 0; i < N; i++) place[i] = 1;
    for(int i = m + 1; i <= r; i++) place[i] = 0;
    place[p] = 1;
    if(!Ask(0 , p , place)) dfs_for_subtask3(p , m + 1 , r , vec);
}

inline void subtask3() {
    static bool vis[1400];
    static int dep[1400];
    for(int i = 0; i < N; i++) {
        vis[i] = 0;
        dep[i] = 0;
    }
    dep[0] = 0;
    vis[0] = 1;
    for(int i = 1; i < N; i++) {
        if(!vis[i]) continue;
        vector<int> vec , vec2;
        dfs_for_subtask3(i , 1 , N - 1 , vec);
        int p = 0;
        for(int x : vec) {
            if(vis[x]) {
                if(dep[x] > dep[p]) p = x;
            }
            else {
                vec2.push_back(x);
                vis[x] = 1;
            }
        }
        for(int j = 0; j < N; j++) place[j] = 1;
        stable_sort(vec2.begin() , vec2.end() , [&](const int x , const int y) {
            place[x] = 0;
            int t = Ask(0 , y , place);
            place[x] = 1;
            return t == 0;
        });
        Answer(min(p , vec2[0]) , max(p , vec2[0]));
        dep[vec2[0]] = dep[p] + 1;
        for(int j = 1; j < (int)vec2.size(); j++) {
            Answer(min(vec2[j - 1] , vec2[j]) , max(vec2[j - 1] , vec2[j]));
            dep[vec2[j]] = dep[vec2[j - 1]] + 1;
        }
    }
}

void Detect(int T , int _N) {
    N = _N;
    if(N == 1) return;
    else if(N == 2) {
        Answer(0 , 1);
        return;
    }
    if(T == 1) subtask1();
    else if(T == 2) subtask2();
    else if(T == 3) subtask3();
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 27
• Subtask 4: 0 / 30
• Subtask 5: 0 / 23