Submission #306091

#TimeUsernameProblemLanguageResultExecution timeMemory
306091SorahISAStations (IOI20_stations)C++17
0 / 100
851 ms884 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
    
	for (int i = 0; i < n; ++i) {
		labels[i] = i;
	}
    
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    return s > t ? c.front() : c.back();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...