oj.uz

답안 #486378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486378 2021-11-11T13:20:13 Z leinad2 역사적 조사 (JOI14_historical) C++17
100 / 100
 1529 ms 7944 KB 
#include<bits/stdc++.h>
using namespace std;
int n, q, i, j, k, a, b, B, inv[100010], A[100010], cnt[100010];
vector<int>comp;
long long ans[100010], seg[400010];
struct query
{
    int i, l, r;
};
vector<query>Q;
bool cmp(query a, query b)
{
    if(a.l/B==b.l/B)return a.r<b.r;
    else return a.l/B<b.l/B;
}
void update(int x, long long v)
{
    x+=n;seg[x]=v;
    for(;x>1;x>>=1)seg[x>>1]=max(seg[x], seg[x^1]);
}
void add(int i)
{
    cnt[A[i]]++;
    update(A[i], 1LL*cnt[A[i]]*inv[A[i]]);
}
void del(int i)
{
    cnt[A[i]]--;
    update(A[i], 1LL*cnt[A[i]]*inv[A[i]]);
}
main()
{
    for(scanf("%d %d", &n, &q);i++<n;)
    {
        scanf("%d", &A[i]);
        comp.push_back(A[i]);
    }
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    for(i=0;i++<n;)
    {
        a=lower_bound(comp.begin(), comp.end(), A[i])-comp.begin()+1;
        inv[a]=A[i];
        A[i]=a;
    }
    B=(int)sqrt(n);
    for(i=0;i++<q;)
    {
        scanf("%d %d", &a, &b);
        Q.push_back({i, a, b});
    }
    sort(Q.begin(), Q.end(), cmp);
    for(i=Q[0].l;i<=Q[0].r;i++)add(i);
    ans[Q[0].i]=seg[1];
    for(i=1;i<q;i++)
    {
        if(Q[i].l<Q[i-1].l)for(j=Q[i-1].l-1;j>=Q[i].l;j--)add(j);
        else for(j=Q[i-1].l;j<Q[i].l;j++)del(j);
        if(Q[i].r>Q[i-1].r)for(j=Q[i-1].r+1;j<=Q[i].r;j++)add(j);
        else for(j=Q[i-1].r;j>Q[i].r;j--)del(j);
        ans[Q[i].i]=seg[1];
    }
    for(i=0;i++<q;)printf("%lld\n", ans[i]);
}

Compilation message

historic.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main()
      | ^~~~
historic.cpp: In function 'int main()':
historic.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     for(scanf("%d %d", &n, &q);i++<n;)
      |         ~~~~~^~~~~~~~~~~~~~~~~
historic.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         scanf("%d", &A[i]);
      |         ~~~~~^~~~~~~~~~~~~
historic.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 6 ms 484 KB Output is correct
21 Correct 11 ms 596 KB Output is correct
22 Correct 11 ms 588 KB Output is correct
23 Correct 11 ms 588 KB Output is correct
24 Correct 11 ms 588 KB Output is correct
25 Correct 11 ms 616 KB Output is correct
26 Correct 11 ms 620 KB Output is correct
27 Correct 11 ms 612 KB Output is correct
28 Correct 11 ms 588 KB Output is correct
29 Correct 14 ms 608 KB Output is correct
30 Correct 13 ms 612 KB Output is correct
31 Correct 14 ms 596 KB Output is correct
32 Correct 14 ms 588 KB Output is correct
33 Correct 12 ms 604 KB Output is correct
34 Correct 11 ms 628 KB Output is correct
35 Correct 13 ms 632 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 4 ms 500 KB Output is correct
9 Correct 8 ms 736 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 65 ms 3644 KB Output is correct
12 Correct 26 ms 1232 KB Output is correct
13 Correct 42 ms 2152 KB Output is correct
14 Correct 66 ms 3880 KB Output is correct
15 Correct 95 ms 5696 KB Output is correct
16 Correct 64 ms 5316 KB Output is correct
17 Correct 35 ms 2252 KB Output is correct
18 Correct 64 ms 3612 KB Output is correct
19 Correct 64 ms 6148 KB Output is correct
20 Correct 40 ms 4284 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 6 ms 484 KB Output is correct
21 Correct 11 ms 596 KB Output is correct
22 Correct 11 ms 588 KB Output is correct
23 Correct 11 ms 588 KB Output is correct
24 Correct 11 ms 588 KB Output is correct
25 Correct 11 ms 616 KB Output is correct
26 Correct 11 ms 620 KB Output is correct
27 Correct 11 ms 612 KB Output is correct
28 Correct 11 ms 588 KB Output is correct
29 Correct 14 ms 608 KB Output is correct
30 Correct 13 ms 612 KB Output is correct
31 Correct 14 ms 596 KB Output is correct
32 Correct 14 ms 588 KB Output is correct
33 Correct 12 ms 604 KB Output is correct
34 Correct 11 ms 628 KB Output is correct
35 Correct 13 ms 632 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 4 ms 500 KB Output is correct
44 Correct 8 ms 736 KB Output is correct
45 Correct 9 ms 852 KB Output is correct
46 Correct 65 ms 3644 KB Output is correct
47 Correct 26 ms 1232 KB Output is correct
48 Correct 42 ms 2152 KB Output is correct
49 Correct 66 ms 3880 KB Output is correct
50 Correct 95 ms 5696 KB Output is correct
51 Correct 64 ms 5316 KB Output is correct
52 Correct 35 ms 2252 KB Output is correct
53 Correct 64 ms 3612 KB Output is correct
54 Correct 64 ms 6148 KB Output is correct
55 Correct 40 ms 4284 KB Output is correct
56 Correct 29 ms 836 KB Output is correct
57 Correct 88 ms 1164 KB Output is correct
58 Correct 179 ms 1548 KB Output is correct
59 Correct 296 ms 2156 KB Output is correct
60 Correct 396 ms 2652 KB Output is correct
61 Correct 473 ms 2884 KB Output is correct
62 Correct 574 ms 3508 KB Output is correct
63 Correct 748 ms 3956 KB Output is correct
64 Correct 841 ms 6272 KB Output is correct
65 Correct 1032 ms 6228 KB Output is correct
66 Correct 989 ms 6328 KB Output is correct
67 Correct 1034 ms 6412 KB Output is correct
68 Correct 1061 ms 6720 KB Output is correct
69 Correct 1346 ms 7364 KB Output is correct
70 Correct 1529 ms 7944 KB Output is correct
71 Correct 1388 ms 7648 KB Output is correct
72 Correct 1313 ms 7536 KB Output is correct
73 Correct 1263 ms 7440 KB Output is correct
74 Correct 1275 ms 7388 KB Output is correct
75 Correct 1304 ms 7324 KB Output is correct
76 Correct 1292 ms 7280 KB Output is correct
77 Correct 1243 ms 7232 KB Output is correct
78 Correct 1202 ms 7204 KB Output is correct
79 Correct 1200 ms 7308 KB Output is correct
80 Correct 1002 ms 7004 KB Output is correct