oj.uz

Submission #759688

# Submission time Handle Problem Language Result Execution time Memory
759688 2023-06-16T15:12:46 Z IvanJ Sequence (APIO23_sequence) C++17
7 / 100
 88 ms 31528 KB 
#include "sequence.h"
#include<bits/stdc++.h>

#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 5e5 + 5;

vector<int> pos[maxn];

int sequence(int N, vector<int> A) {
	for(int i = 0;i < N;i++) pos[A[i]].pb(i);
	
	int X = 0;
	for(int i = 1;i < N;i++) 
		if(A[i] > A[X]) X = i;
	
	int l = 0, ans = 0;
	for(int i = 1;i <= N;i++) {
		if(pos[i].size() == 0) continue;
		int lo = pos[i][0], hi = pos[i].back();
		if(hi < X || lo > X) ans = max(ans, (int)pos[i].size());
		else {
			int e = (int)pos[i].size();
			int g = N - e - l;
			if(l < g - e) {
				int x = 0, y = 0;
				for(int j : pos[i]) 
					if(j < X) x++;
					else y++;
				ans = max(ans, max(x, y));
			} else ans = max(ans, e);
		}
		
		l += (int)pos[i].size();
	}
	return ans;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Incorrect 6 ms 11988 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Incorrect 6 ms 11988 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 67 ms 25780 KB Output is correct
3 Correct 70 ms 25756 KB Output is correct
4 Correct 41 ms 17968 KB Output is correct
5 Correct 69 ms 25000 KB Output is correct
6 Correct 67 ms 24808 KB Output is correct
7 Correct 42 ms 18352 KB Output is correct
8 Correct 41 ms 18480 KB Output is correct
9 Correct 49 ms 18760 KB Output is correct

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 31528 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 6 ms 11988 KB Output is correct
2 Incorrect 6 ms 11988 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Incorrect 6 ms 11988 KB Output isn't correct
3 Halted 0 ms 0 KB -