제출 #576682

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576682		radal	즐거운 행로 (APIO20_fun)	C++17	26 / 100	159 ms	157912 KiB

fun

#include "fun.h"

#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse4,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 2e5+20,mod = 998244353,inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
//    if (a+b < 0) return a+b+mod;
    return a+b;
}
vector<int> adj[N];
int n,h[N],vis[N],T,tin[N],tout[N];
deque<int> dq[N];
void dfs(int v,int p){
    tin[v] = T;
    T++;
    for (int u : adj[v]){
        if (u != p){
            h[u] = h[v]+1;
            dfs(u,v);
        }
    }
    tout[v] = T;
    T++;
}
vector<int> createFunTour(int N, int Q){
    n = N;
    if (1ll*n*(n-1)/2 <= Q){
        rep(i,0,n){
            rep(j,i+1,n)
                if (hoursRequired(i,j) == 1){
                    adj[i].pb(j);
                    adj[j].pb(i);
                }
        }
    }
    else{
        rep(i,1,n){
            adj[(i-1)/2].pb(i);
            adj[i].pb((i-1)/2);
        }
        dfs(0,-1);
        rep(i,0,n){
            dq[h[i]].pb(i);
        }
        bool f = 0;
        vector<int> ans(n);
        int cur = h[n-1];
        rep(i,0,n){
            if (dq[cur].empty()) cur--;
            if (f){
                ans[i] = dq[cur].back();
                dq[cur].pop_back();
                f = !f;
                continue;
            }
            else{
                ans[i] = dq[cur].front();
                dq[cur].pop_front();
                f = !f;
                continue;
            }
        }
        return ans;
    }
    vector<int> ans;
    ans.resize(n);
    int cur = 0;
    rep(i,0,n){
        h[cur] = 0;
        dfs(cur,-1);
        int mx = 0,ind = -1;
        rep(j,0,n){
            if (!vis[j] && h[j] > mx){
                ind = j;
                mx = h[j];
            }
        }
        vis[ind] = 1;
        ans[i] = ind;
        cur = ind;
    }
    return ans;
}

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