oj.uz

Submission #977341

# Submission time Handle Problem Language Result Execution time Memory
977341 2024-05-07T18:44:08 Z aykhn Stations (IOI20_stations) C++17
0 / 100
 647 ms 948 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 1e3 + 5;

int in[MXN], out[MXN], tim = -1;
vector<int> adj[MXN];
vector<int> labels;

void dfs(int a, int p, int w)
{
	in[a] = ++tim;
	for (int v : adj[a])
	{
		if (v == p) continue;
		dfs(v, a, w ^ 1);
	}
	out[a] = ++tim;
	if (w & 1) labels[a] = in[a];
	else labels[a] = out[a];
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) 
{
	tim = -1;
	for (int i = 0; i < n; i++)
	{
		in[i] = out[i] = 0;
		adj[i].clear();
	}
	for (int i = 0; i < n - 1; i++) adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
	labels.assign(n, 0);
	dfs(0, 0, 0);
	return labels;
}

int find_next_station(int s, int t, vector<int> c)
{
	for (int x : c) if (x == t) return t;
	if (s == 0) 
	{
		reverse(c.begin(), c.end());
		for (int x : c) if (x <= t) return x;
	}
	int sz = c.size();
	if (sz  == 1) return c[0];
	else if (s < c[0])
	{
		if (!(s + 1 <= t && t <= c[sz - 2])) return c[sz - 1];
		c.pop_back();
		for (int x : c) if (t <= x) return x;
	}
	else
	{
		if (!(c[0] + 2 <= t && t <= s - 1)) return c[0];
		c.erase(c.begin());
		reverse(c.begin(), c.end());
		for (int x : c) if (x <= t) return x;
	}
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
   62 | }
      | ^

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 647 ms 684 KB Output is correct
2 Correct 452 ms 684 KB Output is correct
3 Incorrect 372 ms 684 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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