oj.uz

Submission #1081684

# Submission time Handle Problem Language Result Execution time Memory
1081684 2024-08-30T09:11:38 Z GrindMachine Stations (IOI20_stations) C++17
73.3618 / 100
 677 ms 1016 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]*2+1;
		}
		else{
			ans[i] = tin[i]*2;
		}
	}

	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 = (s&1);
	s >>= 1, t >>= 1;
	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>>1);
			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>>1), tout = pv-1;
			if(tin <= t and t <= tout){
				return x;
			}
			pv = tin;
		}

		return p;
	}

	assert(0);
	return -1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Invalid labels (values out of range). scenario=2, k=1000, vertex=1, label=3981
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 344 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=2045
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 376 ms 684 KB Output is correct
2 Correct 324 ms 688 KB Output is correct
3 Correct 633 ms 684 KB Output is correct
4 Correct 474 ms 684 KB Output is correct
5 Correct 399 ms 684 KB Output is correct
6 Correct 327 ms 684 KB Output is correct
7 Correct 284 ms 684 KB Output is correct
8 Correct 1 ms 776 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 0 ms 776 KB Output is correct
11 Correct 460 ms 684 KB Output is correct
12 Correct 324 ms 768 KB Output is correct
13 Correct 327 ms 760 KB Output is correct
14 Correct 327 ms 684 KB Output is correct
15 Correct 28 ms 768 KB Output is correct
16 Correct 46 ms 688 KB Output is correct
17 Correct 64 ms 716 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 635 ms 684 KB Output is correct
2 Correct 481 ms 684 KB Output is correct
3 Correct 432 ms 684 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 2 ms 776 KB Output is correct
6 Correct 1 ms 776 KB Output is correct
7 Correct 471 ms 684 KB Output is correct
8 Correct 611 ms 684 KB Output is correct
9 Correct 483 ms 684 KB Output is correct
10 Correct 426 ms 684 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 3 ms 776 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 0 ms 768 KB Output is correct
16 Correct 336 ms 760 KB Output is correct
17 Correct 380 ms 684 KB Output is correct
18 Correct 360 ms 940 KB Output is correct
19 Correct 357 ms 700 KB Output is correct
20 Correct 336 ms 684 KB Output is correct

Subtask #5
47.3618 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 371 ms 680 KB Partially correct
2 Partially correct 326 ms 688 KB Partially correct
3 Correct 677 ms 684 KB Output is correct
4 Correct 459 ms 684 KB Output is correct
5 Correct 418 ms 684 KB Output is correct
6 Partially correct 354 ms 908 KB Partially correct
7 Partially correct 331 ms 684 KB Partially correct
8 Correct 1 ms 776 KB Output is correct
9 Correct 2 ms 772 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Partially correct 359 ms 684 KB Partially correct
12 Partially correct 414 ms 684 KB Partially correct
13 Correct 666 ms 684 KB Output is correct
14 Correct 491 ms 684 KB Output is correct
15 Correct 436 ms 712 KB Output is correct
16 Partially correct 300 ms 684 KB Partially correct
17 Correct 432 ms 684 KB Output is correct
18 Partially correct 316 ms 768 KB Partially correct
19 Partially correct 322 ms 1012 KB Partially correct
20 Partially correct 309 ms 684 KB Partially correct
21 Correct 27 ms 768 KB Output is correct
22 Partially correct 41 ms 772 KB Partially correct
23 Partially correct 69 ms 716 KB Partially correct
24 Correct 4 ms 764 KB Output is correct
25 Correct 3 ms 776 KB Output is correct
26 Correct 3 ms 764 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 357 ms 684 KB Output is correct
30 Correct 341 ms 936 KB Output is correct
31 Correct 365 ms 684 KB Output is correct
32 Correct 362 ms 684 KB Output is correct
33 Correct 356 ms 684 KB Output is correct
34 Partially correct 236 ms 684 KB Partially correct
35 Partially correct 283 ms 684 KB Partially correct
36 Partially correct 294 ms 756 KB Partially correct
37 Partially correct 302 ms 932 KB Partially correct
38 Partially correct 326 ms 768 KB Partially correct
39 Partially correct 316 ms 760 KB Partially correct
40 Partially correct 318 ms 932 KB Partially correct
41 Partially correct 296 ms 1016 KB Partially correct
42 Partially correct 35 ms 768 KB Partially correct
43 Partially correct 65 ms 716 KB Partially correct
44 Partially correct 87 ms 760 KB Partially correct
45 Partially correct 106 ms 684 KB Partially correct
46 Partially correct 208 ms 684 KB Partially correct
47 Partially correct 203 ms 688 KB Partially correct
48 Partially correct 43 ms 744 KB Partially correct
49 Partially correct 28 ms 880 KB Partially correct