제출 #405703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405703		Blistering_Barnacles	즐거운 행로 (APIO20_fun)	C++11	26 / 100	132 ms	40788 KiB

fun

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include "fun.h"
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
set < ll > adj[555555];
const ll mod = 1e9+7;
str s;
void dfs(ll v , ll par , ll dis){
    if(dis > o){
        o = dis , p = v;
    }
    for(auto u : adj[v]){
        if(u == par)C ;
        dfs(u , v , dis + 1) ;
    }
}
vector<int> createFunTour(int N, int Q) {
    n = N ;
    for(ll i = 0 ; i < n ; i++){
        for(ll j = i + 1 ; j < n ; j++){
            if(hoursRequired(i , j) == 1){
                adj[i].insert(j) , adj[j].insert(i) ;
            }
        }
    }
    o = 0 ;
    vll ans = {} ;
    dfs(0 , -1 , 0) ;
    while((ll)sz(ans) < n){
        o = 0 ;
        ans.pb(p) ;
        ll op = p ;
        dfs(p , -1 , 0) ;
        auto u = *adj[op].begin() ;
        adj[op].erase(u) ;
        adj[u].erase(op) ;
    }
    //for(auto u : ans)cout << u << " " ;
    R ans ;
}

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