oj.uz

답안 #308717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308717 2020-10-01T17:59:14 Z silverfish 기지국 (IOI20_stations) C++17
100 / 100
 1125 ms 1308 KB 
#include <bits/stdc++.h>
#include "stations.h"
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; };
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)

const int INF = 1e9 + 7;
const int MxN = 2020;

vector<int> adj[MxN];
int counter = 0;
vector<int> tin, tout, in;

void dfs(int v, int p, bool isIn){
	in[v] = isIn;

	tin[v] = counter++;
	for(int u : adj[v]){
		if(u != p){
			dfs(u, v, !isIn);
		}
	}
	tout[v] = counter++;
	return;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	counter = 0;
	for(int i = 0; i < MxN; i++) adj[i].clear();
	tin.assign(n, -1);
	tout.assign(n, -1);
	in.assign(n, -1);

	for(int i = 0; i < n-1; i++){
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}

	dfs(0, 0, 1);

	vector<int> labels(n);

	for(int i = 0; i < n; i++){
		labels[i] = (in[i] ? tin[i]/2 : tout[i]/2);
	}
	debug() << exp(labels);

	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	bool isFirst = 0;
	int p = -1;
	int len = (int)c.size();

	if(s < c[0]) {
		p = c[len-1];
		isFirst = 1;
	}else p = c[0];

	debug() << exp(s) << exp(t) << exp(c) << exp(isFirst) << exp(p);

	if(len == 1){
		return c[0];
	}

	if(isFirst){
		if(t < s || t > c[len-2]) return p;
		return *lower_bound(c.begin(), c.end(), t);
	}else{
		if(t > s || t < c[1]) return p;
		auto it = upper_bound(c.begin(), c.end(), t);
		it--;
		return *it;
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 532 ms 1112 KB Output is correct
2 Correct 471 ms 1304 KB Output is correct
3 Correct 923 ms 768 KB Output is correct
4 Correct 650 ms 984 KB Output is correct
5 Correct 585 ms 1140 KB Output is correct
6 Correct 479 ms 1024 KB Output is correct
7 Correct 453 ms 1136 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 2 ms 768 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 442 ms 912 KB Output is correct
2 Correct 540 ms 1160 KB Output is correct
3 Correct 844 ms 980 KB Output is correct
4 Correct 647 ms 896 KB Output is correct
5 Correct 615 ms 984 KB Output is correct
6 Correct 452 ms 896 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 551 ms 1104 KB Output is correct
2 Correct 454 ms 1104 KB Output is correct
3 Correct 871 ms 768 KB Output is correct
4 Correct 662 ms 976 KB Output is correct
5 Correct 646 ms 768 KB Output is correct
6 Correct 489 ms 1116 KB Output is correct
7 Correct 459 ms 1132 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 673 ms 980 KB Output is correct
12 Correct 476 ms 1232 KB Output is correct
13 Correct 475 ms 1144 KB Output is correct
14 Correct 456 ms 896 KB Output is correct
15 Correct 65 ms 972 KB Output is correct
16 Correct 68 ms 948 KB Output is correct
17 Correct 115 ms 1168 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1045 ms 984 KB Output is correct
2 Correct 760 ms 896 KB Output is correct
3 Correct 680 ms 984 KB Output is correct
4 Correct 3 ms 984 KB Output is correct
5 Correct 4 ms 984 KB Output is correct
6 Correct 2 ms 908 KB Output is correct
7 Correct 645 ms 768 KB Output is correct
8 Correct 1125 ms 1168 KB Output is correct
9 Correct 718 ms 980 KB Output is correct
10 Correct 641 ms 1160 KB Output is correct
11 Correct 6 ms 984 KB Output is correct
12 Correct 5 ms 896 KB Output is correct
13 Correct 6 ms 1024 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 513 ms 1056 KB Output is correct
17 Correct 625 ms 1160 KB Output is correct
18 Correct 565 ms 1024 KB Output is correct
19 Correct 586 ms 1024 KB Output is correct
20 Correct 521 ms 1168 KB Output is correct

Subtask #5
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 556 ms 1024 KB Output is correct
2 Correct 583 ms 1116 KB Output is correct
3 Correct 1097 ms 980 KB Output is correct
4 Correct 747 ms 768 KB Output is correct
5 Correct 601 ms 992 KB Output is correct
6 Correct 594 ms 1108 KB Output is correct
7 Correct 458 ms 896 KB Output is correct
8 Correct 3 ms 996 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 457 ms 768 KB Output is correct
12 Correct 549 ms 928 KB Output is correct
13 Correct 888 ms 984 KB Output is correct
14 Correct 691 ms 976 KB Output is correct
15 Correct 585 ms 896 KB Output is correct
16 Correct 451 ms 896 KB Output is correct
17 Correct 605 ms 896 KB Output is correct
18 Correct 451 ms 1248 KB Output is correct
19 Correct 466 ms 1108 KB Output is correct
20 Correct 444 ms 896 KB Output is correct
21 Correct 56 ms 980 KB Output is correct
22 Correct 74 ms 936 KB Output is correct
23 Correct 99 ms 912 KB Output is correct
24 Correct 5 ms 768 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 3 ms 988 KB Output is correct
28 Correct 2 ms 832 KB Output is correct
29 Correct 518 ms 768 KB Output is correct
30 Correct 510 ms 980 KB Output is correct
31 Correct 525 ms 984 KB Output is correct
32 Correct 502 ms 980 KB Output is correct
33 Correct 488 ms 1168 KB Output is correct
34 Correct 329 ms 1280 KB Output is correct
35 Correct 413 ms 1100 KB Output is correct
36 Correct 463 ms 1120 KB Output is correct
37 Correct 464 ms 1124 KB Output is correct
38 Correct 448 ms 1136 KB Output is correct
39 Correct 459 ms 1124 KB Output is correct
40 Correct 484 ms 1132 KB Output is correct
41 Correct 561 ms 1264 KB Output is correct
42 Correct 79 ms 1052 KB Output is correct
43 Correct 134 ms 768 KB Output is correct
44 Correct 178 ms 1148 KB Output is correct
45 Correct 216 ms 1024 KB Output is correct
46 Correct 405 ms 912 KB Output is correct
47 Correct 325 ms 1172 KB Output is correct
48 Correct 62 ms 1128 KB Output is correct
49 Correct 79 ms 1308 KB Output is correct