Submission #982565

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
982565	2024-05-14T12:22:57 Z	Ghetto	Sequence (APIO23_sequence)	C++17	11 / 100	2000 ms	50936 KB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 5e5 + 5;

int n;
int a[MAX_N];
int sequence(int tmp_n, vector<int> tmp_a) {
    n = tmp_n;
    for (int i = 0; i < n; i++) a[i + 1] = tmp_a[i];

    int ans = 1;
    for (int l = 1; l <= n; l++) {
        unordered_map<int, int> freq;
        multiset<int> smalls, bigs;
        for (int r = l; r <= n; r++) {
            freq[a[r]]++;

            if (smalls.empty() || a[r] <= *smalls.rbegin()) smalls.insert(a[r]);
            else bigs.insert(a[r]);

            while (bigs.size() > smalls.size()) {
                assert(bigs.size());
                smalls.insert(*bigs.begin()), bigs.erase(bigs.begin());
            }
            while (smalls.size() > bigs.size() + 1) {
                assert(smalls.size());
                bigs.insert(*smalls.rbegin()), smalls.erase(next(smalls.end(), -1));
            }
            
            assert(smalls.size());
            vector<int> medians = {*smalls.rbegin()};
            if (bigs.size()) medians.push_back(*bigs.begin());
            for (int x : medians) ans = max(ans, freq[x]);
        }
    }
    return ans;
}

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	2 ms	600 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	1 ms	440 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct

Subtask #2

0.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	2 ms	600 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	1 ms	440 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	543 ms	612 KB	Output is correct
14	Correct	571 ms	612 KB	Output is correct
15	Correct	344 ms	348 KB	Output is correct
16	Correct	403 ms	536 KB	Output is correct
17	Correct	393 ms	348 KB	Output is correct
18	Correct	444 ms	840 KB	Output is correct
19	Correct	547 ms	604 KB	Output is correct
20	Correct	502 ms	600 KB	Output is correct
21	Correct	505 ms	604 KB	Output is correct
22	Incorrect	520 ms	600 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

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	2057 ms	42244 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	2055 ms	29684 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	2049 ms	50936 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	2 ms	600 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	1 ms	440 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	543 ms	612 KB	Output is correct
14	Correct	571 ms	612 KB	Output is correct
15	Correct	344 ms	348 KB	Output is correct
16	Correct	403 ms	536 KB	Output is correct
17	Correct	393 ms	348 KB	Output is correct
18	Correct	444 ms	840 KB	Output is correct
19	Correct	547 ms	604 KB	Output is correct
20	Correct	502 ms	600 KB	Output is correct
21	Correct	505 ms	604 KB	Output is correct
22	Incorrect	520 ms	600 KB	Output isn't correct
23	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	2 ms	600 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	1 ms	440 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	543 ms	612 KB	Output is correct
14	Correct	571 ms	612 KB	Output is correct
15	Correct	344 ms	348 KB	Output is correct
16	Correct	403 ms	536 KB	Output is correct
17	Correct	393 ms	348 KB	Output is correct
18	Correct	444 ms	840 KB	Output is correct
19	Correct	547 ms	604 KB	Output is correct
20	Correct	502 ms	600 KB	Output is correct
21	Correct	505 ms	604 KB	Output is correct
22	Incorrect	520 ms	600 KB	Output isn't correct
23	Halted	0 ms	0 KB	-