oj.uz

답안 #397840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
397840 2021-05-03T08:55:57 Z cfalas 기지국 (IOI20_stations) C++14
36.234 / 100
 1099 ms 776 KB 
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

vector<vi> adj;
vi labels;
int cnt=0;
vi sub;
void dfs(int s, int p=-1){
	labels[s] = cnt++;
	for(auto v : adj[s]) if(v!=p) dfs(v, s), sub[s]+=sub[v];
}

vi label(int n, int k, std::vector<int> u, std::vector<int> v) {
	cnt = 0;
	adj.assign(n, vi());
	sub.assign(n, 1);
	labels.assign(n, 0);
	FOR(i,n-1){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0);
	//FOR(i,n) cout<<labels[i]<<" "<<sub[i]<<endl;
	FOR(i,n) labels[i] = (labels[i]<<10) + sub[i];

	//FOA(v, labels) cout<<v<<" "; cout<<endl;

	return labels;
}

int get_s(int x){ return x & ((1<<10)-1); }

int find_next_station(int s, int t, std::vector<int> c) {
	//cout<<s<<" "<<t<<endl;
	int lt = t>>10;
	int ls = s>>10;

	int prev = ls;
	FOA(x, c){
		if((x>>10)<ls) continue;
		int xs = get_s(x);
		if(prev<lt && lt<=prev+xs) return x;
		prev+=xs;
	}
	//cout<<s<<" "<<get_s(s)<<endl;
	return *min_element(c.begin(), c.end());

}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 416 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=6148
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 296 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1535
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 448 KB Invalid labels (values out of range). scenario=1, k=1000000, vertex=67, label=1006606
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1099 ms 400 KB Output is correct
2 Correct 944 ms 476 KB Output is correct
3 Correct 735 ms 488 KB Output is correct
4 Correct 3 ms 472 KB Output is correct
5 Correct 5 ms 452 KB Output is correct
6 Correct 2 ms 472 KB Output is correct
7 Correct 656 ms 492 KB Output is correct
8 Correct 1010 ms 400 KB Output is correct
9 Correct 692 ms 400 KB Output is correct
10 Correct 687 ms 408 KB Output is correct
11 Correct 7 ms 468 KB Output is correct
12 Correct 7 ms 476 KB Output is correct
13 Correct 6 ms 472 KB Output is correct
14 Correct 5 ms 472 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 659 ms 564 KB Output is correct
17 Correct 640 ms 492 KB Output is correct
18 Correct 620 ms 472 KB Output is correct
19 Correct 791 ms 400 KB Output is correct
20 Correct 610 ms 400 KB Output is correct

Subtask #5
26.234 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 552 ms 656 KB Partially correct
2 Partially correct 527 ms 620 KB Partially correct
3 Partially correct 994 ms 400 KB Partially correct
4 Partially correct 727 ms 404 KB Partially correct
5 Partially correct 660 ms 528 KB Partially correct
6 Partially correct 684 ms 548 KB Partially correct
7 Partially correct 487 ms 528 KB Partially correct
8 Partially correct 3 ms 472 KB Partially correct
9 Partially correct 5 ms 472 KB Partially correct
10 Partially correct 2 ms 472 KB Partially correct
11 Partially correct 622 ms 528 KB Partially correct
12 Partially correct 620 ms 532 KB Partially correct
13 Partially correct 888 ms 404 KB Partially correct
14 Partially correct 847 ms 400 KB Partially correct
15 Partially correct 700 ms 400 KB Partially correct
16 Partially correct 549 ms 528 KB Partially correct
17 Partially correct 642 ms 400 KB Partially correct
18 Partially correct 541 ms 608 KB Partially correct
19 Partially correct 445 ms 632 KB Partially correct
20 Partially correct 415 ms 520 KB Partially correct
21 Partially correct 75 ms 404 KB Partially correct
22 Partially correct 78 ms 556 KB Partially correct
23 Partially correct 98 ms 496 KB Partially correct
24 Partially correct 7 ms 432 KB Partially correct
25 Partially correct 5 ms 472 KB Partially correct
26 Partially correct 6 ms 472 KB Partially correct
27 Partially correct 6 ms 472 KB Partially correct
28 Partially correct 2 ms 472 KB Partially correct
29 Partially correct 550 ms 400 KB Partially correct
30 Partially correct 519 ms 400 KB Partially correct
31 Partially correct 558 ms 400 KB Partially correct
32 Partially correct 509 ms 400 KB Partially correct
33 Partially correct 607 ms 400 KB Partially correct
34 Partially correct 354 ms 644 KB Partially correct
35 Partially correct 402 ms 528 KB Partially correct
36 Partially correct 487 ms 776 KB Partially correct
37 Partially correct 604 ms 628 KB Partially correct
38 Partially correct 516 ms 624 KB Partially correct
39 Partially correct 531 ms 604 KB Partially correct
40 Partially correct 501 ms 616 KB Partially correct
41 Partially correct 504 ms 612 KB Partially correct
42 Partially correct 81 ms 528 KB Partially correct
43 Partially correct 107 ms 548 KB Partially correct
44 Partially correct 173 ms 544 KB Partially correct
45 Partially correct 162 ms 544 KB Partially correct
46 Partially correct 361 ms 528 KB Partially correct
47 Partially correct 315 ms 528 KB Partially correct
48 Partially correct 53 ms 588 KB Partially correct
49 Partially correct 79 ms 672 KB Partially correct