oj.uz

Submission #1080177

# Submission time Handle Problem Language Result Execution time Memory
1080177 2024-08-29T07:47:24 Z Faisal_Saqib Stations (IOI20_stations) C++17
52.3244 / 100
 663 ms 1048 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 + 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]
	for(int i=0;i<n;i++)
		labels[i]=(tin[i]*M)+(tout[i]-tin[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

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

Subtask #2
0 / 8.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 804 KB Output is correct
2 Correct 306 ms 888 KB Output is correct
3 Correct 555 ms 684 KB Output is correct
4 Correct 467 ms 684 KB Output is correct
5 Correct 416 ms 684 KB Output is correct
6 Correct 321 ms 684 KB Output is correct
7 Correct 334 ms 684 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 776 KB Output is correct
11 Correct 439 ms 684 KB Output is correct
12 Correct 324 ms 1048 KB Output is correct
13 Correct 329 ms 684 KB Output is correct
14 Correct 316 ms 684 KB Output is correct
15 Correct 42 ms 764 KB Output is correct
16 Correct 34 ms 776 KB Output is correct
17 Correct 64 ms 684 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 663 ms 684 KB Output is correct
2 Correct 470 ms 684 KB Output is correct
3 Correct 377 ms 684 KB Output is correct
4 Correct 2 ms 776 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 1 ms 776 KB Output is correct
7 Correct 428 ms 804 KB Output is correct
8 Correct 635 ms 940 KB Output is correct
9 Correct 424 ms 684 KB Output is correct
10 Correct 397 ms 684 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 3 ms 764 KB Output is correct
14 Correct 2 ms 764 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 334 ms 684 KB Output is correct
17 Correct 369 ms 684 KB Output is correct
18 Correct 338 ms 684 KB Output is correct
19 Correct 340 ms 684 KB Output is correct
20 Correct 332 ms 684 KB Output is correct

Subtask #5
26.3244 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 374 ms 684 KB Partially correct
2 Partially correct 336 ms 684 KB Partially correct
3 Correct 616 ms 684 KB Output is correct
4 Partially correct 509 ms 684 KB Partially correct
5 Partially correct 419 ms 684 KB Partially correct
6 Partially correct 327 ms 688 KB Partially correct
7 Partially correct 323 ms 852 KB Partially correct
8 Partially correct 2 ms 768 KB Partially correct
9 Partially correct 2 ms 768 KB Partially correct
10 Partially correct 0 ms 768 KB Partially correct
11 Partially correct 303 ms 860 KB Partially correct
12 Partially correct 407 ms 684 KB Partially correct
13 Correct 612 ms 684 KB Output is correct
14 Partially correct 454 ms 684 KB Partially correct
15 Partially correct 424 ms 684 KB Partially correct
16 Partially correct 323 ms 684 KB Partially correct
17 Partially correct 437 ms 684 KB Partially correct
18 Partially correct 345 ms 796 KB Partially correct
19 Partially correct 324 ms 1044 KB Partially correct
20 Partially correct 329 ms 684 KB Partially correct
21 Partially correct 30 ms 768 KB Partially correct
22 Partially correct 36 ms 684 KB Partially correct
23 Partially correct 86 ms 940 KB Partially correct
24 Partially correct 2 ms 768 KB Partially correct
25 Partially correct 4 ms 768 KB Partially correct
26 Partially correct 2 ms 768 KB Partially correct
27 Partially correct 1 ms 768 KB Partially correct
28 Partially correct 1 ms 768 KB Partially correct
29 Partially correct 319 ms 688 KB Partially correct
30 Partially correct 349 ms 688 KB Partially correct
31 Partially correct 403 ms 684 KB Partially correct
32 Partially correct 371 ms 684 KB Partially correct
33 Partially correct 373 ms 684 KB Partially correct
34 Partially correct 229 ms 684 KB Partially correct
35 Partially correct 316 ms 684 KB Partially correct
36 Partially correct 314 ms 800 KB Partially correct
37 Partially correct 351 ms 812 KB Partially correct
38 Partially correct 295 ms 796 KB Partially correct
39 Partially correct 303 ms 804 KB Partially correct
40 Partially correct 316 ms 800 KB Partially correct
41 Partially correct 330 ms 796 KB Partially correct
42 Partially correct 31 ms 768 KB Partially correct
43 Partially correct 56 ms 764 KB Partially correct
44 Partially correct 84 ms 716 KB Partially correct
45 Partially correct 99 ms 684 KB Partially correct
46 Partially correct 240 ms 684 KB Partially correct
47 Partially correct 239 ms 684 KB Partially correct
48 Partially correct 30 ms 684 KB Partially correct
49 Partially correct 30 ms 764 KB Partially correct