oj.uz

Submission #1009474

# Submission time Handle Problem Language Result Execution time Memory
1009474 2024-06-27T14:52:00 Z pcc Sequence (APIO23_sequence) C++17
40 / 100
 2000 ms 52848 KB 
#include "sequence.h"

#include <vector>
#include <bits/stdc++.h>
#include <bits/extc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
using namespace std;
using namespace __gnu_pbds;

#define pii pair<int,int>
#define fs first
#define sc second

template<typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

const int mxn = 5e5+10;
int cnt[mxn],arr[mxn];
int N,ans;
vector<pii> v;
set<int> st;

struct BIT{
	const static int LEN = 2e6+10;
	int bit[LEN];
	BIT(){}
	void init(){
		fill(bit,bit+LEN,LEN);
	}
	void modify(int p,int v){
		assert(p>0&&p<LEN);
		for(;p<LEN;p+=p&-p)bit[p] = min(bit[p],v);
	}
	int getval(int p){
		int re = LEN;
		assert(p>0&&p<LEN);
		for(;p>0;p-= p&-p)re = min(re,bit[p]);
		return re;
	}
};

namespace CHECK{
	BIT bit;
	int P[mxn],Q[mxn];
	int lp[mxn];
	void CALC(int tar){
		fill(lp,lp+mxn,mxn);
		for(int i = 1;i<=N;i++){
			P[i] = P[i-1],Q[i] = Q[i-1];
			if(arr[i]>tar)P[i]++;
			else if(arr[i]<tar)P[i]--;
			else if(arr[i] == tar)Q[i]++;
		}
		vector<pii> v;
		for(int i = 0;i<=N;i++){
			v.push_back(pii(P[i],i));
		}
		sort(v.begin(),v.end());
		bit.init();
		for(auto [_,now] : v){
			int d = Q[now]-P[now]+mxn;
			lp[now] = min(lp[now],bit.getval(d));
			bit.modify(d,now);
		}
		reverse(v.begin(),v.end());
		bit.init();
		for(auto [_,now] : v){
			int d = P[now]+Q[now]+mxn;
			lp[now] = min(lp[now],bit.getval(d));
			bit.modify(d,now);
		}
		for(int i = 1;i<=N;i++){
			int tl = lp[i];
			if(tl<i)ans = max(ans,Q[i]-Q[tl]);
		}
		return;
	}
}

int sequence(int NN, std::vector<int> AA) {
	N = NN;
	for(int i = 0;i<N;i++)arr[i+1] = AA[i],st.insert(AA[i]);
	ans = 0;
	for(auto &i:st)CHECK::CALC(i);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 4 ms 12892 KB Output is correct
6 Correct 3 ms 12932 KB Output is correct
7 Correct 1 ms 12892 KB Output is correct
8 Correct 33 ms 12892 KB Output is correct
9 Correct 19 ms 12892 KB Output is correct
10 Correct 21 ms 12924 KB Output is correct
11 Correct 19 ms 12892 KB Output is correct
12 Correct 19 ms 12888 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 4 ms 12892 KB Output is correct
6 Correct 3 ms 12932 KB Output is correct
7 Correct 1 ms 12892 KB Output is correct
8 Correct 33 ms 12892 KB Output is correct
9 Correct 19 ms 12892 KB Output is correct
10 Correct 21 ms 12924 KB Output is correct
11 Correct 19 ms 12892 KB Output is correct
12 Correct 19 ms 12888 KB Output is correct
13 Correct 624 ms 13016 KB Output is correct
14 Correct 584 ms 12892 KB Output is correct
15 Correct 23 ms 12888 KB Output is correct
16 Correct 24 ms 12892 KB Output is correct
17 Correct 4 ms 12892 KB Output is correct
18 Correct 972 ms 13052 KB Output is correct
19 Correct 531 ms 12888 KB Output is correct
20 Correct 492 ms 13144 KB Output is correct
21 Correct 532 ms 13008 KB Output is correct
22 Correct 536 ms 13008 KB Output is correct

Subtask #3
0.0 / 7.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 227 ms 28844 KB Output is correct
3 Correct 239 ms 29904 KB Output is correct
4 Correct 244 ms 29940 KB Output is correct
5 Correct 226 ms 29772 KB Output is correct
6 Correct 206 ms 29788 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2077 ms 52848 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 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 4 ms 12892 KB Output is correct
6 Correct 3 ms 12932 KB Output is correct
7 Correct 1 ms 12892 KB Output is correct
8 Correct 33 ms 12892 KB Output is correct
9 Correct 19 ms 12892 KB Output is correct
10 Correct 21 ms 12924 KB Output is correct
11 Correct 19 ms 12892 KB Output is correct
12 Correct 19 ms 12888 KB Output is correct
13 Correct 624 ms 13016 KB Output is correct
14 Correct 584 ms 12892 KB Output is correct
15 Correct 23 ms 12888 KB Output is correct
16 Correct 24 ms 12892 KB Output is correct
17 Correct 4 ms 12892 KB Output is correct
18 Correct 972 ms 13052 KB Output is correct
19 Correct 531 ms 12888 KB Output is correct
20 Correct 492 ms 13144 KB Output is correct
21 Correct 532 ms 13008 KB Output is correct
22 Correct 536 ms 13008 KB Output is correct
23 Execution timed out 2054 ms 17960 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 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 22 ms 12892 KB Output is correct
5 Correct 4 ms 12892 KB Output is correct
6 Correct 3 ms 12932 KB Output is correct
7 Correct 1 ms 12892 KB Output is correct
8 Correct 33 ms 12892 KB Output is correct
9 Correct 19 ms 12892 KB Output is correct
10 Correct 21 ms 12924 KB Output is correct
11 Correct 19 ms 12892 KB Output is correct
12 Correct 19 ms 12888 KB Output is correct
13 Correct 624 ms 13016 KB Output is correct
14 Correct 584 ms 12892 KB Output is correct
15 Correct 23 ms 12888 KB Output is correct
16 Correct 24 ms 12892 KB Output is correct
17 Correct 4 ms 12892 KB Output is correct
18 Correct 972 ms 13052 KB Output is correct
19 Correct 531 ms 12888 KB Output is correct
20 Correct 492 ms 13144 KB Output is correct
21 Correct 532 ms 13008 KB Output is correct
22 Correct 536 ms 13008 KB Output is correct
23 Execution timed out 2053 ms 43808 KB Time limit exceeded
24 Halted 0 ms 0 KB -