oj.uz

답안 #1080172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080172 2024-08-29T07:44:08 Z Faisal_Saqib 기지국 (IOI20_stations) C++17
52.3205 / 100
 658 ms 1056 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+100;
const int M=1e3;
vector<int> ma[N];
int tin[N],tout[N],timer=-1;
void dfs(int v, int p)
{
    tin[v] = ++timer; // n

    for (auto u:ma[v]) {
        if (u != p)
            dfs(u, v);
    }

    tout[v] = timer; // n
}
bool is_ancestor(int u, int v)
{
	int tn=u/M;
	int tot=u%M;
	int tn1=v/M;
	int tot1=v%M;
    return tn <= tn1 && tot >= tot1;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	timer=-1;
	for(int i=0;i<(n);i++)ma[i].clear();
	vector<int> labels(n,0);
	for(int i=0;i<(n-1);i++)
	{
		ma[u[i]].push_back(v[i]);
		ma[v[i]].push_back(u[i]);
	}
	dfs(0,-1);
	for(int i=0;i<n;i++)
		labels[i]=(tin[i]*M)+tout[i];
	return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
	if(is_ancestor(s,t))
	{
		for(auto k:c)
		{
			if(is_ancestor(s,k) and is_ancestor(k,t)){
				return k;
			}
		}
	}
	for(auto k:c)
		if(is_ancestor(k,s))
			return k;
	return -1;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 684 KB Output is correct
2 Correct 308 ms 684 KB Output is correct
3 Correct 654 ms 684 KB Output is correct
4 Correct 455 ms 684 KB Output is correct
5 Correct 419 ms 684 KB Output is correct
6 Correct 304 ms 684 KB Output is correct
7 Correct 305 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 0 ms 780 KB Output is correct
11 Correct 418 ms 684 KB Output is correct
12 Correct 300 ms 932 KB Output is correct
13 Correct 332 ms 684 KB Output is correct
14 Correct 337 ms 684 KB Output is correct
15 Correct 28 ms 768 KB Output is correct
16 Correct 41 ms 768 KB Output is correct
17 Correct 56 ms 716 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 616 ms 684 KB Output is correct
2 Correct 430 ms 688 KB Output is correct
3 Correct 343 ms 684 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 764 KB Output is correct
7 Correct 343 ms 800 KB Output is correct
8 Correct 607 ms 684 KB Output is correct
9 Correct 465 ms 684 KB Output is correct
10 Correct 389 ms 684 KB Output is correct
11 Correct 2 ms 776 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 1 ms 776 KB Output is correct
15 Correct 1 ms 780 KB Output is correct
16 Correct 344 ms 684 KB Output is correct
17 Correct 326 ms 684 KB Output is correct
18 Correct 376 ms 696 KB Output is correct
19 Correct 326 ms 684 KB Output is correct
20 Correct 303 ms 684 KB Output is correct

Subtask #5
26.3205 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 373 ms 688 KB Partially correct
2 Partially correct 306 ms 684 KB Partially correct
3 Partially correct 638 ms 684 KB Partially correct
4 Partially correct 473 ms 684 KB Partially correct
5 Partially correct 398 ms 684 KB Partially correct
6 Partially correct 306 ms 684 KB Partially correct
7 Partially correct 317 ms 684 KB Partially correct
8 Partially correct 2 ms 768 KB Partially correct
9 Partially correct 1 ms 780 KB Partially correct
10 Partially correct 0 ms 768 KB Partially correct
11 Partially correct 294 ms 684 KB Partially correct
12 Partially correct 365 ms 684 KB Partially correct
13 Partially correct 658 ms 684 KB Partially correct
14 Partially correct 448 ms 684 KB Partially correct
15 Partially correct 423 ms 684 KB Partially correct
16 Partially correct 333 ms 684 KB Partially correct
17 Partially correct 396 ms 684 KB Partially correct
18 Partially correct 347 ms 932 KB Partially correct
19 Partially correct 328 ms 796 KB Partially correct
20 Partially correct 311 ms 684 KB Partially correct
21 Partially correct 35 ms 768 KB Partially correct
22 Partially correct 32 ms 764 KB Partially correct
23 Partially correct 70 ms 968 KB Partially correct
24 Partially correct 4 ms 776 KB Partially correct
25 Partially correct 3 ms 768 KB Partially correct
26 Partially correct 3 ms 776 KB Partially correct
27 Partially correct 1 ms 768 KB Partially correct
28 Partially correct 0 ms 768 KB Partially correct
29 Partially correct 337 ms 684 KB Partially correct
30 Partially correct 364 ms 684 KB Partially correct
31 Partially correct 353 ms 684 KB Partially correct
32 Partially correct 315 ms 684 KB Partially correct
33 Partially correct 361 ms 684 KB Partially correct
34 Partially correct 198 ms 684 KB Partially correct
35 Partially correct 269 ms 796 KB Partially correct
36 Partially correct 307 ms 792 KB Partially correct
37 Partially correct 328 ms 684 KB Partially correct
38 Partially correct 338 ms 796 KB Partially correct
39 Partially correct 313 ms 1048 KB Partially correct
40 Partially correct 355 ms 1056 KB Partially correct
41 Partially correct 305 ms 800 KB Partially correct
42 Partially correct 44 ms 768 KB Partially correct
43 Partially correct 61 ms 716 KB Partially correct
44 Partially correct 80 ms 740 KB Partially correct
45 Partially correct 107 ms 684 KB Partially correct
46 Partially correct 158 ms 684 KB Partially correct
47 Partially correct 224 ms 684 KB Partially correct
48 Partially correct 35 ms 684 KB Partially correct
49 Partially correct 32 ms 760 KB Partially correct