Submission #604734

#	Time	Username	Problem	Language	Result	Execution time	Memory
604734		Sam_a17	Stations (IOI20_stations)	C++14	0 / 100	4 ms	5328 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
 
// #include "mushrooms.h"
int use_machine(vector<int> m);
 
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;

void dfs(int node, int parent) {
  order.push_back(node);
  int cnt = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    cnt++;
    dfs(i, node);
  }
  assert(cnt <= 1);
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n), in(n + 10);

  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, 0);
  assert(sz(order) != n);
	for (int i = 0; i < n; i++) {
    // assert(order[i] < n);
		labels[i] = i;
	}

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
  // dbg(s)
  // dbg(t)
  // for(auto i: c) {
  //   dbg(i)
  // // }
  // 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