Submission #985537

# Submission time Handle Problem Language Result Execution time Memory
985537 2024-05-18T06:16:18 Z ag_1204 Sequence (APIO23_sequence) C++17
0 / 100
2000 ms 5812 KB
#include<bits/stdc++.h>
using namespace std;

void balance(multiset<int> s, multiset<int> t) {
    while (s.size() > t.size() + 1) {
        t.insert(*s.rbegin());
        s.erase(prev(s.end()));
    }
    while (t.size() > s.size()) {
        s.insert(*t.begin());
        t.erase(t.begin());
    }
}

int sequence(int N, std::vector<int> A) {
    int ans=0;
    for (int i=0;i<N;i++) {
        map<int,int> m;
        multiset<int> low, high;
        for (int j=i;j<N;j++) {
            if (low.empty() || A[j]<=*low.rbegin()) {
                low.insert(A[j]);
            } else {
                high.insert(A[j]);
            }
            balance(low,high);
            m[A[j]]++;
            int m1 = *low.rbegin();
            int m2 = (low.size()+high.size())%2==0?*high.begin():m1;
            int occ1 = m[m1], occ2=m[m2];
            ans = max(ans,(max(occ1,occ2)));
        }
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2039 ms 5404 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2007 ms 5812 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -