Submission #306889

#	Time	Username	Problem	Language	Result	Execution time	Memory
306889		giorgikob	Stations (IOI20_stations)	C++14	0 / 100	981 ms	876 KiB

stations

#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

const int N = 1e3+5;

/*int cnt = 0;
int c = 0;
int answer[N][N];

void dfs(int x){
    fix[x] = 1;
    answer[root][x] = c;
    for(auto to : gr[x]){
        if(fix[to]) continue;
        dfs(to);
    }
}*/

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;
		//cnt++;
	}

	/*for(int i = 0; i < n; i++){
        int x = u[i];
        int y = v[i];
        gr[x].pb(y);
        gr[y].pb(x);
	}

	for(int x = 0; x < n; x ++){
        fix[x] = 1;
        for(auto to : gr[x]){
            dfs(to);
        }
	}*/
	return labels;
}

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

Compilation message (stderr)

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

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