oj.uz

Submission #930060

# Submission time Handle Problem Language Result Execution time Memory
930060 2024-02-18T11:46:33 Z heavylightdecomp Sequence (APIO23_sequence) C++17
28 / 100
 2000 ms 33252 KB 
#include<bits/stdc++.h>
#include "sequence.h"
using namespace std;
#define X first
#define Y second
#define pb push_back
#define vt vector
#define f0r(i,a,b) for(auto i =(a); i != (b); i++)
#define r0f(i,a,b) for(auto i =(a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
using pii = pair<int,int>;
// sim dor ris eni(x) rge range dud debug 2eni 2dor
#define sim template< class c
#define dor > debug& operator<<
#define ris return *this
#define eni(x) sim> typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i)
sim> struct rge { c b,e; };
sim> rge<c> range(c i, c j) {
    return rge<c>{i,j};
}
sim> auto dud(c *x)->decltype(cout << *x, 0);
sim> char dud(...);
struct debug {
    ~debug() { cerr << endl; }
    eni(!=) { cerr << boolalpha << i; ris; }
    eni(==) { ris << range(all(i)); }
    sim, class b dor(pair<b,c> d) {
        ris << "(" << d.X << ", " << d.Y << ")";
    }
    sim dor(rge<c> d) {
        *this << "{";
        f0r(i,d.b,d.e) *this << ", "+2*(i==d.b) << *i;
        ris << "}";
    }
};
#define imie(r...) " [" << #r << ": " << (r) << "] "
struct median {
    priority_queue<int> a;
    priority_queue<int, vt<int>, greater<int>> b;
    void ins(int k) {
        a.push(k);
        int have = sz(a)+sz(b);
        while(sz(a) > have/2) {
            b.push(a.top());
            a.pop();
        }
        while(sz(b) > have/2) {
            a.push(b.top());
            b.pop();
        }
    }
    pii get() {
        assert(sz(a));
        int have = sz(a) + sz(b);
        if(have % 2) return {a.top(), a.top()};
        else return {a.top(), b.top()};
    }
};

int sequence(int n, vt<int> ar) {

    map<int,int> freq;
    int res = 0;
    f0r(l,0,n) {
        median ds;
        freq.clear();
        f0r(r,l,n) {
            freq[ar[r]]++;
            ds.ins(ar[r]);
            pii hmm = ds.get();
            res = max({res, freq[hmm.X], freq[hmm.Y]});
        }
    }
    return res;

}

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 0 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 2 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 497 ms 516 KB Output is correct
14 Correct 486 ms 348 KB Output is correct
15 Correct 300 ms 436 KB Output is correct
16 Correct 303 ms 452 KB Output is correct
17 Correct 234 ms 600 KB Output is correct
18 Correct 456 ms 548 KB Output is correct
19 Correct 464 ms 516 KB Output is correct
20 Correct 428 ms 348 KB Output is correct
21 Correct 500 ms 504 KB Output is correct
22 Correct 464 ms 500 KB Output is correct

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 2021 ms 24568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 2056 ms 8668 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 2055 ms 33252 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 1 ms 348 KB Output is correct
3 Correct 1 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 0 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 2 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 497 ms 516 KB Output is correct
14 Correct 486 ms 348 KB Output is correct
15 Correct 300 ms 436 KB Output is correct
16 Correct 303 ms 452 KB Output is correct
17 Correct 234 ms 600 KB Output is correct
18 Correct 456 ms 548 KB Output is correct
19 Correct 464 ms 516 KB Output is correct
20 Correct 428 ms 348 KB Output is correct
21 Correct 500 ms 504 KB Output is correct
22 Correct 464 ms 500 KB Output is correct
23 Execution timed out 2055 ms 4776 KB Time limit exceeded
24 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 1 ms 348 KB Output is correct
3 Correct 1 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 0 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 2 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 497 ms 516 KB Output is correct
14 Correct 486 ms 348 KB Output is correct
15 Correct 300 ms 436 KB Output is correct
16 Correct 303 ms 452 KB Output is correct
17 Correct 234 ms 600 KB Output is correct
18 Correct 456 ms 548 KB Output is correct
19 Correct 464 ms 516 KB Output is correct
20 Correct 428 ms 348 KB Output is correct
21 Correct 500 ms 504 KB Output is correct
22 Correct 464 ms 500 KB Output is correct
23 Execution timed out 2021 ms 24568 KB Time limit exceeded
24 Halted 0 ms 0 KB -