Submission #1367685

#TimeUsernameProblemLanguageResultExecution timeMemory
1367685DangerNoodle7591Stations (IOI20_stations)C++20
0 / 100
292 ms540 KiB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define N 1005
#define ins insert

vector<int> adj[N];
int etiket[N];

void coz(int x,int once,int yuk){
    yuk*=10;yuk+=(x+1);
    for(auto u:adj[x]){
        if(u==once)continue;
        coz(u,x,yuk);
    }
    etiket[x]=yuk;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    for(int i=0;i<=n;i++){
        adj[i].clear();etiket[i]=-1;
    }
	for (int i = 0; i < n-1; i++) {
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}

    coz(0,-1,0);
    vector<int> labels;
    for(int i=0;i<n;i++){
        labels.pb(etiket[i]);
    }
	return labels;
}


int find_next_station(int s, int t, vector<int> c) {
    //if(t<s)return c[0];
    string a=to_string(s), b=to_string(t);
    int yer=a.size();
    for(auto u:c){
        if(u<s)continue;
        string x=to_string(u);
        if(b[yer]==x[yer])return u;
    }
    return -1;
}


#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...