Submission #1234423

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234423		caacrugon	Stations (IOI20_stations)	C++20	0 / 100	2 ms	588 KiB

stations

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

using namespace std;

int dfs(vector<int>&labels,vector<bool>&visited,vector<vector<int>>&adj,int i,int nodo){
	int maxi=i;
	visited[nodo]=true;
	for(int j=0;j<adj[nodo].size();j++){
		if(visited[adj[nodo][j]])continue;
		maxi=max(maxi,dfs(labels,visited,adj,i+1,adj[nodo][j]));
	}
	labels[nodo]=(i*1000)+maxi;
	return labels[nodo];
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
	}
	vector<int> indegree(n,0);
	vector<vector<int>> adj(n,vector<int>(0,0));
	for(int i=0;i<u.size();i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
		indegree[u[i]]++;
		indegree[v[i]]++;
	}
	stack<int> st;
	for(int i=0;i<n;i++){
		if(indegree[i]==1){
			st.push(i);
			break;
		}
	}
	vector<bool> visited(n,false);
	dfs(labels,visited,adj,1,st.top());
	//while(st.size()){
	//	int nodo=st.top();
	//	st.pop();
	//	visited[nodo]=true;
	//	labels[nodo]=i*1000;
	//	i++;
	//	for(int j=0;j<adj[nodo].size();j++){
	//		if(visited[adj[nodo][j]])continue;
	//		st.push(adj[nodo][j]);
	//	}
	//}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	for(int i=0;i<c.size();i++){
		string str=to_string(c[i]);
		string starts="",ends="";
		int start=0,end=0;
		bool in=true;
		for(int i=0;i<str.size();i++){
			if(i<str.size()-3)starts+=str[i];
			else ends+=str[i];
		}
		start=stoi(starts);
		end=stoi(ends);
		if(start<=t && t<=end)return c[i];
	}
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^

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