제출 #781216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781216		bane	기지국 (IOI20_stations)	C++17	0 / 100	4 ms	748 KiB

stations

    #include "stations.h"
    #include<bits/stdc++.h>
     
    using namespace std;
     
    const int Nax = 1005;
    int P;
    class Undirected_Graph{
    	public:
    		
    		int N, Timer = 0;
    		vector<vector<int>>adj;
    		vector<int>in, out;
     
    		Undirected_Graph(int _N):N(_N){
    			adj.resize(N);
					out.resize(N);
    			in.resize(N);
    		}
     
    		inline void Add_Edge(int A, int B){
    			adj[A].push_back(B);
    			adj[B].push_back(A);
    		}
     
    		inline void Depth_First_Search(int Node, int Parent){
    			in[Node] = Timer++;
    			for (int& Next : adj[Node]){
    				if (Next == Parent)continue;
    				Depth_First_Search(Next,Node);
    			}
					out[Node] = Timer - 1;
    		}
     
    };
     
     
    std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    	std::vector<int> labels(n);
			P = n;
    	Undirected_Graph G(n);
     
    	for (int i = 0; i < n - 1; i++){
    		G.Add_Edge(u[i],v[i]);
    	}
     
    	G.Depth_First_Search(0,0);
     
			for (int i = 0; i < n; i++){
				labels[i] = n * G.in[i] + G.out[i];
			}
     
    	return labels;
    }
     
    int find_next_station(int s, int t, std::vector<int> c) {
			int index = 0, n = (int)c.size();
			for (int i = 0; i < n; i++){
				int in = c[i] / P;
				int out = c[i] % P;

				if (in <= s/P && out >= s%P){
					index = i;
					//parent
					continue;
				}

				if (t / P >= in && t / P <= out){
					return c[i];
				}
			}
    	return c[index];
    }

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