oj.uz

Submission #1092486

# Submission time Handle Problem Language Result Execution time Memory
1092486 2024-09-24T08:13:30 Z jonghak9028 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 13464 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.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(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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 476 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 476 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 2 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 8 ms 604 KB Output is correct
20 Correct 20 ms 604 KB Output is correct
21 Correct 31 ms 860 KB Output is correct
22 Correct 39 ms 932 KB Output is correct
23 Correct 17 ms 856 KB Output is correct
24 Correct 19 ms 860 KB Output is correct
25 Correct 71 ms 976 KB Output is correct
26 Correct 69 ms 992 KB Output is correct
27 Correct 67 ms 860 KB Output is correct
28 Correct 64 ms 988 KB Output is correct
29 Correct 57 ms 856 KB Output is correct
30 Correct 61 ms 972 KB Output is correct
31 Correct 20 ms 860 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 61 ms 996 KB Output is correct
34 Correct 73 ms 860 KB Output is correct
35 Correct 76 ms 860 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 1 ms 492 KB Output is correct
6 Correct 1 ms 484 KB Output is correct
7 Correct 4 ms 712 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 17 ms 1792 KB Output is correct
10 Correct 6 ms 1756 KB Output is correct
11 Correct 48 ms 7016 KB Output is correct
12 Correct 21 ms 3800 KB Output is correct
13 Correct 75 ms 4816 KB Output is correct
14 Correct 99 ms 8348 KB Output is correct
15 Correct 96 ms 11332 KB Output is correct
16 Correct 102 ms 12496 KB Output is correct
17 Correct 27 ms 5984 KB Output is correct
18 Correct 47 ms 7228 KB Output is correct
19 Correct 82 ms 13464 KB Output is correct
20 Correct 44 ms 11208 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 476 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 2 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 8 ms 604 KB Output is correct
20 Correct 20 ms 604 KB Output is correct
21 Correct 31 ms 860 KB Output is correct
22 Correct 39 ms 932 KB Output is correct
23 Correct 17 ms 856 KB Output is correct
24 Correct 19 ms 860 KB Output is correct
25 Correct 71 ms 976 KB Output is correct
26 Correct 69 ms 992 KB Output is correct
27 Correct 67 ms 860 KB Output is correct
28 Correct 64 ms 988 KB Output is correct
29 Correct 57 ms 856 KB Output is correct
30 Correct 61 ms 972 KB Output is correct
31 Correct 20 ms 860 KB Output is correct
32 Correct 7 ms 860 KB Output is correct
33 Correct 61 ms 996 KB Output is correct
34 Correct 73 ms 860 KB Output is correct
35 Correct 76 ms 860 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 1 ms 492 KB Output is correct
41 Correct 1 ms 484 KB Output is correct
42 Correct 4 ms 712 KB Output is correct
43 Correct 6 ms 1116 KB Output is correct
44 Correct 17 ms 1792 KB Output is correct
45 Correct 6 ms 1756 KB Output is correct
46 Correct 48 ms 7016 KB Output is correct
47 Correct 21 ms 3800 KB Output is correct
48 Correct 75 ms 4816 KB Output is correct
49 Correct 99 ms 8348 KB Output is correct
50 Correct 96 ms 11332 KB Output is correct
51 Correct 102 ms 12496 KB Output is correct
52 Correct 27 ms 5984 KB Output is correct
53 Correct 47 ms 7228 KB Output is correct
54 Correct 82 ms 13464 KB Output is correct
55 Correct 44 ms 11208 KB Output is correct
56 Correct 57 ms 1400 KB Output is correct
57 Correct 368 ms 2260 KB Output is correct
58 Correct 1226 ms 3284 KB Output is correct
59 Correct 2626 ms 4696 KB Output is correct
60 Correct 3951 ms 5964 KB Output is correct
61 Correct 3183 ms 6224 KB Output is correct
62 Correct 1744 ms 7352 KB Output is correct
63 Correct 582 ms 8140 KB Output is correct
64 Correct 413 ms 8908 KB Output is correct
65 Correct 419 ms 8908 KB Output is correct
66 Correct 532 ms 9164 KB Output is correct
67 Correct 2272 ms 9624 KB Output is correct
68 Execution timed out 4061 ms 8920 KB Time limit exceeded
69 Halted 0 ms 0 KB -