oj.uz

Submission #259253

# Submission time Handle Problem Language Result Execution time Memory
259253 2020-08-07T13:14:37 Z 문홍윤(#5063) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 120968 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#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;

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

priority_queue<LL> pq, del;
inline void dlt(LL a){del.push(a);}
inline void in(LL a){pq.push(a);}
inline LL tp(){
    while(!del.empty()){
        if(del.top()==pq.top()){
            del.pop(); pq.pop();
        }
        else break;
    }
    return pq.top();
}

inline void ins(int num){
    num=arr[num];
    dlt((LL)cha[num]*cnt[num]);
    cnt[num]++;
    in((LL)cha[num]*cnt[num]);
}
inline void er(int num){
    num=arr[num];
    dlt((LL)cha[num]*cnt[num]);
    cnt[num]--;
    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++)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]=tp();
    }
    for(int i=1; i<=q; i++)printf("%lld\n", ans[i]);
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<=id.size(); i++)in(0ll);
                  ~^~~~~~~~~~~
historic.cpp:50: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:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
historic.cpp:63: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 115 ms 1524 KB Output is correct
22 Correct 103 ms 2280 KB Output is correct
23 Correct 107 ms 1016 KB Output is correct
24 Correct 106 ms 1268 KB Output is correct
25 Correct 75 ms 4692 KB Output is correct
26 Correct 85 ms 4692 KB Output is correct
27 Correct 89 ms 3808 KB Output is correct
28 Correct 76 ms 4564 KB Output is correct
29 Correct 90 ms 4204 KB Output is correct
30 Correct 95 ms 3808 KB Output is correct
31 Correct 109 ms 1360 KB Output is correct
32 Correct 94 ms 896 KB Output is correct
33 Correct 95 ms 3812 KB Output is correct
34 Correct 99 ms 6988 KB Output is correct
35 Correct 64 ms 6992 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 13 ms 1528 KB Output is correct
10 Correct 26 ms 896 KB Output is correct
11 Correct 111 ms 5736 KB Output is correct
12 Correct 68 ms 3820 KB Output is correct
13 Correct 82 ms 5608 KB Output is correct
14 Correct 99 ms 5736 KB Output is correct
15 Correct 115 ms 8292 KB Output is correct
16 Correct 69 ms 8036 KB Output is correct
17 Correct 39 ms 4540 KB Output is correct
18 Correct 71 ms 8164 KB Output is correct
19 Correct 64 ms 9444 KB Output is correct
20 Correct 38 ms 6248 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 115 ms 1524 KB Output is correct
22 Correct 103 ms 2280 KB Output is correct
23 Correct 107 ms 1016 KB Output is correct
24 Correct 106 ms 1268 KB Output is correct
25 Correct 75 ms 4692 KB Output is correct
26 Correct 85 ms 4692 KB Output is correct
27 Correct 89 ms 3808 KB Output is correct
28 Correct 76 ms 4564 KB Output is correct
29 Correct 90 ms 4204 KB Output is correct
30 Correct 95 ms 3808 KB Output is correct
31 Correct 109 ms 1360 KB Output is correct
32 Correct 94 ms 896 KB Output is correct
33 Correct 95 ms 3812 KB Output is correct
34 Correct 99 ms 6988 KB Output is correct
35 Correct 64 ms 6992 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 13 ms 1528 KB Output is correct
45 Correct 26 ms 896 KB Output is correct
46 Correct 111 ms 5736 KB Output is correct
47 Correct 68 ms 3820 KB Output is correct
48 Correct 82 ms 5608 KB Output is correct
49 Correct 99 ms 5736 KB Output is correct
50 Correct 115 ms 8292 KB Output is correct
51 Correct 69 ms 8036 KB Output is correct
52 Correct 39 ms 4540 KB Output is correct
53 Correct 71 ms 8164 KB Output is correct
54 Correct 64 ms 9444 KB Output is correct
55 Correct 38 ms 6248 KB Output is correct
56 Correct 333 ms 1724 KB Output is correct
57 Correct 1066 ms 8444 KB Output is correct
58 Correct 1798 ms 51420 KB Output is correct
59 Correct 3203 ms 101408 KB Output is correct
60 Correct 3771 ms 120968 KB Output is correct
61 Execution timed out 4061 ms 52852 KB Time limit exceeded
62 Halted 0 ms 0 KB -