oj.uz

Submission #259250

# Submission time Handle Problem Language Result Execution time Memory
259250 2020-08-07T13:11:37 Z 문홍윤(#5063) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 120972 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

int n, q;
vector<pair<pii, int> > cmp;
pii qu[100010];
int arr[100010], cha[100010];
vector<int> id;
LL ans[100010];
int cnt[100010];

struct MY_MULTISET{
    priority_queue<LL> pq, del;
    void dlt(LL a){del.push(a);}
    void in(LL a){pq.push(a);}
    LL tp(){
        while(del.size()){
            if(del.top()==pq.top()){
                del.pop(); pq.pop();
            }
            else break;
        }
        return pq.top();
    }
}ms;

void ins(int num){
    num=arr[num];
    ms.dlt((LL)cha[num]*cnt[num]);
    cnt[num]++;
    ms.in((LL)cha[num]*cnt[num]);
}
void er(int num){
    num=arr[num];
    ms.dlt((LL)cha[num]*cnt[num]);
    cnt[num]--;
    ms.in((LL)cha[num]*cnt[num]);
}

int main(){
    scanf("%d %d", &n, &q);
    int sq=sqrt(n);
    for(int i=1; i<=n; i++){
        scanf("%d", &arr[i]);
        id.eb(arr[i]);
    }
    svec(id); press(id);
    for(int i=1; i<=n; i++){
        int tmp=lb(id, arr[i])-id.begin()+1;
        cha[tmp]=arr[i];
        arr[i]=tmp;
    }
    for(int i=1; i<=q; i++){
        scanf("%d %d", &qu[i].F, &qu[i].S);
        cmp.eb(mp(qu[i].F/sq, qu[i].S), i);
    }
    for(int i=1; i<=id.size(); i++)ms.in(0ll);
    svec(cmp);
    int l=1, r=0;
    for(auto i:cmp){
        while(qu[i.S].F<l)ins(--l);
        while(qu[i.S].S>r)ins(++r);
        while(qu[i.S].F>l)er(l++);
        while(qu[i.S].S<r)er(r--);
        ans[i.S]=ms.tp();
    }
    for(int i=1; i<=q; i++)printf("%lld\n", ans[i]);
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<=id.size(); i++)ms.in(0ll);
                  ~^~~~~~~~~~~
historic.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &q);
     ~~~~~^~~~~~~~~~~~~~~~~
historic.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
historic.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &qu[i].F, &qu[i].S);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 17 ms 1020 KB Output is correct
20 Correct 53 ms 1472 KB Output is correct
21 Correct 111 ms 1652 KB Output is correct
22 Correct 101 ms 2408 KB Output is correct
23 Correct 105 ms 1144 KB Output is correct
24 Correct 109 ms 1408 KB Output is correct
25 Correct 75 ms 4820 KB Output is correct
26 Correct 83 ms 4820 KB Output is correct
27 Correct 92 ms 3932 KB Output is correct
28 Correct 74 ms 4692 KB Output is correct
29 Correct 91 ms 4192 KB Output is correct
30 Correct 93 ms 3936 KB Output is correct
31 Correct 106 ms 1396 KB Output is correct
32 Correct 91 ms 1016 KB Output is correct
33 Correct 98 ms 3940 KB Output is correct
34 Correct 91 ms 7092 KB Output is correct
35 Correct 70 ms 7136 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 6 ms 1116 KB Output is correct
9 Correct 14 ms 1656 KB Output is correct
10 Correct 27 ms 1024 KB Output is correct
11 Correct 108 ms 5696 KB Output is correct
12 Correct 64 ms 3948 KB Output is correct
13 Correct 78 ms 5732 KB Output is correct
14 Correct 95 ms 5860 KB Output is correct
15 Correct 116 ms 8420 KB Output is correct
16 Correct 68 ms 8156 KB Output is correct
17 Correct 40 ms 4668 KB Output is correct
18 Correct 69 ms 8548 KB Output is correct
19 Correct 70 ms 9588 KB Output is correct
20 Correct 40 ms 6376 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 17 ms 1020 KB Output is correct
20 Correct 53 ms 1472 KB Output is correct
21 Correct 111 ms 1652 KB Output is correct
22 Correct 101 ms 2408 KB Output is correct
23 Correct 105 ms 1144 KB Output is correct
24 Correct 109 ms 1408 KB Output is correct
25 Correct 75 ms 4820 KB Output is correct
26 Correct 83 ms 4820 KB Output is correct
27 Correct 92 ms 3932 KB Output is correct
28 Correct 74 ms 4692 KB Output is correct
29 Correct 91 ms 4192 KB Output is correct
30 Correct 93 ms 3936 KB Output is correct
31 Correct 106 ms 1396 KB Output is correct
32 Correct 91 ms 1016 KB Output is correct
33 Correct 98 ms 3940 KB Output is correct
34 Correct 91 ms 7092 KB Output is correct
35 Correct 70 ms 7136 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 4 ms 768 KB Output is correct
43 Correct 6 ms 1116 KB Output is correct
44 Correct 14 ms 1656 KB Output is correct
45 Correct 27 ms 1024 KB Output is correct
46 Correct 108 ms 5696 KB Output is correct
47 Correct 64 ms 3948 KB Output is correct
48 Correct 78 ms 5732 KB Output is correct
49 Correct 95 ms 5860 KB Output is correct
50 Correct 116 ms 8420 KB Output is correct
51 Correct 68 ms 8156 KB Output is correct
52 Correct 40 ms 4668 KB Output is correct
53 Correct 69 ms 8548 KB Output is correct
54 Correct 70 ms 9588 KB Output is correct
55 Correct 40 ms 6376 KB Output is correct
56 Correct 317 ms 1856 KB Output is correct
57 Correct 1039 ms 8540 KB Output is correct
58 Correct 1740 ms 51356 KB Output is correct
59 Correct 3319 ms 101508 KB Output is correct
60 Correct 3773 ms 120972 KB Output is correct
61 Execution timed out 4078 ms 54044 KB Time limit exceeded
62 Halted 0 ms 0 KB -