oj.uz

Submission #447353

# Submission time Handle Problem Language Result Execution time Memory
447353 2021-07-26T07:00:02 Z jhwest2 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 11444 KB 
#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long lint;
typedef pair<int, int> pint;

const int M = 1e5 + 10, SQ = 400;

int n, q, A[M], Count[M];
lint Ans[M];
pair<pint, int> Qry[M];
vector<lint> V;

struct Set {
    multiset<lint> St;

    void insert(lint x) {
        St.erase(St.find(Count[x] * V[x])); Count[x] += 1;
        St.insert(Count[x] * V[x]);
    }
    void erase(lint x) {
        St.erase(St.find(Count[x] * V[x])); Count[x] -= 1;
        St.insert(Count[x] * V[x]);
    }
    lint query() {
        return *prev(St.end());
    }
} St;

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> A[i]; V.push_back(A[i]);
    }
    sort(V.begin(), V.end());
    V.erase(unique(V.begin(), V.end()), V.end());

    for (int i = 1; i <= n; i++) {
        A[i] = lower_bound(V.begin(), V.end(), A[i]) - V.begin();
    }
    for (int i = 1; i <= q; i++) {
        cin >> Qry[i].va.va >> Qry[i].va.vb;
        Qry[i].vb = i;
    }
    stable_sort(Qry + 1, Qry + 1 + q, [&](auto a, auto b) {
        if (a.va.va / SQ == b.va.va / SQ) return a.va.vb <= b.va.vb;
        return a.va.va <= b.va.va;
        });

    for (int i = 1; i <= n; i++) St.St.insert(0);
    int l = 1, r = 0;
    for (int i = 1; i <= q; i++) {
        while (Qry[i].va.vb > r) St.insert(A[++r]);
        while (Qry[i].va.vb < r) St.erase(A[r--]);
        while (Qry[i].va.va > l) St.erase(A[l++]);
        while (Qry[i].va.va < l) St.insert(A[--l]);

        Ans[Qry[i].vb] = St.query();
    }
    for (int i = 1; i <= q; i++) {
        cout << Ans[i] << '\n';
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 7 ms 332 KB Output is correct
18 Correct 17 ms 332 KB Output is correct
19 Correct 43 ms 480 KB Output is correct
20 Correct 91 ms 632 KB Output is correct
21 Correct 142 ms 716 KB Output is correct
22 Correct 180 ms 788 KB Output is correct
23 Correct 172 ms 836 KB Output is correct
24 Correct 144 ms 788 KB Output is correct
25 Correct 174 ms 808 KB Output is correct
26 Correct 216 ms 816 KB Output is correct
27 Correct 167 ms 836 KB Output is correct
28 Correct 183 ms 840 KB Output is correct
29 Correct 166 ms 816 KB Output is correct
30 Correct 170 ms 812 KB Output is correct
31 Correct 140 ms 828 KB Output is correct
32 Correct 142 ms 824 KB Output is correct
33 Correct 220 ms 816 KB Output is correct
34 Correct 164 ms 880 KB Output is correct
35 Correct 166 ms 820 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 13 ms 1228 KB Output is correct
9 Correct 27 ms 2048 KB Output is correct
10 Correct 48 ms 3660 KB Output is correct
11 Correct 150 ms 9976 KB Output is correct
12 Correct 127 ms 6880 KB Output is correct
13 Correct 119 ms 7900 KB Output is correct
14 Correct 149 ms 9356 KB Output is correct
15 Correct 166 ms 11444 KB Output is correct
16 Correct 153 ms 9580 KB Output is correct
17 Correct 121 ms 7556 KB Output is correct
18 Correct 136 ms 9884 KB Output is correct
19 Correct 153 ms 10896 KB Output is correct
20 Correct 90 ms 8192 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 7 ms 332 KB Output is correct
18 Correct 17 ms 332 KB Output is correct
19 Correct 43 ms 480 KB Output is correct
20 Correct 91 ms 632 KB Output is correct
21 Correct 142 ms 716 KB Output is correct
22 Correct 180 ms 788 KB Output is correct
23 Correct 172 ms 836 KB Output is correct
24 Correct 144 ms 788 KB Output is correct
25 Correct 174 ms 808 KB Output is correct
26 Correct 216 ms 816 KB Output is correct
27 Correct 167 ms 836 KB Output is correct
28 Correct 183 ms 840 KB Output is correct
29 Correct 166 ms 816 KB Output is correct
30 Correct 170 ms 812 KB Output is correct
31 Correct 140 ms 828 KB Output is correct
32 Correct 142 ms 824 KB Output is correct
33 Correct 220 ms 816 KB Output is correct
34 Correct 164 ms 880 KB Output is correct
35 Correct 166 ms 820 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 2 ms 420 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 13 ms 1228 KB Output is correct
44 Correct 27 ms 2048 KB Output is correct
45 Correct 48 ms 3660 KB Output is correct
46 Correct 150 ms 9976 KB Output is correct
47 Correct 127 ms 6880 KB Output is correct
48 Correct 119 ms 7900 KB Output is correct
49 Correct 149 ms 9356 KB Output is correct
50 Correct 166 ms 11444 KB Output is correct
51 Correct 153 ms 9580 KB Output is correct
52 Correct 121 ms 7556 KB Output is correct
53 Correct 136 ms 9884 KB Output is correct
54 Correct 153 ms 10896 KB Output is correct
55 Correct 90 ms 8192 KB Output is correct
56 Correct 327 ms 1272 KB Output is correct
57 Correct 935 ms 2380 KB Output is correct
58 Correct 2062 ms 3488 KB Output is correct
59 Correct 3515 ms 4520 KB Output is correct
60 Execution timed out 4082 ms 5152 KB Time limit exceeded
61 Halted 0 ms 0 KB -