Submission #980904

#TimeUsernameProblemLanguageResultExecution timeMemory
980904hoclnFun Tour (APIO20_fun)C++17
26 / 100
83 ms13568 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include "fun.h" using namespace __gnu_pbds; using namespace std; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define all(v) v.begin(), v.end() #define logg(x) (31 - __builtin_clz(x)) #define llogg(x) (63 - __builtin_clzll(x)) #define mini(v) min_element(v.begin(), v.end()) #define maxi(v) max_element(v.begin(), v.end()) #define TIME cerr << double(clock() - st) / (double)CLOCKS_PER_SEC #define sq(a) ((a)*(a)) #ifdef hocln #include "deb.h" #else #define imie(...) "" #define debug() cerr #endif typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; typedef long double ld; typedef tuple<ll, ll, ll> triple; typedef tuple<ll, ll, ll, ll, ll> five; typedef unsigned long long ull; const long long INF = 4e18; const int inf = 2e9; const int MN = 3e5 + 15; const int MX = 2e6 + 15; //const long long MOD = 1e9 + 7; const long long MOD = 998244353; const long double PI = 3.141592653589793238462643383279502884197; template<typename T, typename T2> bool chmax(T& a, const T2& b) { return a < b ? a = b, 1 : 0; } template<typename T, typename T2> bool chmin(T& a, const T2& b) { return a > b ? a = b, 1 : 0; } template<typename T> using vector2 = vector<vector<T>>; const int dx[] = { 0, 0, 1, -1, 1, 1, -1, -1 }; const int dy[] = { 1, -1, 0, 0 , 1, -1, 1, -1}; std::random_device rd; std::mt19937 gen(rd()); ll random(ll low, ll high) { uniform_int_distribution<> dist(low, high); return dist(gen); } template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p) { is >> p.first; return is >> p.second; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (auto &i: v) os << i << ' '; return os; } int tc = 0; vector<int> createFunTour(int n, int q) { //int H = hoursRequired(0, N - 1); //int A = attractionsBehind(0, N - 1); int mx = 0, f = -1; for(int i = 1;i < n;i++) { if(chmax(mx,hoursRequired(0,i))) f = i; } vector<int>st{f}; vector<bool>vis(n); vis[f] = true; while(st.size() != n) { mx = f = -1; for(int i = 0;i < n;i++) { if(vis[i]) continue; if(chmax(mx, hoursRequired(st.back(),i))) f = i; } st.push_back(f); vis[f] = true; } return st; }

Compilation message (stderr)

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:63:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |  while(st.size() != n) {
      |        ~~~~~~~~~~^~~~
#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...