Submission #1296413

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296413		eri16	Stations (IOI20_stations)	C++20	100 / 100	399 ms	564 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> lbl;

int t=-1;

vector<vector<int>> adj(1005);

void dfs(int node, int parent, int odd){
	if (odd){t++;lbl[node]=t;}
	for(int child : adj[node])
		if(child != parent) dfs(child,node,1-odd);
	if (!odd){t++;lbl[node]=t;}
}


vector<int> label(int n, int k, vector<int> u, vector<int> v){
    lbl.resize(n);
    adj.assign(n, {}); 

	for(int i=0; i<n-1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	t=-1;
    dfs(0,t,1);
    return lbl;
}

int find_next_station(int start, int final, vector<int> rel){
	
	int n=rel.size();
	
	if (start<rel[0]){
	    if (final<=start){return rel[n-1];}
	    if (start!=0){
            for (int i=0; i<n-1; i++){
                if (final<=rel[i]){
                    return rel[i];
                }
            }
            return rel[n-1];
	    }
        for (int i=0; i<n; i++){
            if (final<=rel[i]){
                return rel[i];
            }
        }	    
	}
	else{
	    if (final>=start){return rel[0];}
	    for (int i=n-1; i>=0; i--){
	        if (final>=rel[i]){return rel[i];}
	    }
	}
	return rel[0];
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61