제출 #604805

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604805		Sam_a17	기지국 (IOI20_stations)	C++14	0 / 100	1105 ms	5456 KiB

stations

#include <bits/stdc++.h>
using namespace std;
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(x) cout << #x << " " << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define ld long double
#define ll long long
 
void pr(vector<int>& a) {
  cerr << "arr" << " ";
  for(auto i: a) {
    cerr << i << " "; 
  } cerr << endl;
}
 
const int N = 1e5 + 10;
vector<int> adj[N], order;
bool vis[N];
void dfs(int node, int parent) {
  vis[node] = true;
  order.push_back(node);
  for(auto i: adj[node]) {
    if(vis[i]) continue;
    dfs(i, node);
  }
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n), in(n);

  for(int i = 0; i < n - 1; i++) {
    in[u[i]]++, in[v[i]]++;
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);
  }
 
  int start = -1;
  for(int i = 0; i < n; i++) {
    if(in[i] == 1) {
      start = i;
      break;
    }
  }
  
  // assert(start != -1);
  dfs(start, -1);

	for (int i = 0; i < n; i++) {
		labels[order[i]] = i;
	}
 
	return labels;
}
 
int find_next_station(int s, int t, std::vector<int> c) {
  if(s < t) {
    int maxi = -1;
    for(auto i: c) {
      maxi = max(maxi, i);
    }
    return maxi;
  } else {
    int mini = 10000;
    for(auto i: c) {
      mini = min(mini, i);
    }
    return mini;
  }
 
	return c[0];
}

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