oj.uz

Submission #1092481

# Submission time Handle Problem Language Result Execution time Memory
1092481 2024-09-24T07:56:50 Z jonghak9028 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 11740 KB 
/* ************************************************************************** */
/*                                                                            */
/*                                                      :::    :::    :::     */
/*   Problem Number: 17731                             :+:    :+:      :+:    */
/*                                                    +:+    +:+        +:+   */
/*   By: js9028 <boj.kr/u/js9028>                    +#+    +#+          +#+  */
/*                                                  +#+      +#+        +#+   */
/*   https://boj.kr/17731                          #+#        #+#      #+#    */
/*   Solved: 2024/09/24 14:38:32 by js9028        ###          ###   ##.kr    */
/*                                                                            */
/* ************************************************************************** */
#include <bits/stdc++.h>
using namespace std;
#define fastio (ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL))
typedef long long ll;
typedef long double lld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MAXSIZE = 2000000;
const long long INF = 1e18 + 5;
const double EPSILON = 1e-14;
const ll DIV = 2000003;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

int n, q;
int sq;
ll arr[100055];
vector<ll> num;
vector<array<int, 3>> query;
ll ans[100055];

ll mx;

int idx;
int cnt[100055];

map<int, int> mp;

void ADD(int i)
{
    i = lower_bound(num.begin(), num.end(), arr[i]) - num.begin();
    if (mp.find(i) == mp.end())
        mp[i] = cnt[i];
    cnt[i]++;
}

void SUB(int i)
{
    i = lower_bound(num.begin(), num.end(), arr[i]) - num.begin();
    if (mp.find(i) == mp.end())
        mp[i] = cnt[i];
    cnt[i]--;
}
set<pair<ll, int>> st;

void solve()
{

    int s = 1, e = 0;
    for (auto [l, r, q] : query)
    {
        mp.clear();

        while (e < r)
            e++, ADD(e);
        while (s > l)
            s--, ADD(s);
        while (s < l)
            SUB(s), s++;
        while (e > r)
            SUB(e), e--;
        for (auto &p : mp)
        {
            if (p.second == cnt[p.first])
                continue;
            else
            {
                st.erase({num[p.first] * p.second, p.first});
                st.insert({num[p.first] * cnt[p.first], p.first});
            }
        }
        ans[q] = (--st.end())->first;
    }
}

int main()
{
    fastio;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
        num.push_back(arr[i]);
    }
    for (int i = 0; i < q; i++)
    {
        int l, r;
        cin >> l >> r;
        query.push_back({l, r, i});
    }
    sort(num.begin(), num.end());

    sq = sqrt(n);

    sort(query.begin(), query.end(), [](auto &a, auto &b)
         {
             int sa = a[0] / sq, sb = b[0] / sq;
             if(sa == sb) return a[1] < b[1];
             return sa < sb; });

    solve();
    for (int i = 0; i < q; i++)
    {
        cout << ans[i] << "\n";
    }
    return 0;
}

Subtask #1
5.0 / 5.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 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 420 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 420 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 18 ms 564 KB Output is correct
20 Correct 43 ms 604 KB Output is correct
21 Correct 68 ms 604 KB Output is correct
22 Correct 85 ms 600 KB Output is correct
23 Correct 42 ms 604 KB Output is correct
24 Correct 45 ms 780 KB Output is correct
25 Correct 150 ms 788 KB Output is correct
26 Correct 144 ms 848 KB Output is correct
27 Correct 137 ms 848 KB Output is correct
28 Correct 134 ms 604 KB Output is correct
29 Correct 123 ms 604 KB Output is correct
30 Correct 149 ms 604 KB Output is correct
31 Correct 47 ms 604 KB Output is correct
32 Correct 12 ms 780 KB Output is correct
33 Correct 126 ms 780 KB Output is correct
34 Correct 149 ms 856 KB Output is correct
35 Correct 157 ms 892 KB Output is correct

Subtask #3
25.0 / 25.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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 10 ms 948 KB Output is correct
9 Correct 27 ms 1248 KB Output is correct
10 Correct 6 ms 1248 KB Output is correct
11 Correct 57 ms 4932 KB Output is correct
12 Correct 31 ms 2520 KB Output is correct
13 Correct 109 ms 3212 KB Output is correct
14 Correct 130 ms 6352 KB Output is correct
15 Correct 121 ms 8900 KB Output is correct
16 Correct 126 ms 9932 KB Output is correct
17 Correct 36 ms 3544 KB Output is correct
18 Correct 56 ms 5244 KB Output is correct
19 Correct 88 ms 10936 KB Output is correct
20 Correct 68 ms 11740 KB Output is correct

Subtask #4
0 / 60.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 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 420 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 18 ms 564 KB Output is correct
20 Correct 43 ms 604 KB Output is correct
21 Correct 68 ms 604 KB Output is correct
22 Correct 85 ms 600 KB Output is correct
23 Correct 42 ms 604 KB Output is correct
24 Correct 45 ms 780 KB Output is correct
25 Correct 150 ms 788 KB Output is correct
26 Correct 144 ms 848 KB Output is correct
27 Correct 137 ms 848 KB Output is correct
28 Correct 134 ms 604 KB Output is correct
29 Correct 123 ms 604 KB Output is correct
30 Correct 149 ms 604 KB Output is correct
31 Correct 47 ms 604 KB Output is correct
32 Correct 12 ms 780 KB Output is correct
33 Correct 126 ms 780 KB Output is correct
34 Correct 149 ms 856 KB Output is correct
35 Correct 157 ms 892 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 2 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 5 ms 604 KB Output is correct
43 Correct 10 ms 948 KB Output is correct
44 Correct 27 ms 1248 KB Output is correct
45 Correct 6 ms 1248 KB Output is correct
46 Correct 57 ms 4932 KB Output is correct
47 Correct 31 ms 2520 KB Output is correct
48 Correct 109 ms 3212 KB Output is correct
49 Correct 130 ms 6352 KB Output is correct
50 Correct 121 ms 8900 KB Output is correct
51 Correct 126 ms 9932 KB Output is correct
52 Correct 36 ms 3544 KB Output is correct
53 Correct 56 ms 5244 KB Output is correct
54 Correct 88 ms 10936 KB Output is correct
55 Correct 68 ms 11740 KB Output is correct
56 Correct 136 ms 1112 KB Output is correct
57 Correct 898 ms 1488 KB Output is correct
58 Correct 2576 ms 2968 KB Output is correct
59 Execution timed out 4069 ms 3916 KB Time limit exceeded
60 Halted 0 ms 0 KB -