Submission #417649

#TimeUsernameProblemLanguageResultExecution timeMemory
417649lakshith_Stations (IOI20_stations)C++14
0 / 100
816 ms528 KiB
#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]); }
#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...