제출 #609804

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
609804		daria	기지국 (IOI20_stations)	C++14	52.32 / 100	865 ms	792 KiB

stations

#include"bits/stdc++.h"
#include "stations.h"
#include <vector>
using namespace std;

const int N = 1000;

int T;
vector<int> adj[N], lb(N);

void dfs(int s){
 if(lb[s]!=-1) return;
 lb[s] = T*N;
 for(auto u : adj[s]) dfs(u);
 lb[s] += T; T++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
 for(int i=0; i<N; ++i) adj[i].clear();
 lb.resize(N);
 fill(lb.begin(), lb.end(), -1);
 T = 0;

 for(int i=0; i<n-1; ++i){
  adj[u[i]].push_back(v[i]);
  adj[v[i]].push_back(u[i]);
 }
 dfs(0);
 lb.resize(n);
 return lb;
}

int find_next_station(int s, int t, vector<int> c) {
 // x entrata, y uscita
 int x1 = s/N; int y1 = s%N;
 int x2 = t/N; int y2 = t%N;
 int par = s; //parent di s
 for(auto u : c){
  int x3 = u/N; int y3 = u%N;
  if(x3 <= x1 && y1 <= y3) par = u;
 }
 //cout << par;
 if(x1 <= x2 && y2 <= y1){ // s é parent di t
  for(auto u : c){
   int x3 = u/N; int y3 = u%N;
   if(x3 <= x2 && y2 <= y3 && u != par) return u; //parent di t più in basso di s
  }
 }
 return par;
}

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