oj.uz

답안 #1080167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080167 2024-08-29T07:37:50 Z Faisal_Saqib 기지국 (IOI20_stations) C++17
31.0422 / 100
 645 ms 1452 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+100;
const int M=2e3;
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=14014
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=0, label=1991
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 578 ms 684 KB Output is correct
2 Correct 455 ms 684 KB Output is correct
3 Correct 452 ms 704 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 0 ms 772 KB Output is correct
7 Correct 385 ms 684 KB Output is correct
8 Correct 628 ms 684 KB Output is correct
9 Correct 459 ms 684 KB Output is correct
10 Correct 408 ms 684 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 2 ms 764 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 1 ms 764 KB Output is correct
16 Correct 314 ms 684 KB Output is correct
17 Correct 379 ms 712 KB Output is correct
18 Correct 359 ms 684 KB Output is correct
19 Correct 398 ms 684 KB Output is correct
20 Correct 279 ms 684 KB Output is correct

Subtask #5
21.0422 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 356 ms 712 KB Partially correct
2 Partially correct 317 ms 684 KB Partially correct
3 Partially correct 601 ms 688 KB Partially correct
4 Partially correct 447 ms 684 KB Partially correct
5 Partially correct 391 ms 684 KB Partially correct
6 Partially correct 368 ms 684 KB Partially correct
7 Partially correct 348 ms 684 KB Partially correct
8 Partially correct 1 ms 768 KB Partially correct
9 Partially correct 3 ms 1100 KB Partially correct
10 Partially correct 0 ms 768 KB Partially correct
11 Partially correct 302 ms 1452 KB Partially correct
12 Partially correct 359 ms 700 KB Partially correct
13 Partially correct 645 ms 684 KB Partially correct
14 Partially correct 468 ms 684 KB Partially correct
15 Partially correct 427 ms 684 KB Partially correct
16 Partially correct 315 ms 684 KB Partially correct
17 Partially correct 421 ms 684 KB Partially correct
18 Partially correct 346 ms 792 KB Partially correct
19 Partially correct 306 ms 940 KB Partially correct
20 Partially correct 261 ms 684 KB Partially correct
21 Partially correct 46 ms 868 KB Partially correct
22 Partially correct 38 ms 760 KB Partially correct
23 Partially correct 65 ms 688 KB Partially correct
24 Partially correct 2 ms 776 KB Partially correct
25 Partially correct 4 ms 764 KB Partially correct
26 Partially correct 2 ms 764 KB Partially correct
27 Partially correct 2 ms 764 KB Partially correct
28 Partially correct 1 ms 768 KB Partially correct
29 Partially correct 321 ms 844 KB Partially correct
30 Partially correct 344 ms 684 KB Partially correct
31 Partially correct 359 ms 684 KB Partially correct
32 Partially correct 306 ms 684 KB Partially correct
33 Partially correct 346 ms 684 KB Partially correct
34 Partially correct 213 ms 684 KB Partially correct
35 Partially correct 324 ms 1180 KB Partially correct
36 Partially correct 313 ms 684 KB Partially correct
37 Partially correct 338 ms 792 KB Partially correct
38 Partially correct 379 ms 684 KB Partially correct
39 Partially correct 345 ms 932 KB Partially correct
40 Partially correct 312 ms 1048 KB Partially correct
41 Partially correct 324 ms 812 KB Partially correct
42 Partially correct 44 ms 768 KB Partially correct
43 Partially correct 69 ms 716 KB Partially correct
44 Partially correct 108 ms 684 KB Partially correct
45 Partially correct 114 ms 916 KB Partially correct
46 Partially correct 207 ms 684 KB Partially correct
47 Partially correct 206 ms 684 KB Partially correct
48 Partially correct 44 ms 824 KB Partially correct
49 Partially correct 41 ms 864 KB Partially correct