Submission #1140318

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140318		Almonther	Stations (IOI20_stations)	C++20	0 / 100	310 ms	564 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

#define ll long long
#define co cout<<
using namespace std;
//stuff
const ll maxn=1005;
ll a[maxn]={};
vector<ll>v1[maxn];
ll tim=0;
void dfs(ll x,ll last,ll dep){
    if(dep%2==0) a[x]=tim++;
    for(auto i:v1[x]){
        if(i!=last) dfs(i,x,dep+1);
    }
    if(dep%2) a[x]=tim++;
}
vector<int>label(int n, int k, vector<int> u, vector<int> v){
    for(int i=0;i<u.size();i++){
        v1[u[i]].push_back(v[i]);
        v1[v[i]].push_back(u[i]);
    }
    dfs(0,0,0);
    ll cnt=0;
    vector<int>labels;
    for(int i=0;i<n;i++) labels.push_back(a[i]);
    for(int i=0;i<=n;i++) v1[i].clear();
    memset(a,0,sizeof(a));
    tim=0;
    return labels;
}
int find_next_station(int s, int t, vector<int> c) {
    sort(c.begin(),c.end());
    if(s>c[0]){
        // i have the right
        for(int i=0;i<c.size()-1;i++) if(t>=c[i]) return c[i];
        return c.back();
    }
    else if(s<c.back()){
        // i have the left
        for(int i=c.size();i>0;i--) if(t<=c[i]) return c[i];
        return c[0];
    }
    else{
        // im the root
        for(int i=0;i<c.size();i++) if(t>=c[i]) return c[i];
    }
}

// int main(){
//     co find_next_station(1,3,{5,2,3});
//     // co find_next_station(4,3,{2,1});
//     // vector<int>smth=label(5,1000,{0,1,2,3},{1,2,3,4});
//     // for(int i=0;i<smth.size();i++){
//     //     co i<<' '<<smth[i]<<'\n';
//     // }
// }

Compilation message (stderr)

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

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