Submission #385975

#	Time	Username	Problem	Language	Result	Execution time	Memory
385975		PedroBigMan	Stations (IOI20_stations)	C++14	5 / 100	1043 ms	1188 KiB

stations

#include "stations.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;
 
template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}
 
template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}}
 
vector<ll> label(ll N, ll k, vector<ll> u, vector<ll> v) 
{
	vector<ll> xx; vector<vector<ll> > adj; REP(i,0,N) {adj.pb(xx);}
	REP(i,0,N-1) {adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]);}
	ll beg; REP(i,0,N) {if(adj[i].size()==1) {beg=i; break;}}
	vector<ll> label; REP(i,0,N) {label.pb(-1);}
	ll cur=beg; vector<bool> visited; REP(i,0,N) {visited.pb(false);}
	ll ind = 0;
	REP(i,0,N)
	{
		visited[cur]=true; label[cur]=ind; ind++;
		ll nxt = adj[cur][0]; if(visited[nxt]) {nxt=adj[cur][1];}
		cur=nxt;
	}
	return label;
}
 
ll find_next_station(ll s, ll t, vector<ll> c) 
{
	if(t>s) {return (s+1);} else if(t<s) {return (s-1);} else {return s;}
}

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(ll, ll, std::vector<int>, std::vector<int>)':
stations.cpp:55:14: warning: 'beg' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |   visited[cur]=true; label[cur]=ind; ind++;
      |              ^

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