Submission #932072

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
932072	2024-02-22T22:36:59 Z	Edu175	Sequence (APIO23_sequence)	C++17	28 / 100	2000 ms	43540 KB

sequence

#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 long long ll;
typedef pair<ll,ll> ii;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree
<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update>
indexed_set;

int sequence(int N, std::vector<int> A) {
	ll n=N;
	vector<ll>a(n);
	fore(i,0,n)a[i]=A[i]-1;
	ll res=0;
	fore(l,0,n){
		indexed_set st;
		vector<ll>c(n);
		fore(r,l,n){
			c[a[r]]++;
			st.insert({a[r],r});
			ll m0=st.find_by_order((SZ(st)-1)/2)->fst;
			ll m1=st.find_by_order((SZ(st))/2)->fst;
			//imp(st);
			//cout<<m0<<" "<<m1<<"\n";
			res=max({res,c[m0],c[m1]});
		}
	}
	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	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	600 KB	Output is correct
6	Correct	1 ms	504 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	348 KB	Output is correct
10	Correct	1 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	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	600 KB	Output is correct
6	Correct	1 ms	504 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	348 KB	Output is correct
10	Correct	1 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	437 ms	580 KB	Output is correct
14	Correct	441 ms	604 KB	Output is correct
15	Correct	420 ms	600 KB	Output is correct
16	Correct	462 ms	604 KB	Output is correct
17	Correct	398 ms	604 KB	Output is correct
18	Correct	427 ms	600 KB	Output is correct
19	Correct	432 ms	608 KB	Output is correct
20	Correct	451 ms	604 KB	Output is correct
21	Correct	433 ms	604 KB	Output is correct
22	Correct	439 ms	604 KB	Output is correct

Subtask #3

0.0 / 7.0

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

Subtask #4

0.0 / 12.0

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

Subtask #5

0.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2047 ms	43392 KB	Time limit exceeded
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	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	600 KB	Output is correct
6	Correct	1 ms	504 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	348 KB	Output is correct
10	Correct	1 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	437 ms	580 KB	Output is correct
14	Correct	441 ms	604 KB	Output is correct
15	Correct	420 ms	600 KB	Output is correct
16	Correct	462 ms	604 KB	Output is correct
17	Correct	398 ms	604 KB	Output is correct
18	Correct	427 ms	600 KB	Output is correct
19	Correct	432 ms	608 KB	Output is correct
20	Correct	451 ms	604 KB	Output is correct
21	Correct	433 ms	604 KB	Output is correct
22	Correct	439 ms	604 KB	Output is correct
23	Execution timed out	2028 ms	7764 KB	Time limit exceeded
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	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	600 KB	Output is correct
6	Correct	1 ms	504 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	348 KB	Output is correct
10	Correct	1 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	437 ms	580 KB	Output is correct
14	Correct	441 ms	604 KB	Output is correct
15	Correct	420 ms	600 KB	Output is correct
16	Correct	462 ms	604 KB	Output is correct
17	Correct	398 ms	604 KB	Output is correct
18	Correct	427 ms	600 KB	Output is correct
19	Correct	432 ms	608 KB	Output is correct
20	Correct	451 ms	604 KB	Output is correct
21	Correct	433 ms	604 KB	Output is correct
22	Correct	439 ms	604 KB	Output is correct
23	Execution timed out	2056 ms	43540 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-