oj.uz

Submission #1092488

# Submission time Handle Problem Language Result Execution time Memory
1092488 2024-09-24T08:17:52 Z jonghak9028 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 13312 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;
int idx[100055];
ll arr[100055];
vector<ll> num;
vector<array<int, 3>> query;
ll ans[100055];

int cnt[100055];

vector<pair<int,int>> mp;

void ADD(int i)
{
    i = idx[i];
    mp.push_back({i, cnt[i]});
    cnt[i]++;
}

void SUB(int i)
{
    i = idx[i];
    mp.push_back({i, cnt[i]});
    cnt[i]--;
}
set<pair<ll, int>> st;
bool use[100055];

void solve()
{

    int s = 1, e = 0;
    for (auto [l, r, q] : query)
    {
        mp = vector<pair<int,int>>();

        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(use[p.first]) continue;
            use[p.first] = 1;
            st.erase({num[p.first] * p.second, p.first});
            st.insert({num[p.first] * cnt[p.first], p.first});   
        }
        for (auto &p : mp)
        {
            use[p.first] = 0;
        }
        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());
    for(int i = 1;i <=n;i++){
        idx[i] = lower_bound(num.begin(), num.end(), arr[i]) - num.begin();
    }
    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 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 4 ms 568 KB Output is correct
19 Correct 8 ms 600 KB Output is correct
20 Correct 21 ms 604 KB Output is correct
21 Correct 31 ms 944 KB Output is correct
22 Correct 41 ms 920 KB Output is correct
23 Correct 18 ms 860 KB Output is correct
24 Correct 20 ms 932 KB Output is correct
25 Correct 76 ms 976 KB Output is correct
26 Correct 72 ms 860 KB Output is correct
27 Correct 74 ms 996 KB Output is correct
28 Correct 67 ms 976 KB Output is correct
29 Correct 72 ms 860 KB Output is correct
30 Correct 64 ms 984 KB Output is correct
31 Correct 21 ms 856 KB Output is correct
32 Correct 8 ms 860 KB Output is correct
33 Correct 62 ms 976 KB Output is correct
34 Correct 74 ms 1016 KB Output is correct
35 Correct 79 ms 860 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 416 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 8 ms 1116 KB Output is correct
9 Correct 22 ms 2012 KB Output is correct
10 Correct 6 ms 1756 KB Output is correct
11 Correct 52 ms 6848 KB Output is correct
12 Correct 22 ms 3788 KB Output is correct
13 Correct 80 ms 4788 KB Output is correct
14 Correct 112 ms 8396 KB Output is correct
15 Correct 99 ms 11400 KB Output is correct
16 Correct 122 ms 11976 KB Output is correct
17 Correct 28 ms 5580 KB Output is correct
18 Correct 50 ms 7360 KB Output is correct
19 Correct 77 ms 13312 KB Output is correct
20 Correct 43 ms 10580 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 4 ms 568 KB Output is correct
19 Correct 8 ms 600 KB Output is correct
20 Correct 21 ms 604 KB Output is correct
21 Correct 31 ms 944 KB Output is correct
22 Correct 41 ms 920 KB Output is correct
23 Correct 18 ms 860 KB Output is correct
24 Correct 20 ms 932 KB Output is correct
25 Correct 76 ms 976 KB Output is correct
26 Correct 72 ms 860 KB Output is correct
27 Correct 74 ms 996 KB Output is correct
28 Correct 67 ms 976 KB Output is correct
29 Correct 72 ms 860 KB Output is correct
30 Correct 64 ms 984 KB Output is correct
31 Correct 21 ms 856 KB Output is correct
32 Correct 8 ms 860 KB Output is correct
33 Correct 62 ms 976 KB Output is correct
34 Correct 74 ms 1016 KB Output is correct
35 Correct 79 ms 860 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 416 KB Output is correct
40 Correct 2 ms 496 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 4 ms 584 KB Output is correct
43 Correct 8 ms 1116 KB Output is correct
44 Correct 22 ms 2012 KB Output is correct
45 Correct 6 ms 1756 KB Output is correct
46 Correct 52 ms 6848 KB Output is correct
47 Correct 22 ms 3788 KB Output is correct
48 Correct 80 ms 4788 KB Output is correct
49 Correct 112 ms 8396 KB Output is correct
50 Correct 99 ms 11400 KB Output is correct
51 Correct 122 ms 11976 KB Output is correct
52 Correct 28 ms 5580 KB Output is correct
53 Correct 50 ms 7360 KB Output is correct
54 Correct 77 ms 13312 KB Output is correct
55 Correct 43 ms 10580 KB Output is correct
56 Correct 58 ms 1372 KB Output is correct
57 Correct 383 ms 2164 KB Output is correct
58 Correct 1232 ms 3092 KB Output is correct
59 Correct 2666 ms 4764 KB Output is correct
60 Correct 3983 ms 5520 KB Output is correct
61 Correct 3296 ms 5764 KB Output is correct
62 Correct 1813 ms 6680 KB Output is correct
63 Correct 649 ms 7796 KB Output is correct
64 Correct 481 ms 8132 KB Output is correct
65 Correct 480 ms 8236 KB Output is correct
66 Correct 616 ms 8344 KB Output is correct
67 Correct 2414 ms 8724 KB Output is correct
68 Execution timed out 4065 ms 9064 KB Time limit exceeded
69 Halted 0 ms 0 KB -