Submission #740440

#	Time	Username	Problem	Language	Result	Execution time	Memory
740440		shadow_sami	Fun Tour (APIO20_fun)	C++17	26 / 100	30 ms	796 KiB

fun

#include"fun.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 500+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi adj[mx];
ll dis[mx];
bool vis[mx];
ll distanc,node;

// int hoursRequired(int a,int b){
// 	// cout<<a<< " "<<b<<nli;
// 	int val;
// 	cin>>val;
// 	return val;
// }

void dfs(ll u,ll par,ll de){
	// cout<<par<<nli;
	// cout<<u<<nli;
	// if(vis[u])
	// 	return;
	dis[u] = de;
	if(dis[u]>distanc){
		distanc = dis[u];
		node = u;
	}	
	fx(adj[u]){
		if(x==par)
			continue;
		if(vis[x])
			continue;
		// cout<<u<<nli;
		// cout<<x<<nli;
		// if(x==5 && u==6)
		// 	cout<<"bal\n"<<nli;
		dfs(x,u,de+1);
	}
}

vector<int> createFunTour(int N, int Q) {
	n = N;
	// debug(n);
    vector<int> v;
    for(int i = 0 ; i < n ; i++){
  		for(int j = i+1 ; j < n ; j++){
  			if(i!=j){
  				ll k = hoursRequired(i,j);
  				if(k==1){
  					adj[i].push_back(j);
  					adj[j].push_back(i);
  				}
  			}
  	    }
    }
    memset(vis,false,sizeof(vis));
    distanc = -1,node = -1;
    dfs(0,-1,0);
    dfs(node,-1,0);
    cnt = n-2;
    vis[node] = 1;
    v.push_back(node);
    // cout<<" OK\n";
    distanc = -1;
    dfs(node,-1,0);
    vis[node] = 1;
    v.push_back(node);
    while(cnt>0){
    	distanc = -1;
    	dfs(node,-1,0);
    	vis[node] = 1;
    	v.push_back(node);
    	cnt--;
    }
  return v;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         int N,Q;
//         cin>>N>>Q;
//         vector<int> v = createFunTour(N,Q);

//         fx(v)
//         	cout<<x<<" ";
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

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