Submission #1296052

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296052		eri16	Stations (IOI20_stations)	C++20	0 / 100	403 ms	484 KiB

stations

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

using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {

    vector<vector<int>> adj(n);
    
    for (int i=0; i<n-1; i++) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    
    vector <int> lbl(n);
    
    for (int i=0; i<n; i++){
        int ans=i;
        for (int j=0; j<adj[i].size(); j++){
            int visited[n]={0};
            visited[i]=1;
            queue <int> q;
            q.push(adj[i][j]);
            while (q.size()){
                int x=q.front();
                q.pop();
                if (visited[x]==0){
                    visited[x]=1;
                    ans=ans*10+x;
                    for (int ij=0; ij<adj[x].size(); ij++){
                        q.push(adj[x][ij]);
                    }
                }
            }
            ans=ans*10+adj[i][j];
        }
        lbl[i]=ans;
    }
    return lbl;
}

int find_next_station(int s, int t, vector <int> cp){
    int target=t;
    while (target>9){
        target=target/10;
    }
    
    vector <int> c;
    
    while (s>0){
        c.push_back(s%10);
        s=s/10;
    }
  
    for (int i=0; i<c.size(); i++){
        if (c[i]==t){
            for (int j=i; j<c.size(); j++){
                for (int z=0; z<cp.size(); z++){
                    if (cp[z]==c[j]){return cp[z];}
                }
            }
        }
    }  
    return cp[0];
}

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