oj.uz

Submission #390615

# Submission time Handle Problem Language Result Execution time Memory
390615 2021-04-16T11:57:37 Z AdOjis485 Stations (IOI20_stations) C++14
0 / 100
 1089 ms 784 KB 
#include "stations.h"
#include <vector>
#include <iostream>
using namespace std;

void dfs(int v, int p, int type, int& cur, vector<int>& labels, vector<vector<int> >& adi)
{
	if(type == 0)
	{
		labels[v] = cur;
		cur ++;
	}
	for(int next : adi[v])
	{
		if(next == p) continue;
		dfs(next, v, !type, cur, labels, adi);
	}
	if(type == 1)
	{
		labels[v] = cur;
		cur ++;
	}
	//cerr << v << " " << labels[v] << '\n';
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n, -1);
	vector<vector<int> > adi(n);
	for(int i = 0; i < n - 1; i ++)
	{
		adi[u[i]].push_back(v[i]);
		adi[v[i]].push_back(u[i]);
	}
	int cur = 0;
	dfs(0, -1, 0, cur, labels, adi);
	return labels;
}

int find_next_station(int s, int t, vector<int> c)
{
	int ans;
	if(c[0] > s)
	{
		int lo = -1, hi = c.size() - 1;
		while(lo + 1 < hi)
		{
			int m = (hi + lo) / 2;
			if(c[m] >= t) hi = m;
			else lo = m;
		}
		ans = hi;
	}
	else
	{
		int lo = 0, hi = c.size();
		while(lo + 1 < hi)
		{
			int m = (hi + lo) / 2;
			if(c[m] > t) hi = m;
			else lo = m;
		}
		ans = lo;
	}
	return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 572 ms 596 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 468 ms 492 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 664 ms 528 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1089 ms 400 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 570 ms 784 KB Wrong query response.
2 Halted 0 ms 0 KB -