Submission #359295

#TimeUsernameProblemLanguageResultExecution timeMemory
359295AmineWeslatiSemiexpress (JOI17_semiexpress)C++14
18 / 100
45 ms71660 KiB
//Never stop trying #include "bits/stdc++.h" using namespace std; #define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) typedef long long ll; #define int ll typedef string str; typedef long double ld; typedef pair<int, int> pi; #define fi first #define se second typedef vector<int> vi; typedef vector<pi> vpi; #define pb push_back #define eb emplace_back #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define endl "\n" #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) const int MOD = 1e9 + 7; //998244353 const ll INF = 1e18; const int MX = 3000 + 10; const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up template<class T> using V = vector<T>; template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up //constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x)) mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); //mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); ll random(ll a, ll b){ return a + rng() % (b - a + 1); } #ifndef LOCAL #define cerr if(false) cerr #endif #define dbg(x) cerr << #x << " : " << x << endl; #define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl; #define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl; #define here() cerr << "here" << endl; void IO() { #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } /////////////////////////ONLY CLEAN CODES ALLOWED///////////////////////// int N,M,K,A,B,C,T; vi S(MX); int vis[MX][MX],memo[MX][MX]; int bs(int mx){ int l=0,r=1e9; int x; while(l<=r){ int m=(l+r)/2; if(m*A>mx){ x=m; r=m-1; } else l=m+1; } return x; } void precompute(){ //vis[i][n] FOR(i,0,M-1){ int l=S[i],r=S[i+1]; int nb=0,cur=l,ans=0,rest=T-(l-1)*B; FOR(j,0,K+1) vis[i][j]=0; if(rest<0) continue; while(rest>0 && cur!=r && nb<K){ int x=bs(rest); if(l==111) dbg(x) if(cur+x>r) x=r-cur; if(C*x>rest){ x--; } cur+=x; ans+=x-(cur==r); nb+=(cur!=r); rest-=C*x; vis[i][nb]=ans; if(cur!=r) vis[i][nb]+=min(r-cur-1,rest/A); } FOR(j,nb+1,K+1) vis[i][j]=ans; FOR(j,0,K+1){ vis[i][j]+=((r-1)*B<=T); } if(l==111) dbg(vis[i][K]) //dbg(ans) } } int solve(int i, int r){ if(i==M-1 || (S[i]-1)*B>T) return 0; int &ind=memo[i][r]; if(ind!=-1) return ind; int ans=0; FOR(j,0,r+1) ckmax(ans,solve(i+1,r-j)+vis[i][j]); return ind=ans; } int32_t main() { boost; IO(); cin>>N>>M>>K>>A>>B>>C>>T; K-=M; FOR(i,0,M) cin>>S[i]; precompute(); memset(memo,-1,sizeof(memo)); cout << solve(0,K) << endl; return 0; } //Change your approach

Compilation message (stderr)

semiexpress.cpp: In function 'll bs(ll)':
semiexpress.cpp:72:9: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |  return x;
      |         ^
semiexpress.cpp: In function 'void precompute()':
semiexpress.cpp:90:10: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   90 |    if(cur+x>r) x=r-cur;
      |       ~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...