oj.uz

Submission #1092480

# Submission time Handle Problem Language Result Execution time Memory
1092480 2024-09-24T07:56:09 Z jonghak9028 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 13004 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[0];
             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 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 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 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 27 ms 348 KB Output is correct
19 Correct 74 ms 592 KB Output is correct
20 Correct 252 ms 680 KB Output is correct
21 Correct 432 ms 852 KB Output is correct
22 Correct 588 ms 856 KB Output is correct
23 Correct 250 ms 852 KB Output is correct
24 Correct 261 ms 848 KB Output is correct
25 Correct 1638 ms 916 KB Output is correct
26 Correct 1557 ms 916 KB Output is correct
27 Correct 1470 ms 880 KB Output is correct
28 Correct 1458 ms 856 KB Output is correct
29 Correct 1186 ms 1108 KB Output is correct
30 Correct 1314 ms 868 KB Output is correct
31 Correct 288 ms 860 KB Output is correct
32 Correct 103 ms 856 KB Output is correct
33 Correct 1279 ms 860 KB Output is correct
34 Correct 1667 ms 952 KB Output is correct
35 Correct 1804 ms 996 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 6 ms 536 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 7 ms 760 KB Output is correct
8 Correct 9 ms 860 KB Output is correct
9 Correct 28 ms 1668 KB Output is correct
10 Correct 6 ms 1504 KB Output is correct
11 Correct 333 ms 6608 KB Output is correct
12 Correct 31 ms 3284 KB Output is correct
13 Correct 1643 ms 4556 KB Output is correct
14 Correct 3195 ms 7764 KB Output is correct
15 Correct 119 ms 10976 KB Output is correct
16 Correct 661 ms 11748 KB Output is correct
17 Correct 111 ms 4144 KB Output is correct
18 Correct 259 ms 6784 KB Output is correct
19 Correct 535 ms 13004 KB Output is correct
20 Correct 185 ms 12744 KB Output is correct

Subtask #4
0 / 60.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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 27 ms 348 KB Output is correct
19 Correct 74 ms 592 KB Output is correct
20 Correct 252 ms 680 KB Output is correct
21 Correct 432 ms 852 KB Output is correct
22 Correct 588 ms 856 KB Output is correct
23 Correct 250 ms 852 KB Output is correct
24 Correct 261 ms 848 KB Output is correct
25 Correct 1638 ms 916 KB Output is correct
26 Correct 1557 ms 916 KB Output is correct
27 Correct 1470 ms 880 KB Output is correct
28 Correct 1458 ms 856 KB Output is correct
29 Correct 1186 ms 1108 KB Output is correct
30 Correct 1314 ms 868 KB Output is correct
31 Correct 288 ms 860 KB Output is correct
32 Correct 103 ms 856 KB Output is correct
33 Correct 1279 ms 860 KB Output is correct
34 Correct 1667 ms 952 KB Output is correct
35 Correct 1804 ms 996 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 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 6 ms 536 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 7 ms 760 KB Output is correct
43 Correct 9 ms 860 KB Output is correct
44 Correct 28 ms 1668 KB Output is correct
45 Correct 6 ms 1504 KB Output is correct
46 Correct 333 ms 6608 KB Output is correct
47 Correct 31 ms 3284 KB Output is correct
48 Correct 1643 ms 4556 KB Output is correct
49 Correct 3195 ms 7764 KB Output is correct
50 Correct 119 ms 10976 KB Output is correct
51 Correct 661 ms 11748 KB Output is correct
52 Correct 111 ms 4144 KB Output is correct
53 Correct 259 ms 6784 KB Output is correct
54 Correct 535 ms 13004 KB Output is correct
55 Correct 185 ms 12744 KB Output is correct
56 Correct 1144 ms 1112 KB Output is correct
57 Execution timed out 4046 ms 1496 KB Time limit exceeded
58 Halted 0 ms 0 KB -