oj.uz

Submission #957595

# Submission time Handle Problem Language Result Execution time Memory
957595 2024-04-04T04:59:10 Z zeta7532 Sequence (APIO23_sequence) C++17
28 / 100
 1285 ms 2097152 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = int;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

int sequence(int N, std::vector<int> A) {
    int ans=0;
    vector<vector<int>> cum(N+1,vector<ll>(N+1,0));
    rep(i,N) cum[i+1][A[i]]++;
    rep(i,N) rep(j,N+1) cum[i+1][j]+=cum[i][j];
    rep(l,N){
        multiset<ll> s1,s2;
        for(ll r=l;r<N;r++){
            s2.insert(A[r]);
            while(s1.size()>0&&s2.size()>0&&(*s1.rbegin()>*s2.begin())){
                s1.insert(*s2.begin());
                s2.erase(s2.find(*s2.begin()));
            }
            while(((ll)s2.size()-(ll)s1.size())>=2){
                s1.insert(*s2.begin());
                s2.erase(s2.find(*s2.begin()));
            }
            while(((ll)s1.size()-(ll)s2.size())>=2){
                s2.insert(*s1.rbegin());
                s1.erase(s1.find(*s1.rbegin()));
            }
            if(s1.size()>=s2.size()) ans=max(ans,cum[r+1][*s1.rbegin()]-cum[l][*s1.rbegin()]);
            if(s2.size()>=s1.size()) ans=max(ans,cum[r+1][*s2.begin()]-cum[l][*s2.begin()]);
        }
    }
    return ans;
}

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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 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 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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 312 ms 16260 KB Output is correct
14 Correct 309 ms 16220 KB Output is correct
15 Correct 292 ms 16220 KB Output is correct
16 Correct 299 ms 16248 KB Output is correct
17 Correct 255 ms 16220 KB Output is correct
18 Correct 205 ms 16220 KB Output is correct
19 Correct 327 ms 16216 KB Output is correct
20 Correct 310 ms 16220 KB Output is correct
21 Correct 320 ms 16220 KB Output is correct
22 Correct 317 ms 16220 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 Runtime error 1285 ms 2097152 KB Execution killed with signal 9
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 Runtime error 774 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 783 ms 2097152 KB Execution killed with signal 9
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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 312 ms 16260 KB Output is correct
14 Correct 309 ms 16220 KB Output is correct
15 Correct 292 ms 16220 KB Output is correct
16 Correct 299 ms 16248 KB Output is correct
17 Correct 255 ms 16220 KB Output is correct
18 Correct 205 ms 16220 KB Output is correct
19 Correct 327 ms 16216 KB Output is correct
20 Correct 310 ms 16220 KB Output is correct
21 Correct 320 ms 16220 KB Output is correct
22 Correct 317 ms 16220 KB Output is correct
23 Runtime error 762 ms 2097152 KB Execution killed with signal 9
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 1 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 312 ms 16260 KB Output is correct
14 Correct 309 ms 16220 KB Output is correct
15 Correct 292 ms 16220 KB Output is correct
16 Correct 299 ms 16248 KB Output is correct
17 Correct 255 ms 16220 KB Output is correct
18 Correct 205 ms 16220 KB Output is correct
19 Correct 327 ms 16216 KB Output is correct
20 Correct 310 ms 16220 KB Output is correct
21 Correct 320 ms 16220 KB Output is correct
22 Correct 317 ms 16220 KB Output is correct
23 Runtime error 1285 ms 2097152 KB Execution killed with signal 9
24 Halted 0 ms 0 KB -