제출 #652901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652901		coding_snorlax	Stations (IOI20_stations)	C++14	0 / 100	1 ms	336 KiB

stations

#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> G[1005];
int sub_tree_size[1005];
int vis[1005]={0};
int tree_order[1005];
int now_order=0;
int dfs(int node){
    vis[node]=1;
    
    tree_order[node]=now_order;
    now_order++;
    int Count=0;
    for(int i:G[node]){
        if(!vis[i]){
            Count+=dfs(i);
        }
    }
    sub_tree_size[node]=Count;
    return Count+1;
}
void get_graph(vector<int> G1,vector<int> G2){
    for(int i=0;i<1005;i++){
 		G[i].clear();
    }
    for(int i=0;i<(int)G1.size();i++){
        G[G1[i]].push_back(G2[i]);
        G[G2[i]].push_back(G1[i]);
    }
    for(int i=0;i<1005;i++){
        vis[i]=0;
        now_order=0;
    }
    dfs(0);
    return;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v){
    get_graph(u,v);
    vector<int> test={0};
	return test;
}
//s/1000 is node, s%1000 is connect place
int find_next_station(int s,int t,vector<int> c){
	return 0;
 
}

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