oj.uz

Submission #360260

# Submission time Handle Problem Language Result Execution time Memory
360260 2021-01-28T00:19:17 Z AmineWeslati Semiexpress (JOI17_semiexpress) C++14
48 / 100
 64 ms 66012 KB 
//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;
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/////////////////////////


ll N,M,K,A,B,C,T;
vi S(MX);
int vis[MX][MX],memo[MX][MX];

int f[MX][MX];

int mxx[MX];

ll fs(ll mx){
	return mx/A+1;
}

void precompute(){ //vis[i][n]
	FOR(i,0,M-1){
		int l=S[i],r=S[i+1],nb=0,cur=l,ans=0; 
		ll 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+1){ //K+1?
			ll x=fs(rest);

			if(cur+x>r) x=r-cur;
			if(C*x>rest){
				ans+=x-1;
				if(cur==l) vis[i][0]+=x-1;
				break;
			}

			if(cur!=r) vis[i][nb]+=min((ll)r-cur-1,rest/A);

			cur+=x; ans+=x-(cur==r);
			nb+=(cur!=r);
			rest-=C*x;
			vis[i][nb]=ans;
		}
		FOR(j,nb+1,K+1) vis[i][j]=vis[i][j-1];
		FOR(j,0,K+1){
			vis[i][j]+=((r-1)*B<=T);
		} 

		FOR(j,0,K+1){
			f[i][j]=vis[i][j];
			if(j) f[i][j]-=vis[i][j-1];
		}
	}
}

int solve(int i, int r){
	vi v;
	int ans=0;
	FOR(i,0,M-1){
		FOR(j,1,K+1) v.pb(f[i][j]);
		ans+=f[i][0];
	}
	sort(rall(v));
	FOR(i,0,min((ll)sz(v),K)) ans+=v[i];

	return ans;
}

int 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

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 35948 KB Output is correct
2 Correct 21 ms 35948 KB Output is correct
3 Correct 22 ms 36460 KB Output is correct
4 Correct 20 ms 35820 KB Output is correct
5 Correct 22 ms 35948 KB Output is correct
6 Correct 23 ms 36076 KB Output is correct
7 Correct 20 ms 35948 KB Output is correct
8 Correct 20 ms 36076 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 35948 KB Output is correct
2 Correct 21 ms 35948 KB Output is correct
3 Correct 22 ms 36460 KB Output is correct
4 Correct 20 ms 35820 KB Output is correct
5 Correct 22 ms 35948 KB Output is correct
6 Correct 23 ms 36076 KB Output is correct
7 Correct 20 ms 35948 KB Output is correct
8 Correct 20 ms 36076 KB Output is correct
9 Correct 21 ms 35968 KB Output is correct
10 Correct 20 ms 35948 KB Output is correct
11 Correct 20 ms 35948 KB Output is correct
12 Correct 20 ms 36076 KB Output is correct
13 Correct 21 ms 36076 KB Output is correct
14 Correct 20 ms 36076 KB Output is correct
15 Correct 20 ms 35948 KB Output is correct
16 Correct 20 ms 36076 KB Output is correct
17 Correct 20 ms 35948 KB Output is correct
18 Correct 20 ms 36076 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 35948 KB Output is correct
2 Correct 21 ms 35948 KB Output is correct
3 Correct 22 ms 36460 KB Output is correct
4 Correct 20 ms 35820 KB Output is correct
5 Correct 22 ms 35948 KB Output is correct
6 Correct 23 ms 36076 KB Output is correct
7 Correct 20 ms 35948 KB Output is correct
8 Correct 20 ms 36076 KB Output is correct
9 Correct 21 ms 35968 KB Output is correct
10 Correct 20 ms 35948 KB Output is correct
11 Correct 20 ms 35948 KB Output is correct
12 Correct 20 ms 36076 KB Output is correct
13 Correct 21 ms 36076 KB Output is correct
14 Correct 20 ms 36076 KB Output is correct
15 Correct 20 ms 35948 KB Output is correct
16 Correct 20 ms 36076 KB Output is correct
17 Correct 20 ms 35948 KB Output is correct
18 Correct 20 ms 36076 KB Output is correct
19 Correct 40 ms 50144 KB Output is correct
20 Correct 57 ms 57052 KB Output is correct
21 Correct 27 ms 41580 KB Output is correct
22 Correct 30 ms 45032 KB Output is correct
23 Correct 64 ms 66012 KB Output is correct
24 Correct 26 ms 45804 KB Output is correct
25 Correct 30 ms 39916 KB Output is correct
26 Incorrect 28 ms 51692 KB Output isn't correct
27 Halted 0 ms 0 KB -