Submission #592529

#	Time	Username	Problem	Language	Result	Execution time	Memory
592529		PiejanVDC	Stations (IOI20_stations)	C++17	0 / 100	3038 ms	2097152 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
 
vector<int>adj[1005];

vector<int>l;

int curr = 0;

void dfs(int u, bool f, int e = -1) {
    if(f)
        l[u] = curr++;
    
    for(auto z : adj[u]) if(z != e) {
        dfs(z, 1 - f, u);
    }

    if(!f)
        l[u] = curr++;
}

vector<int>label(int n, int k, vector<int>u, vector<int>v) {
    l.resize(n, -1);
    curr = 0;

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

    dfs(0, 1);

  

    return l;
}

int find_next_station(int s, int t, vector<int>c) {
    if(c.size() == 1)
        return c[0];

    if(s < c[0]) {
        if(t < s)
            return c.back();
        if(t >= c.back())
            return c.back();
        for(int i = 0 ; i < c.size()-1 ; i++)
            if(c[i] >= t)
                return c[i];
    } else {
        if(t > s)
            return c[0];
        if(t <= c[0])
            return c[0];
        for(int i = 1 ; i < c.size() ; i++) 
            if(c[i] <= t)
                return c[i];
    }
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int i = 0 ; i < c.size()-1 ; i++)
      |                         ~~^~~~~~~~~~~~
stations.cpp:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(int i = 1 ; i < c.size() ; i++)
      |                         ~~^~~~~~~~~~
stations.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
   60 | }
      | ^

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