oj.uz

Submission #932118

# Submission time Handle Problem Language Result Execution time Memory
932118 2024-02-23T03:15:36 Z Edu175 Sequence (APIO23_sequence) C++17
40 / 100
 2000 ms 59552 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,apio=b;i<apio;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) for(auto slkdh:v)cout<<slkdh<<" ";cout<<"\n"
using namespace std;
typedef int ll;
typedef pair<ll,ll> ii;
const ll C=5e5,MAXN=2*C+5;
#define NEUT 3*C
#define oper min
struct STree{
	vector<ll>t; ll n;
	STree(ll n):t(2*n+5,NEUT),n(n){}
	void upd(ll p, ll v){
		for(p+=n,t[p]=oper(t[p],v);p>1;p>>=1)t[p>>1]=oper(t[p],t[p^1]);
	}
	ll query(ll l, ll r){
		ll res=NEUT;
		for(l+=n,r+=n;l<r;l>>=1,r>>=1){
			if(l&1)res=oper(res,t[l++]);
			if(r&1)res=oper(res,t[--r]);
		}
		return res;
	}
};
ll l[MAXN],r[MAXN];
bool cmp(ll i, ll j){
	return ii({l[i],i})<ii({l[j],j});
}
int sequence(int N, std::vector<int> A) {
	ll n=N;
	vector<ll>a(n);
	fore(i,0,n)a[i]=A[i]-1;
	vector<ll>pos[n];
	fore(i,0,n)pos[a[i]].pb(i);
	vector<ll>s(n);
	fore(i,0,n)s[i]=1;
	ll res=0;
	fore(i,0,n)if(SZ(pos[i])){
		//cout<<"\nin"<<i<<":\n";
		for(auto j:pos[i])s[j]=0;
		//imp(s);
		ll sum=0,rew=0;
		vector<ll>rw(n+1);
		vector<ll>ev{n};
		l[n]=r[n]=rw[n]=0;
		fore(j,0,n){
			sum+=s[j],rew+=a[j]==i;
			rw[j]=rew;
			l[j]=sum-rew,r[j]=sum+rew;
			ev.pb(j);
			//cout<<j<<": "<<sum<<" "<<rew<<"\n";
			//cout<<"add "<<p<<","<<q<<" "<<rew<<"\n";
			//cout<<res<<"\n\n";
		}
		sort(ALL(ev),cmp); reverse(ALL(ev));
		STree st(2*n+5+C);
		for(auto i:ev){
			/*if(i<0){
				cout<<"-1\n";
				st.upd(C,0);
				continue;
			}*/
			//cout<<i<<": "<<l[i]<<","<<r[i]<<": "<<rw[i]<<" - "<<st.query(0,r[i]+C+1)<<" = "<<rw[i]-st.query(0,r[i]+C+1)<<"\n";
			res=max(res,rw[i]-st.query(0,r[i]+C+1));
			st.upd(r[i]+C,rw[i]);
		}
		//cout<<res<<"\n";
		for(auto j:pos[i])s[j]=-1;
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6420 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 4 ms 6436 KB Output is correct
4 Correct 22 ms 6428 KB Output is correct
5 Correct 5 ms 6424 KB Output is correct
6 Correct 3 ms 6424 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 39 ms 6260 KB Output is correct
9 Correct 19 ms 6424 KB Output is correct
10 Correct 22 ms 6420 KB Output is correct
11 Correct 20 ms 6676 KB Output is correct
12 Correct 19 ms 6424 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6420 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 4 ms 6436 KB Output is correct
4 Correct 22 ms 6428 KB Output is correct
5 Correct 5 ms 6424 KB Output is correct
6 Correct 3 ms 6424 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 39 ms 6260 KB Output is correct
9 Correct 19 ms 6424 KB Output is correct
10 Correct 22 ms 6420 KB Output is correct
11 Correct 20 ms 6676 KB Output is correct
12 Correct 19 ms 6424 KB Output is correct
13 Correct 710 ms 6556 KB Output is correct
14 Correct 685 ms 6564 KB Output is correct
15 Correct 26 ms 6488 KB Output is correct
16 Correct 33 ms 6492 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 1226 ms 6840 KB Output is correct
19 Correct 598 ms 6552 KB Output is correct
20 Correct 565 ms 6808 KB Output is correct
21 Correct 583 ms 6488 KB Output is correct
22 Correct 565 ms 6552 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6420 KB Output is correct
2 Execution timed out 2056 ms 53944 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 253 ms 46032 KB Output is correct
3 Correct 257 ms 46840 KB Output is correct
4 Correct 264 ms 46784 KB Output is correct
5 Correct 261 ms 46848 KB Output is correct
6 Correct 250 ms 46876 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2017 ms 59552 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6420 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 4 ms 6436 KB Output is correct
4 Correct 22 ms 6428 KB Output is correct
5 Correct 5 ms 6424 KB Output is correct
6 Correct 3 ms 6424 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 39 ms 6260 KB Output is correct
9 Correct 19 ms 6424 KB Output is correct
10 Correct 22 ms 6420 KB Output is correct
11 Correct 20 ms 6676 KB Output is correct
12 Correct 19 ms 6424 KB Output is correct
13 Correct 710 ms 6556 KB Output is correct
14 Correct 685 ms 6564 KB Output is correct
15 Correct 26 ms 6488 KB Output is correct
16 Correct 33 ms 6492 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 1226 ms 6840 KB Output is correct
19 Correct 598 ms 6552 KB Output is correct
20 Correct 565 ms 6808 KB Output is correct
21 Correct 583 ms 6488 KB Output is correct
22 Correct 565 ms 6552 KB Output is correct
23 Execution timed out 2005 ms 15728 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6420 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 4 ms 6436 KB Output is correct
4 Correct 22 ms 6428 KB Output is correct
5 Correct 5 ms 6424 KB Output is correct
6 Correct 3 ms 6424 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 39 ms 6260 KB Output is correct
9 Correct 19 ms 6424 KB Output is correct
10 Correct 22 ms 6420 KB Output is correct
11 Correct 20 ms 6676 KB Output is correct
12 Correct 19 ms 6424 KB Output is correct
13 Correct 710 ms 6556 KB Output is correct
14 Correct 685 ms 6564 KB Output is correct
15 Correct 26 ms 6488 KB Output is correct
16 Correct 33 ms 6492 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 1226 ms 6840 KB Output is correct
19 Correct 598 ms 6552 KB Output is correct
20 Correct 565 ms 6808 KB Output is correct
21 Correct 583 ms 6488 KB Output is correct
22 Correct 565 ms 6552 KB Output is correct
23 Execution timed out 2056 ms 53944 KB Time limit exceeded
24 Halted 0 ms 0 KB -