Submission #431365

#	Time	Username	Problem	Language	Result	Execution time	Memory
431365		idk321	Stations (IOI20_stations)	C++17	52.32 / 100	1226 ms	700 KiB

stations

#include "stations.h"
#include <vector>

using namespace std;

const int M = 1000000000;
const int N = 1000;
int in[N];
int out[N];
vector<int> adj[N];
vector<int> labels;

int n, k;

int timer;



void dfs2(int node, int par)
{
    timer++;
    in[node] = timer;

    for (int next : adj[node])
    {
        if (next == par) continue;
        dfs2(next, node);
    }

    out[node] = timer;
}





std::vector<int> label(int n1, int k1, std::vector<int> u, std::vector<int> v) {
    n = n1;
    k = k1;

	labels.assign(n, 0);


    for (int i = 0; i < n; i++) adj[i].clear();
    for (int i = 0; i < u.size(); i++)
    {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }




    timer = -1;
    dfs2(0, -1);



	for (int i = 0; i < n; i++) {
		labels[i] = in[i] * 1000 + out[i];
	}
	return labels;
}



int find_next_station(int s, int t, std::vector<int> c) {
    int sIn = s / 1000;
    int sOut = s % 1000;
    int tIn = t / 1000;
    int tOut = t % 1000;


    if (sIn <= tIn && tOut <= sOut)
    {
        for (int next : c)
        {
            int nextIn = next / 1000;
            int nextOut = next % 1000;
            if (!(nextIn <= sIn && sOut <= nextOut) && (nextIn <= tIn && tOut <= nextOut)) return next;
        }
    } else
    {
        for (int next : c)
        {
            int nextIn = next / 1000;
            int nextOut = next % 1000;
            if (nextIn <= sIn && sOut <= nextOut) return next;
        }
    }



	return c[0];
}

Compilation message (stderr)

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

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