제출 #387736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387736		RohamIzadidoost	즐거운 행로 (APIO20_fun)	C++14	26 / 100	127 ms	14752 KiB

fun

#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include "fun.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X   first
#define Y   second
#define mp  make_pair
#define pii pair<int , int>
#define vec vector
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
// BIG p : 1000000000000037 , 100000000003
ll poww(ll a, ll b, ll md) {
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
const int maxn = 1000*100+5 ;
const ll inf = 9223372036854775807 ;
const ll mod = 1e9 + 7 ;
const int lg = 20 ;
pii p ;
int cur , mark[maxn] ; 
vec<int> createFunTour(int n , int Q){
	for(int i = 0 ; i < n ; i ++ ){
		p = max(p , { hoursRequired(0 , i) , i} ) ; 
	}
	cur = p.Y ; 
	vec<int> ans ; 
	ans.pb(cur) ;
	while(SZ(ans) < n){
		cur = ans.back() ;
		mark[cur] = 1 ; 
		p = {0 , 0} ; 
		for(int i = 0 ; i < n ; i ++ ){
			if(!mark[i]){
				p = max(p , {hoursRequired(cur , i) , i}) ;
			}
		}
		ans.pb(p.Y) ;
	}
	return ans ; 
}

/*int main()
{
	migmig ;

}*/

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