oj.uz

Submission #1076611

# Submission time Handle Problem Language Result Execution time Memory
1076611 2024-08-26T14:59:30 Z mindiyak Stations (IOI20_stations) C++14
0 / 100
 585 ms 936 KB 
#include "stations.h"
#include <vector>
#include <queue>

using namespace std;


std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	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(s<(t-1)/2)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 341 ms 684 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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