Submission #1054682

#TimeUsernameProblemLanguageResultExecution timeMemory
1054682LittleOrangeStations (IOI20_stations)C++17
0 / 100
476 ms768 KiB
#include "stations.h" #include <vector> #include<bits/stdc++.h> using namespace std; using ll = int; 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) { s++;t++; ll lgs = __lg(s), lgt = __lg(t); if (lgs<lgt){ ll x = s<<(lgt-lgs); if ((x&t)==x){ return t>>(lgt-lgs-1); } } return s>>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...