oj.uz

Submission #308726

# Submission time Handle Problem Language Result Execution time Memory
308726 2020-10-01T18:24:27 Z silverfish Stations (IOI20_stations) C++17
100 / 100
 1240 ms 1312 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

# Verdict Execution time Memory Grader output
1 Correct 573 ms 1024 KB Output is correct
2 Correct 511 ms 1100 KB Output is correct
3 Correct 911 ms 768 KB Output is correct
4 Correct 648 ms 984 KB Output is correct
5 Correct 613 ms 984 KB Output is correct
6 Correct 481 ms 1120 KB Output is correct
7 Correct 518 ms 1144 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 5 ms 780 KB Output is correct
10 Correct 2 ms 896 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 896 KB Output is correct
2 Correct 562 ms 768 KB Output is correct
3 Correct 960 ms 980 KB Output is correct
4 Correct 829 ms 896 KB Output is correct
5 Correct 714 ms 980 KB Output is correct
6 Correct 525 ms 928 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 1264 KB Output is correct
2 Correct 482 ms 1116 KB Output is correct
3 Correct 943 ms 768 KB Output is correct
4 Correct 651 ms 928 KB Output is correct
5 Correct 608 ms 896 KB Output is correct
6 Correct 462 ms 1100 KB Output is correct
7 Correct 460 ms 1268 KB Output is correct
8 Correct 3 ms 984 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 2 ms 984 KB Output is correct
11 Correct 612 ms 768 KB Output is correct
12 Correct 471 ms 1108 KB Output is correct
13 Correct 513 ms 1092 KB Output is correct
14 Correct 537 ms 896 KB Output is correct
15 Correct 54 ms 768 KB Output is correct
16 Correct 85 ms 980 KB Output is correct
17 Correct 133 ms 896 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1075 ms 768 KB Output is correct
2 Correct 832 ms 896 KB Output is correct
3 Correct 630 ms 768 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 5 ms 980 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 605 ms 832 KB Output is correct
8 Correct 980 ms 980 KB Output is correct
9 Correct 730 ms 920 KB Output is correct
10 Correct 755 ms 768 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 5 ms 896 KB Output is correct
14 Correct 5 ms 896 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 622 ms 896 KB Output is correct
17 Correct 638 ms 936 KB Output is correct
18 Correct 554 ms 1024 KB Output is correct
19 Correct 614 ms 896 KB Output is correct
20 Correct 660 ms 976 KB Output is correct

Subtask #5
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 738 ms 1016 KB Output is correct
2 Correct 617 ms 1024 KB Output is correct
3 Correct 1240 ms 896 KB Output is correct
4 Correct 768 ms 848 KB Output is correct
5 Correct 618 ms 768 KB Output is correct
6 Correct 616 ms 1096 KB Output is correct
7 Correct 509 ms 896 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 546 ms 900 KB Output is correct
12 Correct 634 ms 1024 KB Output is correct
13 Correct 1002 ms 896 KB Output is correct
14 Correct 859 ms 1024 KB Output is correct
15 Correct 714 ms 896 KB Output is correct
16 Correct 569 ms 896 KB Output is correct
17 Correct 732 ms 928 KB Output is correct
18 Correct 504 ms 1024 KB Output is correct
19 Correct 584 ms 1056 KB Output is correct
20 Correct 561 ms 1164 KB Output is correct
21 Correct 75 ms 896 KB Output is correct
22 Correct 93 ms 768 KB Output is correct
23 Correct 111 ms 896 KB Output is correct
24 Correct 8 ms 980 KB Output is correct
25 Correct 7 ms 768 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 5 ms 768 KB Output is correct
28 Correct 2 ms 780 KB Output is correct
29 Correct 604 ms 776 KB Output is correct
30 Correct 535 ms 832 KB Output is correct
31 Correct 520 ms 832 KB Output is correct
32 Correct 624 ms 928 KB Output is correct
33 Correct 533 ms 924 KB Output is correct
34 Correct 347 ms 1080 KB Output is correct
35 Correct 475 ms 1024 KB Output is correct
36 Correct 611 ms 1144 KB Output is correct
37 Correct 501 ms 936 KB Output is correct
38 Correct 509 ms 1144 KB Output is correct
39 Correct 496 ms 1312 KB Output is correct
40 Correct 563 ms 1240 KB Output is correct
41 Correct 536 ms 1172 KB Output is correct
42 Correct 65 ms 896 KB Output is correct
43 Correct 110 ms 896 KB Output is correct
44 Correct 161 ms 1288 KB Output is correct
45 Correct 184 ms 1024 KB Output is correct
46 Correct 359 ms 912 KB Output is correct
47 Correct 368 ms 932 KB Output is correct
48 Correct 57 ms 1152 KB Output is correct
49 Correct 59 ms 1024 KB Output is correct