oj.uz

Submission #1081694

# Submission time Handle Problem Language Result Execution time Memory
1081694 2024-08-30T09:18:54 Z GrindMachine Stations (IOI20_stations) C++17
100 / 100
 664 ms 1028 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define pb push_back
#define endl '\n'
#define conts continue
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &x, T y){
	x = min(x,y);
}

template<typename T>
void amax(T &x, T y){
	x = max(x,y);
}

template<typename A,typename B>
string to_string(pair<A,B> p);

string to_string(const string &s){
	return "'"+s+"'";
}

string to_string(const char* s){
	return to_string((string)s);
}

string to_string(bool b){
	return b?"true":"false";
}

template<typename A>
string to_string(A v){
	string res = "{";
	trav(x,v){
		res += to_string(x)+",";
	}
	if(res.back() == ',') res.pop_back();
	res += "}";
	return res;
}

template<typename A,typename B>
string to_string(pair<A,B> p){
	return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}

#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;

#include "stations.h"

std::vector<int> label(int n, int k, std::vector<int> U, std::vector<int> V) {
	vector<vector<int>> adj(n);
	rep(i,n-1){
		int u = U[i], v = V[i];
		adj[u].pb(v), adj[v].pb(u);
	}

	vector<int> tin(n), tout(n), subsiz(n), depth(n);
	int timer = 0;

	auto dfs1 = [&](int u, int p, auto &&dfs1) -> void{
		tin[u] = timer++;
		subsiz[u] = 1;
		trav(v,adj[u]){
			if(v == p) conts;
			depth[v] = depth[u]+1;
			dfs1(v,u,dfs1);
			subsiz[u] += subsiz[v];
		}
		tout[u] = timer++;
	};

	dfs1(0,-1,dfs1);

	vector<int> ans(n);
	rep(i,n){
		if(depth[i]&1){
			ans[i] = tout[i];
		}
		else{
			ans[i] = tin[i];
		}
	}

	auto b = ans;
	sort(all(b));
	rep(i,n) ans[i] = lower_bound(all(b),ans[i])-b.begin();

	return ans;

	// std::vector<int> labels(n);
	// for (int i = 0; i < n; i++) {
	// 	labels[i] = i;
	// }
	// return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int typ = 1;
	trav(x,c){
		if(s < x){
			typ = 0;
			break;
		}
	}

	int p = -1;

	if(!typ){
		// tin
		if(s){
			p = c.back();
			c.pop_back();
		}

		int pv = s;
		trav(x,c){
			int tin = pv+1, tout = x;
			if(tin <= t and t <= tout){
				return x;
			}
			pv = tout;
		}

		return p;
	}
	else{
		// tout
		p = c[0];
		c.erase(c.begin());

		reverse(all(c));
		int pv = s;

		trav(x,c){
			int tin = x, tout = pv-1;
			if(tin <= t and t <= tout){
				return x;
			}
			pv = tin;
		}

		return p;
	}

	assert(0);
	return -1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 684 KB Output is correct
2 Correct 321 ms 684 KB Output is correct
3 Correct 664 ms 684 KB Output is correct
4 Correct 466 ms 684 KB Output is correct
5 Correct 402 ms 684 KB Output is correct
6 Correct 303 ms 684 KB Output is correct
7 Correct 305 ms 684 KB Output is correct
8 Correct 1 ms 772 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 0 ms 776 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 688 KB Output is correct
2 Correct 378 ms 684 KB Output is correct
3 Correct 626 ms 684 KB Output is correct
4 Correct 467 ms 684 KB Output is correct
5 Correct 404 ms 684 KB Output is correct
6 Correct 287 ms 684 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 684 KB Output is correct
2 Correct 326 ms 684 KB Output is correct
3 Correct 571 ms 688 KB Output is correct
4 Correct 400 ms 684 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Correct 263 ms 684 KB Output is correct
7 Correct 261 ms 684 KB Output is correct
8 Correct 1 ms 776 KB Output is correct
9 Correct 1 ms 772 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Correct 418 ms 684 KB Output is correct
12 Correct 314 ms 764 KB Output is correct
13 Correct 305 ms 684 KB Output is correct
14 Correct 281 ms 684 KB Output is correct
15 Correct 28 ms 768 KB Output is correct
16 Correct 44 ms 744 KB Output is correct
17 Correct 62 ms 716 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 600 ms 684 KB Output is correct
2 Correct 432 ms 940 KB Output is correct
3 Correct 423 ms 684 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 412 ms 688 KB Output is correct
8 Correct 569 ms 684 KB Output is correct
9 Correct 476 ms 684 KB Output is correct
10 Correct 360 ms 688 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 3 ms 776 KB Output is correct
13 Correct 2 ms 776 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 0 ms 768 KB Output is correct
16 Correct 331 ms 684 KB Output is correct
17 Correct 343 ms 684 KB Output is correct
18 Correct 331 ms 684 KB Output is correct
19 Correct 330 ms 684 KB Output is correct
20 Correct 339 ms 684 KB Output is correct

Subtask #5
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 684 KB Output is correct
2 Correct 322 ms 684 KB Output is correct
3 Correct 594 ms 684 KB Output is correct
4 Correct 460 ms 688 KB Output is correct
5 Correct 416 ms 684 KB Output is correct
6 Correct 321 ms 904 KB Output is correct
7 Correct 356 ms 684 KB Output is correct
8 Correct 2 ms 1016 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 0 ms 776 KB Output is correct
11 Correct 296 ms 684 KB Output is correct
12 Correct 366 ms 684 KB Output is correct
13 Correct 650 ms 684 KB Output is correct
14 Correct 452 ms 684 KB Output is correct
15 Correct 387 ms 684 KB Output is correct
16 Correct 328 ms 684 KB Output is correct
17 Correct 394 ms 684 KB Output is correct
18 Correct 333 ms 684 KB Output is correct
19 Correct 337 ms 760 KB Output is correct
20 Correct 290 ms 684 KB Output is correct
21 Correct 29 ms 764 KB Output is correct
22 Correct 36 ms 764 KB Output is correct
23 Correct 68 ms 728 KB Output is correct
24 Correct 3 ms 776 KB Output is correct
25 Correct 3 ms 776 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 0 ms 768 KB Output is correct
29 Correct 365 ms 688 KB Output is correct
30 Correct 356 ms 684 KB Output is correct
31 Correct 341 ms 684 KB Output is correct
32 Correct 369 ms 684 KB Output is correct
33 Correct 352 ms 936 KB Output is correct
34 Correct 236 ms 940 KB Output is correct
35 Correct 277 ms 780 KB Output is correct
36 Correct 323 ms 940 KB Output is correct
37 Correct 323 ms 764 KB Output is correct
38 Correct 307 ms 760 KB Output is correct
39 Correct 324 ms 768 KB Output is correct
40 Correct 302 ms 940 KB Output is correct
41 Correct 314 ms 1028 KB Output is correct
42 Correct 35 ms 768 KB Output is correct
43 Correct 64 ms 716 KB Output is correct
44 Correct 79 ms 768 KB Output is correct
45 Correct 108 ms 684 KB Output is correct
46 Correct 227 ms 684 KB Output is correct
47 Correct 202 ms 684 KB Output is correct
48 Correct 31 ms 684 KB Output is correct
49 Correct 29 ms 976 KB Output is correct