oj.uz

답안 #308728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308728 2020-10-01T18:27:49 Z silverfish 기지국 (IOI20_stations) C++17
100 / 100
 965 ms 1368 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;
		for(int i = 1; i < len; i++){
			if(t < c[i] && t >= c[i-1]) return c[i-1];
		}
		return c[len-1];
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 1024 KB Output is correct
2 Correct 427 ms 1096 KB Output is correct
3 Correct 901 ms 992 KB Output is correct
4 Correct 750 ms 1024 KB Output is correct
5 Correct 579 ms 984 KB Output is correct
6 Correct 525 ms 1108 KB Output is correct
7 Correct 442 ms 1132 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 1 ms 768 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 439 ms 896 KB Output is correct
2 Correct 616 ms 768 KB Output is correct
3 Correct 965 ms 976 KB Output is correct
4 Correct 760 ms 992 KB Output is correct
5 Correct 612 ms 980 KB Output is correct
6 Correct 425 ms 924 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 555 ms 1104 KB Output is correct
2 Correct 445 ms 1104 KB Output is correct
3 Correct 862 ms 768 KB Output is correct
4 Correct 678 ms 980 KB Output is correct
5 Correct 557 ms 1168 KB Output is correct
6 Correct 437 ms 1116 KB Output is correct
7 Correct 450 ms 1024 KB Output is correct
8 Correct 3 ms 992 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 2 ms 992 KB Output is correct
11 Correct 593 ms 980 KB Output is correct
12 Correct 487 ms 1112 KB Output is correct
13 Correct 473 ms 1120 KB Output is correct
14 Correct 432 ms 924 KB Output is correct
15 Correct 59 ms 976 KB Output is correct
16 Correct 72 ms 936 KB Output is correct
17 Correct 100 ms 1368 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 893 ms 980 KB Output is correct
2 Correct 653 ms 1024 KB Output is correct
3 Correct 558 ms 1024 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 5 ms 996 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 600 ms 984 KB Output is correct
8 Correct 844 ms 984 KB Output is correct
9 Correct 592 ms 1044 KB Output is correct
10 Correct 609 ms 972 KB Output is correct
11 Correct 6 ms 980 KB Output is correct
12 Correct 5 ms 768 KB Output is correct
13 Correct 4 ms 768 KB Output is correct
14 Correct 4 ms 992 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 446 ms 896 KB Output is correct
17 Correct 439 ms 896 KB Output is correct
18 Correct 522 ms 976 KB Output is correct
19 Correct 506 ms 768 KB Output is correct
20 Correct 528 ms 896 KB Output is correct

Subtask #5
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 1336 KB Output is correct
2 Correct 457 ms 1024 KB Output is correct
3 Correct 922 ms 1296 KB Output is correct
4 Correct 659 ms 984 KB Output is correct
5 Correct 642 ms 1112 KB Output is correct
6 Correct 572 ms 1104 KB Output is correct
7 Correct 451 ms 1024 KB Output is correct
8 Correct 3 ms 976 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 482 ms 768 KB Output is correct
12 Correct 571 ms 920 KB Output is correct
13 Correct 890 ms 1160 KB Output is correct
14 Correct 673 ms 988 KB Output is correct
15 Correct 579 ms 992 KB Output is correct
16 Correct 578 ms 896 KB Output is correct
17 Correct 604 ms 988 KB Output is correct
18 Correct 445 ms 1260 KB Output is correct
19 Correct 447 ms 1104 KB Output is correct
20 Correct 432 ms 932 KB Output is correct
21 Correct 55 ms 980 KB Output is correct
22 Correct 70 ms 768 KB Output is correct
23 Correct 107 ms 900 KB Output is correct
24 Correct 6 ms 992 KB Output is correct
25 Correct 6 ms 1004 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 4 ms 896 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 503 ms 768 KB Output is correct
30 Correct 506 ms 976 KB Output is correct
31 Correct 488 ms 976 KB Output is correct
32 Correct 594 ms 896 KB Output is correct
33 Correct 490 ms 980 KB Output is correct
34 Correct 425 ms 1120 KB Output is correct
35 Correct 426 ms 1212 KB Output is correct
36 Correct 480 ms 1108 KB Output is correct
37 Correct 486 ms 1144 KB Output is correct
38 Correct 490 ms 1024 KB Output is correct
39 Correct 474 ms 1024 KB Output is correct
40 Correct 464 ms 1124 KB Output is correct
41 Correct 636 ms 1024 KB Output is correct
42 Correct 85 ms 932 KB Output is correct
43 Correct 135 ms 896 KB Output is correct
44 Correct 156 ms 1024 KB Output is correct
45 Correct 166 ms 984 KB Output is correct
46 Correct 305 ms 968 KB Output is correct
47 Correct 271 ms 1024 KB Output is correct
48 Correct 57 ms 1136 KB Output is correct
49 Correct 63 ms 1024 KB Output is correct