Submission #1068777

#TimeUsernameProblemLanguageResultExecution timeMemory
1068777ArapakTruck Driver (IOI23_deliveries)C++17
8 / 100
68 ms10324 KiB
// Author: Kajetan Ramsza #include "deliveries.h" #include "bits/stdc++.h" using namespace std; #define rep(i,a,b) for(int i=(a);i<(b);++i) #define all(x) begin(x), end(x) #define sz(x) (int)x.size() typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> pii; #ifdef DEBUG auto& operator<<(auto &os, const pair<auto, auto> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; } auto& operator<<(auto &os, const auto &v) { os<<"{"; for(auto it=begin(v);it!=end(v);++it) { if(it!=begin(v)) os<<", "; os<<(*it); } return os<<"}"; } void dbg_out(auto... x) { ((cerr<<' '<<x), ...) << endl; } #define dbg(x...) cerr<<"("<<#x<<"):", dbg_out(x); #else #define dbg(...) #endif int n; ll dist; vi w; void init(int N, vi U, vi V, vi T, vi W) { n = N; dist = T[0]; w = W; } ll max_time(int S, int X) { w[S] = X; return (ll)min(w[0]+1, w[1]) * dist * 2; }
#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...