oj.uz

Submission #417650

# Submission time Handle Problem Language Result Execution time Memory
417650 2021-06-04T05:54:29 Z lakshith_ Stations (IOI20_stations) C++14
0 / 100
 794 ms 540 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout << "checker reached " << a < "\n"

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 max(c[0],c[1]);
	else
		return min(c[0],c[1]);
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 540 KB Output is correct
2 Incorrect 653 ms 400 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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