oj.uz

답안 #308727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308727 2020-10-01T18:25:04 Z silverfish 기지국 (IOI20_stations) C++17
100 / 100
 1079 ms 1352 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;
		for(int i = 0; i < len-1; i++){
			if(t > c[i] && t <= c[i+1]) return c[i+1];
		}
		return c[0];
	}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 666 ms 1024 KB Output is correct
2 Correct 510 ms 1080 KB Output is correct
3 Correct 900 ms 824 KB Output is correct
4 Correct 786 ms 988 KB Output is correct
5 Correct 640 ms 936 KB Output is correct
6 Correct 558 ms 1024 KB Output is correct
7 Correct 444 ms 936 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 4 ms 976 KB Output is correct
10 Correct 1 ms 896 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 513 ms 1024 KB Output is correct
2 Correct 641 ms 896 KB Output is correct
3 Correct 1043 ms 780 KB Output is correct
4 Correct 738 ms 932 KB Output is correct
5 Correct 752 ms 1000 KB Output is correct
6 Correct 643 ms 896 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 674 ms 1024 KB Output is correct
2 Correct 582 ms 1112 KB Output is correct
3 Correct 986 ms 768 KB Output is correct
4 Correct 805 ms 896 KB Output is correct
5 Correct 701 ms 808 KB Output is correct
6 Correct 681 ms 1032 KB Output is correct
7 Correct 533 ms 1024 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 734 ms 768 KB Output is correct
12 Correct 571 ms 1028 KB Output is correct
13 Correct 562 ms 1080 KB Output is correct
14 Correct 510 ms 936 KB Output is correct
15 Correct 57 ms 896 KB Output is correct
16 Correct 75 ms 896 KB Output is correct
17 Correct 112 ms 1024 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 910 ms 852 KB Output is correct
2 Correct 781 ms 852 KB Output is correct
3 Correct 627 ms 896 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 6 ms 980 KB Output is correct
6 Correct 2 ms 988 KB Output is correct
7 Correct 687 ms 896 KB Output is correct
8 Correct 1079 ms 1024 KB Output is correct
9 Correct 820 ms 896 KB Output is correct
10 Correct 674 ms 896 KB Output is correct
11 Correct 6 ms 984 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct
14 Correct 5 ms 896 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 524 ms 768 KB Output is correct
17 Correct 501 ms 932 KB Output is correct
18 Correct 521 ms 928 KB Output is correct
19 Correct 628 ms 928 KB Output is correct
20 Correct 517 ms 896 KB Output is correct

Subtask #5
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 1016 KB Output is correct
2 Correct 584 ms 932 KB Output is correct
3 Correct 994 ms 976 KB Output is correct
4 Correct 801 ms 816 KB Output is correct
5 Correct 727 ms 984 KB Output is correct
6 Correct 566 ms 1016 KB Output is correct
7 Correct 516 ms 840 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 531 ms 768 KB Output is correct
12 Correct 578 ms 768 KB Output is correct
13 Correct 912 ms 816 KB Output is correct
14 Correct 748 ms 980 KB Output is correct
15 Correct 670 ms 768 KB Output is correct
16 Correct 469 ms 896 KB Output is correct
17 Correct 577 ms 868 KB Output is correct
18 Correct 535 ms 1248 KB Output is correct
19 Correct 509 ms 1216 KB Output is correct
20 Correct 456 ms 768 KB Output is correct
21 Correct 63 ms 980 KB Output is correct
22 Correct 72 ms 936 KB Output is correct
23 Correct 107 ms 912 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 4 ms 896 KB Output is correct
27 Correct 3 ms 976 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 539 ms 768 KB Output is correct
30 Correct 562 ms 984 KB Output is correct
31 Correct 515 ms 768 KB Output is correct
32 Correct 504 ms 1168 KB Output is correct
33 Correct 536 ms 896 KB Output is correct
34 Correct 370 ms 1024 KB Output is correct
35 Correct 539 ms 1220 KB Output is correct
36 Correct 466 ms 1352 KB Output is correct
37 Correct 471 ms 1024 KB Output is correct
38 Correct 507 ms 1260 KB Output is correct
39 Correct 524 ms 1140 KB Output is correct
40 Correct 469 ms 1248 KB Output is correct
41 Correct 553 ms 1024 KB Output is correct
42 Correct 75 ms 768 KB Output is correct
43 Correct 123 ms 896 KB Output is correct
44 Correct 125 ms 1024 KB Output is correct
45 Correct 177 ms 1144 KB Output is correct
46 Correct 376 ms 916 KB Output is correct
47 Correct 339 ms 1144 KB Output is correct
48 Correct 60 ms 1256 KB Output is correct
49 Correct 59 ms 1116 KB Output is correct