Submission #805070

#	Time	Username	Problem	Language	Result	Execution time	Memory
805070		Andrey	Stations (IOI20_stations)	C++14	0 / 100	2648 ms	2097152 KiB

stations

#include "stations.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> yay(0);
vector<int> haha[10001];

void dfs(int a, int t, int d) {
    yay[a] = d;
    for(int i = 0; i < haha[a].size(); i++) {
        if(haha[a][i] != t) {
            dfs(haha[a][i],a,d+1);
        }
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    for(int i = 0; i < n-1; i++) {
        haha[u[i]].push_back(v[i]);
        haha[v[i]].push_back(u[i]);
    }

	for(int i = 0; i < n; i++) {
        yay.push_back(0);
	}
	for(int i = 0; i < n; i++) {
        if(haha[i].size() == 1) {
            dfs(i,-1,0);
            break;
        }
	}
	return yay;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(s > t) {
        return c[0];
    }
    else {
        return c[1];
    }
}

Compilation message (stderr)

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

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