Submission #485763

#TimeUsernameProblemLanguageResultExecution timeMemory
485763MilosMilutinovicSemiexpress (JOI17_semiexpress)C++14
100 / 100
12 ms4540 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define SZ(x) ((int)(x).size()) typedef vector<int> VI; typedef long long ll; typedef pair<int,int> PII; typedef double db; mt19937 mrand(random_device{}()); const ll mod=1000000007; const ll mod2=998244353; int rnd(int x) { return mrand() % x;} ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;} // head const int N=3010; ll n,m,k,a,b,c,t,s[N]; int main() { scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&m,&k,&a,&b,&c,&t); rep(i,1,m+1) scanf("%lld",s+i),--s[i]; vector<ll> v; ll ans=0; rep(i,1,m) { ll pos=s[i]; rep(j,0,k-m+1) { if (pos==s[i+1]||b*s[i]+c*(pos-s[i])>t) break; ll tm=t-b*s[i]-c*(pos-s[i]),nxt=min(s[i+1],pos+tm/a+1); if (pos==s[i]) ans+=nxt-pos; else v.pb(nxt-pos); pos=nxt; } } if (b*s[m]<=t) ans++; sort(all(v)); reverse(all(v)); rep(i,0,min((int)(k-m),SZ(v))) ans+=v[i]; printf("%lld",ans-1); }

Compilation message (stderr)

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&m,&k,&a,&b,&c,&t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:28:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  rep(i,1,m+1) scanf("%lld",s+i),--s[i];
      |               ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...