oj.uz

Submission #1073550

# Submission time Handle Problem Language Result Execution time Memory
1073550 2024-08-24T16:02:04 Z allin27x Stations (IOI20_stations) C++17
8 / 100
 654 ms 688 KB 
#include <bits/stdc++.h>
using namespace std;
#include "stations.h"
#include <vector>

const int N = 1001;
vector<int> adj[N];

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for (int i=0; i<n; i++) adj[i].clear();
	std::vector<int> labels(n);
	for (int i=0; i<n-1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	for (int i=0; i<n; i++) labels[i] = i;
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (s>t) return (s-1)/2;
	while ((t-1)/2 > s) t = (t-1)/2;
	if ((t-1)/2 == s) return t;
	return (s-1)/2;
}

Subtask #1
0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 684 KB Output is correct
2 Correct 381 ms 684 KB Output is correct
3 Correct 585 ms 684 KB Output is correct
4 Correct 496 ms 684 KB Output is correct
5 Correct 405 ms 684 KB Output is correct
6 Correct 302 ms 688 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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