Submission #508790

#TimeUsernameProblemLanguageResultExecution timeMemory
508790silverfishCrocodile's Underground City (IOI11_crocodile)C++17
89 / 100
2068 ms56020 KiB
#include <bits/stdc++.h> #include "crocodile.h" using namespace std; /*<DEBUG>*/ #define tem template <typename #define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i) #define _op debug& operator<< tem C > auto test(C *x) -> decltype(cerr << *x, 0LL); tem C > char test(...); tem C > struct itr{C begin, end; }; tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; } struct debug{ #ifdef _LOCAL ~debug(){ cerr << endl; } tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; } tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); } tem T, typename U > _op (pair<T, U> i){ return *this << "< " << i.first << " , " << i.second << " >"; } tem T> _op (itr<T> i){ *this << "{ "; for(auto it = i.begin; it != i.end; it++){ *this << " , " + (it==i.begin?2:0) << *it; } return *this << " }"; } #else tem T> _op (const T&) { return *this; } #endif }; tem T> string _ARR_(T* arr, int sz){ string ret = "{ " + to_string(arr[0]); for(int i = 1; i < sz; i++) ret += " , " + to_string(arr[i]); ret += " }"; return ret; } #define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]" /*</DEBUG>*/ typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef unsigned int uint; typedef pair<int, int> pii; //mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); #define pb push_back #define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define TC int __TC__; cin >> __TC__; while(__TC__--) #define ar array const int N = 100005, INF = 1000000009; struct edge{ int to, w; }; int block[N], dp[N], vis[N]; vector<edge> adj[N]; int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) { for(int i = 0; i < m; ++i){ adj[r[i][0]].pb({r[i][1], l[i]}); adj[r[i][1]].pb({r[i][0], l[i]}); } fill(dp, dp+n+1, INF); for(int i = 0; i < k; ++i){ vis[p[i]] = 1; dp[p[i]] = 0; } for(int i = 0; i < 2*n; ++i){ for(int u = 0; u < n; ++u){ ar<int,2> mn = {INF, INF}; for(auto [v, w] : adj[u]){ if(dp[v]+w <= mn[0]){ swap(mn[0], mn[1]); mn[0] = dp[v]+w; }else mn[1] = min(mn[1], dp[v]+w); } dp[u] = min(mn[1], dp[u]); } } return dp[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...