oj.uz

Submission #404345

# Submission time Handle Problem Language Result Execution time Memory
404345 2021-05-14T08:36:05 Z AmineWeslati Cigle (COI21_cigle) C++14
100 / 100
 417 ms 196548 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 = 1e9;
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/////////////////////////

const int MX=5e3+10;
int N; 

/*vector<vi>t(MX,vi(MX*4,0));

void upd(int idx, int i, int v, int pos=1, int l=0, int r=N-1){
	if(l==r){
		t[idx][pos]=v;
		return; 
	}

	int m=(l+r)/2;
	if(i<=m) upd(idx,i,v,pos*2,l,m);
	else upd(idx,i,v,pos*2+1,m+1,r);

	t[idx][pos]=max(t[idx][pos*2],t[idx][pos*2+1]);
}

int get(int idx, int l, int r, int pos=1, int tl=0, int tr=N-1){
	if(l>r) return 0;
	if(l==tl && r==tr) return t[idx][pos];

	int tm=(tl+tr)/2;
	return max( get(idx,l,min(r,tm),pos*2,tl,tm), 
		get(idx,max(l,tm+1),r,pos*2+1,tm+1,tr));
}*/

int main() {
    boost; IO();

    cin>>N;
    vi a(N);
    FOR(i,0,N) cin>>a[i];

    vector<vi>dp(N,vi(N,0)),pref(N,vi(N,0));

    FOR(l,1,N){
    	int l2=l,cur=0,prev=0,v=0;
    	FOR(r,l,N){
    		cur+=a[r];

    		while(l2 && prev<cur-a[r]){
    			l2--;
    			prev+=a[l2];
    		}
    		if(l2 && prev==cur-a[r]){
    			if(prev) v++;
    			l2--; 
    			prev+=a[l2];
    		}

    		dp[l][r]=pref[l-1][l2]+v;
    		if(l!=r) ckmax(dp[l][r],dp[l][r-1]);

    		ckmax(pref[r][l],dp[l][r]);

    		//upd(r,l,dp[l][r]);
    	}

    	int rgt=l;
    	FOR(lft,0,rgt+1){
    		pref[rgt][lft]=dp[lft][rgt];
    		if(lft) ckmax(pref[rgt][lft],pref[rgt][lft-1]);
    	}

    }

    int ans=0;
    FOR(i,0,N) ckmax(ans,dp[i][N-1]);
    cout << ans << endl;

    

    return 0;
}
//Change your approach

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2252 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 3 ms 2252 KB Output is correct
4 Correct 4 ms 2252 KB Output is correct
5 Correct 3 ms 2252 KB Output is correct
6 Correct 4 ms 2252 KB Output is correct
7 Correct 3 ms 2252 KB Output is correct
8 Correct 4 ms 2252 KB Output is correct
9 Correct 4 ms 2252 KB Output is correct
10 Correct 3 ms 2252 KB Output is correct
11 Correct 4 ms 2252 KB Output is correct
12 Correct 3 ms 2236 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 2252 KB Output is correct
22 Correct 3 ms 2252 KB Output is correct
23 Correct 3 ms 2252 KB Output is correct
24 Correct 4 ms 2252 KB Output is correct
25 Correct 3 ms 2252 KB Output is correct
26 Correct 4 ms 2252 KB Output is correct
27 Correct 3 ms 2252 KB Output is correct
28 Correct 4 ms 2252 KB Output is correct
29 Correct 4 ms 2252 KB Output is correct
30 Correct 3 ms 2252 KB Output is correct
31 Correct 4 ms 2252 KB Output is correct
32 Correct 3 ms 2236 KB Output is correct
33 Correct 3 ms 2252 KB Output is correct
34 Correct 3 ms 2252 KB Output is correct
35 Correct 3 ms 2252 KB Output is correct
36 Correct 3 ms 2240 KB Output is correct
37 Correct 3 ms 2252 KB Output is correct
38 Correct 4 ms 2252 KB Output is correct
39 Correct 4 ms 2252 KB Output is correct
40 Correct 3 ms 2244 KB Output is correct
41 Correct 4 ms 2252 KB Output is correct
42 Correct 4 ms 2252 KB Output is correct
43 Correct 3 ms 2252 KB Output is correct
44 Correct 4 ms 2252 KB Output is correct
45 Correct 4 ms 2252 KB Output is correct
46 Correct 3 ms 2252 KB Output is correct
47 Correct 3 ms 2252 KB Output is correct
48 Correct 3 ms 2252 KB Output is correct
49 Correct 4 ms 2252 KB Output is correct

Subtask #5
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 2252 KB Output is correct
22 Correct 3 ms 2252 KB Output is correct
23 Correct 3 ms 2252 KB Output is correct
24 Correct 4 ms 2252 KB Output is correct
25 Correct 3 ms 2252 KB Output is correct
26 Correct 4 ms 2252 KB Output is correct
27 Correct 3 ms 2252 KB Output is correct
28 Correct 4 ms 2252 KB Output is correct
29 Correct 4 ms 2252 KB Output is correct
30 Correct 3 ms 2252 KB Output is correct
31 Correct 4 ms 2252 KB Output is correct
32 Correct 3 ms 2236 KB Output is correct
33 Correct 3 ms 2252 KB Output is correct
34 Correct 3 ms 2252 KB Output is correct
35 Correct 3 ms 2252 KB Output is correct
36 Correct 3 ms 2240 KB Output is correct
37 Correct 3 ms 2252 KB Output is correct
38 Correct 4 ms 2252 KB Output is correct
39 Correct 4 ms 2252 KB Output is correct
40 Correct 3 ms 2244 KB Output is correct
41 Correct 4 ms 2252 KB Output is correct
42 Correct 4 ms 2252 KB Output is correct
43 Correct 3 ms 2252 KB Output is correct
44 Correct 4 ms 2252 KB Output is correct
45 Correct 4 ms 2252 KB Output is correct
46 Correct 3 ms 2252 KB Output is correct
47 Correct 3 ms 2252 KB Output is correct
48 Correct 3 ms 2252 KB Output is correct
49 Correct 4 ms 2252 KB Output is correct
50 Correct 392 ms 196420 KB Output is correct
51 Correct 356 ms 196436 KB Output is correct
52 Correct 373 ms 196432 KB Output is correct
53 Correct 385 ms 196436 KB Output is correct
54 Correct 357 ms 196436 KB Output is correct
55 Correct 357 ms 196548 KB Output is correct
56 Correct 413 ms 196432 KB Output is correct
57 Correct 417 ms 196428 KB Output is correct
58 Correct 395 ms 196364 KB Output is correct
59 Correct 388 ms 196440 KB Output is correct
60 Correct 409 ms 196444 KB Output is correct
61 Correct 408 ms 196448 KB Output is correct
62 Correct 384 ms 196496 KB Output is correct
63 Correct 369 ms 196440 KB Output is correct
64 Correct 380 ms 196444 KB Output is correct
65 Correct 366 ms 196440 KB Output is correct
66 Correct 368 ms 196444 KB Output is correct
67 Correct 380 ms 196548 KB Output is correct
68 Correct 389 ms 196440 KB Output is correct
69 Correct 379 ms 196464 KB Output is correct
70 Correct 392 ms 196444 KB Output is correct
71 Correct 400 ms 196412 KB Output is correct
72 Correct 384 ms 196440 KB Output is correct