oj.uz

Submission #430199

# Submission time Handle Problem Language Result Execution time Memory
430199 2021-06-16T12:01:41 Z APROHACK Stations (IOI20_stations) C++14
0 / 100
 3000 ms 2097156 KB 
#include "stations.h"
#include <bits/stdc++.h>
#include <vector>
#define PB push_back
using namespace std;
vector<int>ady[1001];
int lab[1001];
int cur = 0;
int dfs(int node, int parent){
	for(auto i:ady[node]){
		if(i==parent)continue;
		dfs(i, node);
	}
	lab[node]=cur++;
	return 1;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int>ab;
	for(int i = 0 ; i < n-1 ; i++){
		ady[u[i]].PB(v[i]);
		ady[v[i]].PB(u[i]);
	}
	dfs(0, -1);
	for(int i = 0 ; i <= n-1 ; i++){
		ab.PB(lab[i]);
		//cout<<lab[i]<<" ";
	}
	return ab;
}

int find_next_station(int s, int t, std::vector<int> c) {
	vector<int>::iterator ll = lower_bound(c.begin(), c.end(), t);

	if(ll!=c.end())return c[(ll-c.begin())];
	else return c[c.size()-1];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2397 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3017 ms 416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 2122 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1341 ms 544 KB Output is correct
2 Runtime error 1603 ms 2097156 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3167 ms 1514592 KB Time limit exceeded
2 Halted 0 ms 0 KB -