제출 #1280442

#제출 시각아이디문제언어결과실행 시간메모리
1280442trandangquangLong Distance Coach (JOI17_coach)C++20
71 / 100
3 ms584 KiB
#include<bits/stdc++.h> using namespace std; #define foru(i,a,b) for(int i=(a); i<=(b); ++i) #define ford(i,a,b) for(int i=(a); i>=(b); --i) #define rep(i,a) for(int i=0; i<(a); ++i) #define sz(a) (int)(a).size() #define all(a) (a).begin(),(a).end() #define bit(s,i) (((s)>>(i))&1) #define ii pair<int,int> #define fi first #define se second #define pb push_back #define int long long #define eb emplace_back #define ll long long template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;} template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;} const int N=2025; int x,n,m,w,t; ll s[N],dp[N]; ii pas[N]; int can[N]; void solve(){ cin>>x>>n>>m>>w>>t; foru(i,1,n) cin>>s[i]; foru(i,1,m) cin>>pas[i].fi>>pas[i].se; sort(pas+1, pas+1+m); s[++n]=x; memset(can,-1,sizeof(can)); foru(i,1,n){ int l=lower_bound(pas+1, pas+1+m, ii(s[i]%t,0)) - pas - 1; if(can[l]==-1) can[l]=s[i]/t; else mini(can[l], s[i]/t); } memset(dp,0x3f,sizeof(dp)); dp[0]=1LL*(x/t+1)*w; foru(i,1,m){ if(can[i]!=-1){ ll cost=0; ford(j,i,1){ cost+=pas[j].se + 1LL*w*can[i]; mini(dp[i],dp[j-1]+cost); } } mini(dp[i], dp[i-1]+1LL*w*((x-pas[i].fi)/t+1)); } cout<<dp[m]<<'\n'; } int32_t main(){ #define task "test" if(fopen(task".inp","r")){ freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } cin.tie(0)->sync_with_stdio(0); int tc=1; //cin>>tc; rep(_,tc){ solve(); } }

컴파일 시 표준 에러 (stderr) 메시지

coach.cpp: In function 'int32_t main()':
coach.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
coach.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(task".out","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...