Submission #399066

#	Time	Username	Problem	Language	Result	Execution time	Memory
399066		Antekb	Stations (IOI20_stations)	C++14	0 / 100	1043 ms	784 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1005;
int pre[N], post[N], d[N];
vector<int> E[N];
int wsk;
void dfs(int v, int p){
	//cout<<v<<" "<<p<<" "<<wsk<<endl;
	pre[v]=wsk++;
	for(int u:E[v]){
		if(u!=p){
			d[u]=d[v]+1;
			dfs(u, v);
		}
	}
	post[v]=wsk++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for(int i=0; i<n-1; i++){
		E[u[i]].push_back(v[i]);
		E[v[i]].push_back(u[i]);
	}
	std::vector<int> labels(n);
	wsk=0;
	d[0]=0;
	//dfs(0, -1);
	for (int i = 0; i < n; i++) {
		/*if(d[i]&1)labels[i] = pre[i];
		else labels[i]=post[i];*/
		labels[i]=i;
		//cout<<i<<" "<<labels[i]<<"\n";
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	return c[0];
	sort(c.begin(), c.end());
	bool ma=1;
	for(int i:c){
		if(i>s)ma=0;
	}
	if(ma){
		if(t>=s)return c[0];
		for(int i=c.size()-1; i>=0; i--){
			if(c[i]<=t)return c[i];
		}
		return c[0];
	}
	else{
		//reverse(c.begin(), c.end());
		if(t<s)return c.back();
		for(int i=0; i<c.size(); i++){
			if(c[i]>=t)return c[i];
		}
		return c.back();
	}
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:54:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for(int i=0; i<c.size(); i++){
      |                ~^~~~~~~~~

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