Submission #639624

#	Time	Username	Problem	Language	Result	Execution time	Memory
639624		ghostwriter	Stations (IOI20_stations)	C++14	0 / 100	1 ms	336 KiB

stations

#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "stub.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int MAXN = 1e3 + 5;
int N, tin[MAXN], tout[MAXN], l[MAXN], cnt = 0;
vi adj[MAXN];
void dfs(int u, int p, int h) {
	tin[u] = cnt++;
	EACH(v, adj[u]) {
		if (v == p) continue;
		dfs(v, u, h ^ 1);
	}
	tout[u] = cnt++;
	if (h & 1) l[u] = tout[u];
	else l[u] = tin[u];
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	N = n;
	FOR(i, 0, N - 1) adj[i].clear();
	FOR(i, 0, N - 2) {
		int ui = u[i], vi = v[i];
		adj[ui].pb(vi);
		adj[vi].pb(ui);
	}
	dfs(0, -1, 0);
	vi b;
	FOR(i, 0, N - 1) b.pb(l[i]);
	sort(all(b));
	FOR(i, 0, N - 1) l[i] = lb(all(b), l[i]) - b.begin();
	FOR(i, 0, N - 1) v[i] = l[i];
	return v;
}
int find_next_station(int s, int t, std::vector<int> c) {
	if (s < c[0]) {
		if (t >= c[sz(c) - 2]) return c[sz(c) - 1];
		if (t < s) return c[sz(c) - 1];
		return c[lb(all(c), t) - c.begin()];
	}
	else {
		if (t > s) return c[0];
		if (t <= c[1]) return c[0];
		if (c[sz(c) - 1] <= t) return c[sz(c) - 1];
		return c[ub(all(c), t) - c.begin() - 1];
	}
}

Compilation message (stderr)

stations.cpp: In function 'void dfs(int, int, int)':
stations.cpp:29:31: warning: unnecessary parentheses in declaration of 'v' [-Wparentheses]
   29 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
stations.cpp:44:2: note: in expansion of macro 'EACH'
   44 |  EACH(v, adj[u]) {
      |  ^~~~
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
stations.cpp:54:2: note: in expansion of macro 'FOR'
   54 |  FOR(i, 0, N - 1) adj[i].clear();
      |  ^~~
stations.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
stations.cpp:55:2: note: in expansion of macro 'FOR'
   55 |  FOR(i, 0, N - 2) {
      |  ^~~
stations.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
stations.cpp:62:2: note: in expansion of macro 'FOR'
   62 |  FOR(i, 0, N - 1) b.pb(l[i]);
      |  ^~~
stations.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
stations.cpp:64:2: note: in expansion of macro 'FOR'
   64 |  FOR(i, 0, N - 1) l[i] = lb(all(b), l[i]) - b.begin();
      |  ^~~
stations.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
stations.cpp:65:2: note: in expansion of macro 'FOR'
   65 |  FOR(i, 0, N - 1) v[i] = l[i];
      |  ^~~

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