oj.uz

Submission #983353

# Submission time Handle Problem Language Result Execution time Memory
983353 2024-05-15T10:49:28 Z c2zi6 Sequence (APIO23_sequence) C++17
28 / 100
 2000 ms 41552 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "sequence.h"

namespace TEST2 {
	int n;
	VI a;
	int solve(VI A) {a = A, n = a.size();
		int ans = 0;
		replr(l, 0, n-1) {
			indset<PII> st;
			int UID = 0;
			replr(r, l, n-1) {
				st.insert({a[r], UID++});
				int med1 = st.find_by_order((st.size()-1)/2)->ff;
				int med2 = st.find_by_order(st.size()/2)->ff;
				setmax(ans, int(st.order_of_key(*st.upper_bound({med1, 2e9})) - st.order_of_key(*st.lower_bound({med1, -2e9}))));
				setmax(ans, int(st.order_of_key(*st.upper_bound({med2, 2e9})) - st.order_of_key(*st.lower_bound({med2, -2e9}))));
			}
		}
		return ans;
	}
};

int sequence(int n, VI a) {
	return TEST2::solve(a);
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 348 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 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 348 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 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 692 ms 580 KB Output is correct
14 Correct 675 ms 580 KB Output is correct
15 Correct 610 ms 580 KB Output is correct
16 Correct 596 ms 348 KB Output is correct
17 Correct 580 ms 576 KB Output is correct
18 Correct 839 ms 596 KB Output is correct
19 Correct 719 ms 576 KB Output is correct
20 Correct 683 ms 576 KB Output is correct
21 Correct 714 ms 580 KB Output is correct
22 Correct 814 ms 572 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 2013 ms 41552 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 2007 ms 40524 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 2056 ms 41508 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 348 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 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 692 ms 580 KB Output is correct
14 Correct 675 ms 580 KB Output is correct
15 Correct 610 ms 580 KB Output is correct
16 Correct 596 ms 348 KB Output is correct
17 Correct 580 ms 576 KB Output is correct
18 Correct 839 ms 596 KB Output is correct
19 Correct 719 ms 576 KB Output is correct
20 Correct 683 ms 576 KB Output is correct
21 Correct 714 ms 580 KB Output is correct
22 Correct 814 ms 572 KB Output is correct
23 Execution timed out 2025 ms 6992 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 348 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 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 692 ms 580 KB Output is correct
14 Correct 675 ms 580 KB Output is correct
15 Correct 610 ms 580 KB Output is correct
16 Correct 596 ms 348 KB Output is correct
17 Correct 580 ms 576 KB Output is correct
18 Correct 839 ms 596 KB Output is correct
19 Correct 719 ms 576 KB Output is correct
20 Correct 683 ms 576 KB Output is correct
21 Correct 714 ms 580 KB Output is correct
22 Correct 814 ms 572 KB Output is correct
23 Execution timed out 2013 ms 41552 KB Time limit exceeded
24 Halted 0 ms 0 KB -