oj.uz

Submission #936664

# Submission time Handle Problem Language Result Execution time Memory
936664 2024-03-02T13:07:40 Z JuanJL Sequence (APIO23_sequence) C++17
35 / 100
 550 ms 91984 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 

#define fst first 
#define snd second
#define pb push_back
#define forn(i,a,b) for(int i = a; i < b; i++)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define dbg(v) cout<<"Line("<<__LINE__<<"): "<<#v<<" = "<<v<<'\n';
#define pi pair<int,int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_multiset;

ll n; 
vector<ll> a;


int sequence(int N, std::vector<int> A) {
	n=N;
	a.clear();
	a.resize(n);
	forn(i,0,n) a[i]=A[i];
	ll res = 0;
	
	if(n<=(2*pow(10,3))){
		//Subtasks 1 , 2
		/*cout<<n<<" "<<2*pow(10,3);
		cout<<"Tests 1 2"<<'\n';*/
		forn(i,0,n){
			indexed_multiset im;
			ll ocurr[n+1];
			mset(ocurr,0);
			forn(j,i,n){
				im.insert(a[j]);
				ocurr[a[j]]++;
				
				res = max(res,ocurr[*im.find_by_order((SZ(im))/2)]);
				if(SZ(im)%2==0) res = max(res,ocurr[*im.find_by_order((SZ(im)/2)-1)]);
				/*for(auto i:im) cout<<i<<" ";
				cout<<'\n';
				cout<<res<<'\n';*/
			}
		}
	}else{
		vector<vector<ll>> p;
		set<ll> vals;
		map<ll,ll> cI;
		forn(i,0,n) vals.insert(a[i]);
		ll ind = 0;
		for(auto i:vals) cI[i]=ind,ind++;
		p.resize(SZ(cI));
		forn(i,0,n)	p[cI[a[i]]].pb(i);
		
		ll men = 0;
		ll may = 0;
		ll igu = 0;
		forn(i,0,SZ(p)){
			men=0; may = 0; igu = 0;
			forn(j,0,SZ(p[i])){
				if(abs(p[i][j]-p[i][j+1])==1) igu++;
				else break;
			}
			igu++;
			res=max(res,igu);
			res=max(res,SZ(p[i])-(igu));
			if(SZ(p[i])==1) may = 0;
			else may = (p[i][igu]-p[i][igu-1])-1;
			
			men=p[i][0]+((n-1)-p[i][SZ(p[i])-1]);
			//cout<<igu<<" "<<may<<" "<<men<<'\n';
			if(may<=men+igu) res = max(res,(ll)SZ(p[i]));
			
			
			//cout<<res<<" "<<i<<'\n';
		}
	}
	return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 382 ms 552 KB Output is correct
14 Correct 361 ms 348 KB Output is correct
15 Correct 354 ms 556 KB Output is correct
16 Correct 369 ms 548 KB Output is correct
17 Correct 351 ms 548 KB Output is correct
18 Correct 329 ms 556 KB Output is correct
19 Correct 387 ms 552 KB Output is correct
20 Correct 374 ms 556 KB Output is correct
21 Correct 379 ms 560 KB Output is correct
22 Correct 377 ms 536 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 290 ms 62664 KB Output is correct
3 Correct 260 ms 62448 KB Output is correct
4 Correct 44 ms 12936 KB Output is correct
5 Correct 241 ms 57528 KB Output is correct
6 Correct 263 ms 57704 KB Output is correct
7 Correct 57 ms 13636 KB Output is correct
8 Correct 47 ms 14104 KB Output is correct
9 Correct 42 ms 14560 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 432 KB Output is correct
2 Correct 51 ms 16360 KB Output is correct
3 Incorrect 45 ms 13284 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 550 ms 91984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 382 ms 552 KB Output is correct
14 Correct 361 ms 348 KB Output is correct
15 Correct 354 ms 556 KB Output is correct
16 Correct 369 ms 548 KB Output is correct
17 Correct 351 ms 548 KB Output is correct
18 Correct 329 ms 556 KB Output is correct
19 Correct 387 ms 552 KB Output is correct
20 Correct 374 ms 556 KB Output is correct
21 Correct 379 ms 560 KB Output is correct
22 Correct 377 ms 536 KB Output is correct
23 Incorrect 64 ms 10560 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 382 ms 552 KB Output is correct
14 Correct 361 ms 348 KB Output is correct
15 Correct 354 ms 556 KB Output is correct
16 Correct 369 ms 548 KB Output is correct
17 Correct 351 ms 548 KB Output is correct
18 Correct 329 ms 556 KB Output is correct
19 Correct 387 ms 552 KB Output is correct
20 Correct 374 ms 556 KB Output is correct
21 Correct 379 ms 560 KB Output is correct
22 Correct 377 ms 536 KB Output is correct
23 Correct 290 ms 62664 KB Output is correct
24 Correct 260 ms 62448 KB Output is correct
25 Correct 44 ms 12936 KB Output is correct
26 Correct 241 ms 57528 KB Output is correct
27 Correct 263 ms 57704 KB Output is correct
28 Correct 57 ms 13636 KB Output is correct
29 Correct 47 ms 14104 KB Output is correct
30 Correct 42 ms 14560 KB Output is correct
31 Correct 51 ms 16360 KB Output is correct
32 Incorrect 45 ms 13284 KB Output isn't correct
33 Halted 0 ms 0 KB -