oj.uz

Submission #423482

# Submission time Handle Problem Language Result Execution time Memory
423482 2021-06-11T07:57:09 Z 조영욱(#7649) Financial Report (JOI21_financial) C++17
100 / 100
 644 ms 43824 KB 
#include <bits/stdc++.h>
using namespace std;

int arr[300001];
int n,d;

const int sz=524288;
vector<int> pr;
int seg[sz*2];

int sum(int l,int r,int node=1,int nodel=0,int noder=sz-1) {
    if (l>r) {
        return 0;
    }
    if (r<nodel||l>noder) {
        return 0;
    }
    if (l<=nodel&&noder<=r) {
        return seg[node];
    }
    int mid=(nodel+noder)/2;
    return max(sum(l,r,node*2,nodel,mid),sum(l,r,node*2+1,mid+1,noder));
}

void update(int i,int val) {
    i+=sz;
    seg[i]=max(seg[i],val);
    while (i>1) {
        i/=2;
        seg[i]=max(seg[i*2],seg[i*2+1]);
    }
}

int le[300001];
int ri[300001];
vector<int> pos[300000];
int lim[300001];
int dp[300001];
int save[300001];
int p1[300001];
int p2[300001];

int find1(int a) {
    return p1[a]<0?a:p1[a]=find1(p1[a]);
}

void merge1(int a,int b) {
    a=find1(a);
    b=find1(b);
    if (a==b) {
        return;
    }
    if (a>b) {
        swap(a,b);
    }
    p1[b]=a;
}

int find2(int a) {
    return p2[a]<0?a:p2[a]=find2(p2[a]);
}

void merge2(int a,int b) {
    a=find2(a);
    b=find2(b);
    if (a==b) {
        return;
    }
    if (a<b) {
        swap(a,b);
    }
    p2[b]=a;
}

int ans(int ind) {
    if (ind==n) {
        return 1;
    }
    if (dp[ind]!=-1) {
        return dp[ind];
    }
    int mx=ind+d;
    int ret=1;
    for(int i=ind+1;i<=n;i++) {
        if (i>mx) {
            break;
        }
        if (arr[i]>arr[ind]) {
            ret=max(ret,ans(i)+1);
        }
        else {
            mx=i+d;
        }
    }
    return dp[ind]=ret;
}

int main(void) {
    scanf("%d %d",&n,&d);
    //n=5000;
    //d=rand()%n+1;
    memset(p1,-1,sizeof(p1));
    memset(p2,-1,sizeof(p2));
    for(int i=1;i<=n;i++) {
        scanf("%d",&arr[i]);
        //arr[i]=rand()%n;
        pr.push_back(arr[i]);
    }
    sort(pr.begin(),pr.end());
    pr.erase(unique(pr.begin(),pr.end()),pr.end());
    le[0]=1;
    for(int i=1;i<=n;i++) {
        arr[i]=lower_bound(pr.begin(),pr.end(),arr[i])-pr.begin();
        pos[arr[i]].push_back(i);
        le[i]=i+1;
        ri[i]=i;
    }
    set<int> s;
    int ret=0;
    for(int i=pr.size()-1;i>=0;i--) {
        //printf("%d\n",s.size());
        /*printf(".");
        for(auto now:s) {
            printf("%d ",now);
        }
        printf("\n");*/
        for(int j=0;j<pos[i].size();j++) {
            int now=pos[i][j];
            auto iter=s.lower_bound(now+d);
            if (iter!=s.end())
                lim[now]=(*iter);
            else
                lim[now]=n;
            //printf("%d %d %d\n",now+1,lim[now],sum(now+1,lim[now]));
            dp[now]=sum(now+1,lim[now])+1;
            save[now]=dp[now];
            ret=max(ret,dp[now]);
        }
        for(int j=0;j<pos[i].size();j++) {
            int now=pos[i][j];
            update(now,dp[now]);
            //printf("%d %d\n",now,dp[now]);
            if (now!=1&&arr[now-1]>=arr[now]) {
                merge1(now-1,now);
                merge2(now-1,now);
            }
            if (now!=n&&arr[now+1]>=arr[now]) {
                merge1(now,now+1);
                merge2(now,now+1);
            }
            if (find2(now)-find1(now)+1>=d) {
                s.insert(find1(now)+d-1);
            }
        }
    }
    printf("%d ",ret);
    /*ret=0;
    memset(dp,-1,sizeof(dp));
    for(int i=1;i<=n;i++) {
        ret=max(ret,ans(i));
    }
    printf("%d\n",ret);
    for(int i=1;i<=n;i++) {
        printf("%d %d\n",save[i],ans(i));
    }*/
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:127:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |         for(int j=0;j<pos[i].size();j++) {
      |                     ~^~~~~~~~~~~~~~
Main.cpp:139:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |         for(int j=0;j<pos[i].size();j++) {
      |                     ~^~~~~~~~~~~~~~
Main.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |     scanf("%d %d",&n,&d);
      |     ~~~~~^~~~~~~~~~~~~~~
Main.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         scanf("%d",&arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9712 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9768 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9700 KB Output is correct
22 Correct 6 ms 9776 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 5 ms 9676 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9712 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9768 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9700 KB Output is correct
22 Correct 6 ms 9776 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 5 ms 9676 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9796 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9804 KB Output is correct
34 Correct 6 ms 9796 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9680 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9772 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9712 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9768 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9700 KB Output is correct
22 Correct 6 ms 9776 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 5 ms 9676 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9796 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9804 KB Output is correct
34 Correct 6 ms 9796 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9680 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9772 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 13 ms 10244 KB Output is correct
42 Correct 12 ms 10208 KB Output is correct
43 Correct 10 ms 10048 KB Output is correct
44 Correct 11 ms 10060 KB Output is correct
45 Correct 11 ms 10060 KB Output is correct
46 Correct 12 ms 10208 KB Output is correct
47 Correct 12 ms 10316 KB Output is correct
48 Correct 13 ms 10180 KB Output is correct
49 Correct 12 ms 10216 KB Output is correct
50 Correct 12 ms 10188 KB Output is correct
51 Correct 14 ms 10316 KB Output is correct
52 Correct 12 ms 10268 KB Output is correct
53 Correct 11 ms 10316 KB Output is correct
54 Correct 13 ms 10244 KB Output is correct
55 Correct 12 ms 10224 KB Output is correct
56 Correct 12 ms 10220 KB Output is correct
57 Correct 12 ms 10220 KB Output is correct
58 Correct 10 ms 10268 KB Output is correct
59 Correct 10 ms 10316 KB Output is correct
60 Correct 12 ms 10208 KB Output is correct
61 Correct 11 ms 10188 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 21520 KB Output is correct
2 Correct 264 ms 27648 KB Output is correct
3 Correct 424 ms 28880 KB Output is correct
4 Correct 639 ms 35312 KB Output is correct
5 Correct 475 ms 38604 KB Output is correct
6 Correct 644 ms 36652 KB Output is correct
7 Correct 291 ms 43492 KB Output is correct
8 Correct 240 ms 29544 KB Output is correct
9 Correct 254 ms 39748 KB Output is correct
10 Correct 256 ms 34808 KB Output is correct
11 Correct 376 ms 36656 KB Output is correct
12 Correct 438 ms 36704 KB Output is correct
13 Correct 524 ms 43824 KB Output is correct
14 Correct 402 ms 29932 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 21552 KB Output is correct
2 Correct 336 ms 21756 KB Output is correct
3 Correct 354 ms 22384 KB Output is correct
4 Correct 465 ms 29664 KB Output is correct
5 Correct 386 ms 29752 KB Output is correct
6 Correct 474 ms 29660 KB Output is correct
7 Correct 227 ms 29560 KB Output is correct
8 Correct 234 ms 29596 KB Output is correct
9 Correct 270 ms 29456 KB Output is correct
10 Correct 343 ms 29700 KB Output is correct
11 Correct 414 ms 29672 KB Output is correct
12 Correct 331 ms 29688 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9712 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 5 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9768 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9700 KB Output is correct
22 Correct 6 ms 9776 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 5 ms 9676 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 6 ms 9676 KB Output is correct
27 Correct 6 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 7 ms 9796 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9804 KB Output is correct
34 Correct 6 ms 9796 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9680 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9772 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 13 ms 10244 KB Output is correct
42 Correct 12 ms 10208 KB Output is correct
43 Correct 10 ms 10048 KB Output is correct
44 Correct 11 ms 10060 KB Output is correct
45 Correct 11 ms 10060 KB Output is correct
46 Correct 12 ms 10208 KB Output is correct
47 Correct 12 ms 10316 KB Output is correct
48 Correct 13 ms 10180 KB Output is correct
49 Correct 12 ms 10216 KB Output is correct
50 Correct 12 ms 10188 KB Output is correct
51 Correct 14 ms 10316 KB Output is correct
52 Correct 12 ms 10268 KB Output is correct
53 Correct 11 ms 10316 KB Output is correct
54 Correct 13 ms 10244 KB Output is correct
55 Correct 12 ms 10224 KB Output is correct
56 Correct 12 ms 10220 KB Output is correct
57 Correct 12 ms 10220 KB Output is correct
58 Correct 10 ms 10268 KB Output is correct
59 Correct 10 ms 10316 KB Output is correct
60 Correct 12 ms 10208 KB Output is correct
61 Correct 11 ms 10188 KB Output is correct
62 Correct 201 ms 21520 KB Output is correct
63 Correct 264 ms 27648 KB Output is correct
64 Correct 424 ms 28880 KB Output is correct
65 Correct 639 ms 35312 KB Output is correct
66 Correct 475 ms 38604 KB Output is correct
67 Correct 644 ms 36652 KB Output is correct
68 Correct 291 ms 43492 KB Output is correct
69 Correct 240 ms 29544 KB Output is correct
70 Correct 254 ms 39748 KB Output is correct
71 Correct 256 ms 34808 KB Output is correct
72 Correct 376 ms 36656 KB Output is correct
73 Correct 438 ms 36704 KB Output is correct
74 Correct 524 ms 43824 KB Output is correct
75 Correct 402 ms 29932 KB Output is correct
76 Correct 211 ms 21552 KB Output is correct
77 Correct 336 ms 21756 KB Output is correct
78 Correct 354 ms 22384 KB Output is correct
79 Correct 465 ms 29664 KB Output is correct
80 Correct 386 ms 29752 KB Output is correct
81 Correct 474 ms 29660 KB Output is correct
82 Correct 227 ms 29560 KB Output is correct
83 Correct 234 ms 29596 KB Output is correct
84 Correct 270 ms 29456 KB Output is correct
85 Correct 343 ms 29700 KB Output is correct
86 Correct 414 ms 29672 KB Output is correct
87 Correct 331 ms 29688 KB Output is correct
88 Correct 477 ms 26488 KB Output is correct
89 Correct 554 ms 33036 KB Output is correct
90 Correct 457 ms 24388 KB Output is correct
91 Correct 493 ms 29720 KB Output is correct
92 Correct 275 ms 22292 KB Output is correct
93 Correct 336 ms 22136 KB Output is correct
94 Correct 500 ms 26808 KB Output is correct
95 Correct 486 ms 35416 KB Output is correct
96 Correct 453 ms 31800 KB Output is correct
97 Correct 513 ms 30000 KB Output is correct
98 Correct 486 ms 29960 KB Output is correct
99 Correct 468 ms 29672 KB Output is correct
100 Correct 462 ms 29672 KB Output is correct
101 Correct 241 ms 36648 KB Output is correct
102 Correct 236 ms 30872 KB Output is correct
103 Correct 276 ms 29744 KB Output is correct
104 Correct 314 ms 29692 KB Output is correct
105 Correct 332 ms 29680 KB Output is correct
106 Correct 313 ms 29884 KB Output is correct
107 Correct 326 ms 29580 KB Output is correct
108 Correct 430 ms 29676 KB Output is correct
109 Correct 449 ms 43620 KB Output is correct
110 Correct 495 ms 31964 KB Output is correct
111 Correct 406 ms 29880 KB Output is correct
112 Correct 364 ms 31996 KB Output is correct
113 Correct 439 ms 29672 KB Output is correct
114 Correct 414 ms 29692 KB Output is correct
115 Correct 229 ms 34324 KB Output is correct
116 Correct 252 ms 34316 KB Output is correct
117 Correct 260 ms 31900 KB Output is correct
118 Correct 264 ms 31948 KB Output is correct
119 Correct 336 ms 29652 KB Output is correct
120 Correct 297 ms 29656 KB Output is correct