제출 #1077726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1077726		GrindMachine	Fun Tour (APIO20_fun)	C++17	21 / 100	394 ms	103252 KiB

fun

#include <bits/stdc++.h>
using namespace std;
 
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define conts continue
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define ff first
#define ss second
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &x, T y){
    x = min(x,y);
}
 
template<typename T>
void amax(T &x, T y){
    x = max(x,y);
}
 
template<typename A,typename B>
string to_string(pair<A,B> p);
 
string to_string(const string &s){
    return "'"+s+"'";
}
 
string to_string(const char* s){
    return to_string((string)s);
}
 
string to_string(bool b){
    return b?"true":"false";
}
 
template<typename A>
string to_string(A v){
    string res = "{";
    trav(x,v){
        res += to_string(x)+",";
    }
    if(res.back() == ',') res.pop_back();
    res += "}";
    return res;
}
 
template<typename A,typename B>
string to_string(pair<A,B> p){
    return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}
 
#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;
 
#include "fun.h"

std::vector<int> createFunTour(int n, int q) {
    // int H = hoursRequired(0, N - 1);
    // int A = attractionsBehind(0, N - 1);
    // return std::vector<int>(N);
    
    map<pii,int> mp;
 
    auto dis = [&](int u, int v){
        if(u > v) swap(u,v);
        pii px = {u,v};
        if(mp.count(px)) return mp[px];
        return mp[px] = hoursRequired(u,v);
    };
 
    pii best = {-1,-1};
    rep1(i,n-1){
        pii px = {dis(0,i),i};
        amax(best,px);
    }
    
    vector<vector<int>> adj(n);
    vector<int> depth(n);
    rep1(i,n-1){
        adj[(i-1)/2].pb(i);
        depth[i] = depth[(i-1)/2]+1;
    }

    vector<set<pii>> st(n);

    auto ins = [&](int u){
        for(int p = u; ; p = (p-1)>>1){
            st[p].insert({depth[u],u});
            if(!p) break;
        }
    };

    auto rem = [&](int u){
        for(int p = u; ; p = (p-1)>>1){
            st[p].erase({depth[u],u});
            if(!p) break;
        }
    };

    auto farthest_active = [&](int u){
        int prev = -1;
        pii best = {-1,-1};

        for(int p = u; ; p = (p-1)>>1){
            {
                pii px = {depth[u]-depth[p],p};
                amax(best,px);
            }

            trav(v,adj[p]){
                if(v == prev) conts;
                if(!st[v].empty()){
                    auto px = *st[v].rbegin();
                    int d = depth[u]+depth[px.ss]-2*depth[p];
                    pii curr = {d,px.ss};
                    amax(best,curr);
                }
            }

            prev = p;
            if(!p) break;
        }

        return best;
    };

    int curr = best.ss;
    rep(i,n) ins(i);
    vector<int> ans;

    while(true){
        rem(curr);
        ans.pb(curr);
        if(sz(ans) == n) return ans;

        auto best = farthest_active(curr);

        // best = {-1,-1};
        // rep(i,n){
        //     if(rem[i]) conts;
        //     pii px = {dis(curr,i),i};
        //     amax(best,px);
        // }
 
        curr = best.ss;
    }
 
    assert(0);
    return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 16
• Subtask 3: 21 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34