Submission #306110

#TimeUsernameProblemLanguageResultExecution timeMemory
306110SorahISAStations (IOI20_stations)C++17
8 / 100
1047 ms1012 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> lab(n); iota(ALL(lab), 1); return lab; } int find_next_station(int s, int t, vector<int> c) { if (s > t or s != (t >> __lg(t) - __lg(s))) return s / 2; return c[((t >> __lg(t) - __lg(s) - 1) & 1) + (s != 1)]; }

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:26:37: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   26 |     if (s > t or s != (t >> __lg(t) - __lg(s))) return s / 2;
      |                             ~~~~~~~~^~~~~~~~~
stations.cpp:27:39: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   27 |     return c[((t >> __lg(t) - __lg(s) - 1) & 1) + (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...