Submission #704636

#TimeUsernameProblemLanguageResultExecution timeMemory
704636Alihan_8선물상자 (IOI15_boxes)C++17
100 / 100
635 ms333064 KiB
#include <bits/stdc++.h> // include <ext/pb_ds/assoc_container.hpp> // include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make_pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} //#define int long long long long delivery(int n, int k, int L, int P[]){ vector <int> p; for ( int i = 0; i < n; i++ ){ if ( !P[i] ) continue; p.pb(P[i]); } n = (int)p.size(); vector <long long> pref(n+1), suff(n+2); for ( int i = 1; i <= n; i++ ){ pref[i] = pref[max(0, i-k)]+p[i-1]*2; } for ( auto &i: p ) i = L-i; for ( int i = n; i > 0; i-- ){ suff[i] = suff[min(n+1, i+k)]+p[i-1]*2; } long long Mn = 1e18; for ( int i = 0; i <= n; i++ ){ Mn = min(Mn, pref[i]+suff[i+1]); Mn = min(Mn, pref[i]+L+suff[min(n+1, i+k+1)]); } return Mn; } #if false signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, L; cin >> n >> k >> L; int p[n]; for ( int i = 0; i < n; i++ ) cin >> p[i]; cout << delivery(n, k, L, p); cout << '\n'; /* 3 2 8 1 2 5 answer : 10 */ } #endif

Compilation message (stderr)

boxes.cpp: In function 'void IO(std::string)':
boxes.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...