oj.uz

답안 #1080261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080261 2024-08-29T08:25:43 Z Faisal_Saqib 기지국 (IOI20_stations) C++17
10 / 100
 594 ms 1280 KB 
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int N=1e3+100;
const int M=1e3-1;
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)
{
	if(u==0)
		return 1;
	if(v==0)
		return 0;
	int tn=u/M;
	int tot=u%M + tn;
	int tn1=v/M;
	int tot1=v%M + tn1;
    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);
	// tout[i] >= tin[i]
	// tout[i]-tin[i] == sz[i]
	// 1<= sz[i] <=n
	for(int i=0;i<n;i++)
		labels[i]=((tin[i]-1)*M)+(tout[i]-tin[i]+1);
	labels[0]=0;
	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 2 ms 344 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=4999
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 359 ms 688 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 594 ms 684 KB Output is correct
2 Correct 433 ms 684 KB Output is correct
3 Correct 418 ms 684 KB Output is correct
4 Correct 1 ms 1016 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 0 ms 768 KB Output is correct
7 Correct 405 ms 684 KB Output is correct
8 Correct 544 ms 684 KB Output is correct
9 Correct 458 ms 684 KB Output is correct
10 Correct 412 ms 684 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 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 1280 KB Output is correct
16 Correct 401 ms 684 KB Output is correct
17 Correct 304 ms 688 KB Output is correct
18 Correct 364 ms 684 KB Output is correct
19 Correct 377 ms 684 KB Output is correct
20 Correct 357 ms 684 KB Output is correct

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 391 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -