oj.uz

Submission #308715

# Submission time Handle Problem Language Result Execution time Memory
308715 2020-10-01T17:55:19 Z silverfish Stations (IOI20_stations) C++14
5 / 100
 973 ms 1280 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;
		if(t > s && t <= c[0]) return c[0];
		for(int i = 1; i < len-1; i++){
			if(t <= c[i] && t > c[i-1]) return c[i];
		}
	}else{
		if(t > s || t < c[1]) return p;
		if(t < s && t >= c[len-1]) return c[len-1];
		for(int i = 1; i < len-1; i++){
			if(t >= c[i] && t > c[i+1]) return c[i];
		}
	}

	assert(0);

	return -1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 552 ms 1104 KB Output is correct
2 Correct 467 ms 1100 KB Output is correct
3 Correct 882 ms 896 KB Output is correct
4 Correct 674 ms 768 KB Output is correct
5 Correct 598 ms 1168 KB Output is correct
6 Correct 477 ms 1120 KB Output is correct
7 Correct 455 ms 1024 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 18 ms 1164 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 1024 KB Output is correct
2 Correct 474 ms 1112 KB Output is correct
3 Correct 973 ms 1056 KB Output is correct
4 Correct 784 ms 980 KB Output is correct
5 Correct 608 ms 1024 KB Output is correct
6 Correct 424 ms 1008 KB Output is correct
7 Correct 533 ms 1024 KB Output is correct
8 Correct 3 ms 984 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 1 ms 984 KB Output is correct
11 Runtime error 3 ms 1280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 844 ms 1104 KB Output is correct
2 Correct 639 ms 896 KB Output is correct
3 Correct 578 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 5 ms 980 KB Output is correct
6 Correct 2 ms 992 KB Output is correct
7 Runtime error 2 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 532 ms 1024 KB Output is correct
2 Correct 443 ms 1024 KB Output is correct
3 Correct 861 ms 1160 KB Output is correct
4 Correct 658 ms 768 KB Output is correct
5 Correct 569 ms 896 KB Output is correct
6 Correct 515 ms 1112 KB Output is correct
7 Correct 538 ms 1148 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Runtime error 7 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -