oj.uz

답안 #259246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259246 2020-08-07T13:07:18 Z 문홍윤(#5063) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 11496 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)
#define ub(x, v) upper_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2000000000000000000;
const LL mod1=1000000007;
const LL mod2=998244353;
const int inf=2000000000;

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];
multiset<LL> ms;

void ins(int num){
    num=arr[num];
    ms.erase(ms.find((LL)cha[num]*cnt[num]));
    cnt[num]++;
    ms.insert((LL)cha[num]*cnt[num]);
}
void er(int num){
    num=arr[num];
    ms.erase(ms.find((LL)cha[num]*cnt[num]));
    cnt[num]--;
    ms.insert((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.insert(0);
    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.rbegin();
    }
    for(int i=1; i<=q; i++)printf("%lld\n", ans[i]);
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:61:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<=id.size(); i++)ms.insert(0);
                  ~^~~~~~~~~~~
historic.cpp:45: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:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
historic.cpp:58: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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 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 3 ms 384 KB Output is correct
18 Correct 7 ms 384 KB Output is correct
19 Correct 17 ms 512 KB Output is correct
20 Correct 53 ms 632 KB Output is correct
21 Correct 85 ms 760 KB Output is correct
22 Correct 97 ms 760 KB Output is correct
23 Correct 71 ms 768 KB Output is correct
24 Correct 70 ms 740 KB Output is correct
25 Correct 124 ms 760 KB Output is correct
26 Correct 124 ms 888 KB Output is correct
27 Correct 115 ms 768 KB Output is correct
28 Correct 117 ms 768 KB Output is correct
29 Correct 110 ms 768 KB Output is correct
30 Correct 112 ms 768 KB Output is correct
31 Correct 71 ms 768 KB Output is correct
32 Correct 36 ms 768 KB Output is correct
33 Correct 120 ms 776 KB Output is correct
34 Correct 124 ms 888 KB Output is correct
35 Correct 119 ms 768 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 11 ms 768 KB Output is correct
9 Correct 25 ms 1152 KB Output is correct
10 Correct 16 ms 1152 KB Output is correct
11 Correct 90 ms 6000 KB Output is correct
12 Correct 69 ms 2044 KB Output is correct
13 Correct 98 ms 3456 KB Output is correct
14 Correct 145 ms 6764 KB Output is correct
15 Correct 157 ms 10040 KB Output is correct
16 Correct 153 ms 9964 KB Output is correct
17 Correct 56 ms 3184 KB Output is correct
18 Correct 83 ms 5864 KB Output is correct
19 Correct 126 ms 11496 KB Output is correct
20 Correct 84 ms 8432 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 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 3 ms 384 KB Output is correct
18 Correct 7 ms 384 KB Output is correct
19 Correct 17 ms 512 KB Output is correct
20 Correct 53 ms 632 KB Output is correct
21 Correct 85 ms 760 KB Output is correct
22 Correct 97 ms 760 KB Output is correct
23 Correct 71 ms 768 KB Output is correct
24 Correct 70 ms 740 KB Output is correct
25 Correct 124 ms 760 KB Output is correct
26 Correct 124 ms 888 KB Output is correct
27 Correct 115 ms 768 KB Output is correct
28 Correct 117 ms 768 KB Output is correct
29 Correct 110 ms 768 KB Output is correct
30 Correct 112 ms 768 KB Output is correct
31 Correct 71 ms 768 KB Output is correct
32 Correct 36 ms 768 KB Output is correct
33 Correct 120 ms 776 KB Output is correct
34 Correct 124 ms 888 KB Output is correct
35 Correct 119 ms 768 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 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 384 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 11 ms 768 KB Output is correct
44 Correct 25 ms 1152 KB Output is correct
45 Correct 16 ms 1152 KB Output is correct
46 Correct 90 ms 6000 KB Output is correct
47 Correct 69 ms 2044 KB Output is correct
48 Correct 98 ms 3456 KB Output is correct
49 Correct 145 ms 6764 KB Output is correct
50 Correct 157 ms 10040 KB Output is correct
51 Correct 153 ms 9964 KB Output is correct
52 Correct 56 ms 3184 KB Output is correct
53 Correct 83 ms 5864 KB Output is correct
54 Correct 126 ms 11496 KB Output is correct
55 Correct 84 ms 8432 KB Output is correct
56 Correct 214 ms 1108 KB Output is correct
57 Correct 880 ms 1712 KB Output is correct
58 Correct 2101 ms 2548 KB Output is correct
59 Correct 3833 ms 3616 KB Output is correct
60 Execution timed out 4061 ms 3948 KB Time limit exceeded
61 Halted 0 ms 0 KB -