Submission #795654

#	Time	Username	Problem	Language	Result	Execution time	Memory
795654		alexander707070	Stations (IOI20_stations)	C++14	0 / 100	3034 ms	2097156 KiB

stations

#include<bits/stdc++.h>
#define MAXN 1007
using namespace std;

int n;
vector<int> sol,v[MAXN];
int tim,num[MAXN];

void dfs(int x,int p,int dep){
    num[x]=tim; tim++;
    for(int i=0;i<v[x].size();i++){
        if(v[x][i]!=p)dfs(v[x][i],x,dep+1);
    }
    sol[x]=num[x]*1000+tim;
}

vector<int> label(int N, int k,vector<int> from,vector<int> to){
    n=N;
    sol.resize(n);

    for(int i=0;i<n-1;i++){
        v[from[i]].push_back(to[i]);
        v[to[i]].push_back(from[i]);
    }
    dfs(0,-1,0);

    return sol;
}

int find_next_station(int s, int t,vector<int> c){
    int st=s/1000;
    int et=t/1000;

    for(int i=0;i<c.size();i++){
        if(c[i]/1000<st)continue;
        if(c[i]/1000<=et and et<=c[i]%1000)return c[i];
    }
    
    for(int i=0;i<c.size();i++){
        if(c[i]/1000<st)return c[i];
    }
}

Compilation message (stderr)

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

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