oj.uz

Submission #424044

# Submission time Handle Problem Language Result Execution time Memory
424044 2021-06-11T15:46:02 Z lakshith_ Stations (IOI20_stations) C++14
5 / 100
 1075 ms 736 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout <"checker reached " << a << "\n"

vector<vector<int>> adj(1000,vector<int>());

vector<int> lbl;

void dfs(int u,int p,int d){
	lbl[u]=d++;
	for(int v:adj[u])
		if(v!=p)
			dfs(v,u,d);
}


std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	lbl = vector<int>(n);
	for(int i=0;i<n;i++)
		adj[i] = vector<int>();
	for(int i=0;i<n-1;i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	int src = -1;
	for(int i=0;i<n;i++)
		if(adj[i].size()>2)src = i;
	if(src==-1)
		for(int i=0;i<n;i++)
			if(adj[i].size()==1)src = i;
	lbl[src]=0;
	int d = 1;
	for(int a:adj[src]){
			dfs(a,src,d);
			d+=1000;
	}
	return lbl;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(t==0)return s-1;
	if(s==0)return (t/1000)*1000 + 1;
	if(s/1000==t/1000){
		if(s<t)return s+1;
		else return s-1;
	}else{
		if((s-1)%1000==0)return 0;
		return s-1;
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 620 KB Output is correct
2 Correct 598 ms 500 KB Output is correct
3 Correct 1075 ms 528 KB Output is correct
4 Correct 669 ms 508 KB Output is correct
5 Correct 683 ms 400 KB Output is correct
6 Correct 565 ms 584 KB Output is correct
7 Correct 502 ms 516 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 476 KB Output is correct
10 Correct 1 ms 476 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 316 KB Invalid labels (duplicates values). scenario=0, label=10
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 637 ms 520 KB Output is correct
2 Correct 551 ms 504 KB Output is correct
3 Correct 914 ms 400 KB Output is correct
4 Correct 771 ms 524 KB Output is correct
5 Correct 630 ms 508 KB Output is correct
6 Correct 504 ms 528 KB Output is correct
7 Correct 530 ms 512 KB Output is correct
8 Correct 3 ms 476 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Incorrect 674 ms 588 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 838 ms 508 KB Output is correct
2 Correct 707 ms 584 KB Output is correct
3 Correct 665 ms 512 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Incorrect 740 ms 508 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 585 ms 528 KB Output is correct
2 Correct 519 ms 736 KB Output is correct
3 Correct 1001 ms 400 KB Output is correct
4 Correct 821 ms 512 KB Output is correct
5 Correct 687 ms 400 KB Output is correct
6 Correct 583 ms 520 KB Output is correct
7 Correct 514 ms 528 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 5 ms 476 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Incorrect 5 ms 300 KB Invalid labels (duplicates values). scenario=0, label=10
12 Halted 0 ms 0 KB -