oj.uz

답안 #479397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479397 2021-10-11T15:17:42 Z nicolaalexandra Financial Report (JOI21_financial) C++14
100 / 100
 670 ms 23380 KB 
#include <bits/stdc++.h>
#define DIM 300010
using namespace std;

pair <int,int> v[DIM];
set <int> s;
int t[DIM],poz_min[DIM],aint[DIM*4];
int n,d,i,j;

inline int cmp (pair<int,int> a, pair<int,int> b){
    if (a.first == b.first)
        return a.second > b.second;
    return a.first < b.first;
}

inline int get_rad (int x){
    while (t[x] > 0)
        x = t[x];
    return x;
}


void uneste (int x, int y){

    int radx = get_rad(x), rady = get_rad(y);
    if (radx == rady)
        return;

    if (t[radx] > t[rady])
        swap (radx,rady);

    t[radx] += t[rady];
    t[rady] = radx;

    poz_min[radx] = min (poz_min[radx],poz_min[rady]);
}

void update (int nod, int st, int dr, int poz, int val){
    if (st == dr){
        aint[nod] = val;
        return;
    }
    int mid = (st+dr)>>1;
    if (poz <= mid)
        update (nod<<1,st,mid,poz,val);
    else update ((nod<<1)|1,mid+1,dr,poz,val);

    aint[nod] = max (aint[nod<<1],aint[(nod<<1)|1]);
}

int query (int nod, int st, int dr, int x, int y){
    if (x <= st && dr <= y)
        return aint[nod];

    int mid = (st+dr)>>1, sol_st = 0, sol_dr = 0;
    if (x <= mid)
        sol_st = query (nod<<1,st,mid,x,y);
    if (y > mid)
        sol_dr = query ((nod<<1)|1,mid+1,dr,x,y);
    return max (sol_st,sol_dr);
}

inline int modul (int n){
    return max (n,-n);
}

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>d;
    for (i=1;i<=n;i++){
        cin>>v[i].first;
        v[i].second = i;

        t[i] = -1;
        poz_min[i] = i;
    }

    sort (v+1,v+n+1,cmp);

    for (i=1;i<=n;i++){

        /// fac padurile
        int poz = v[i].second;
        set <int> :: iterator it = s.lower_bound (poz);
        if (it != s.end()){
            if (modul(*it - poz) <= d)
                uneste (*it,poz);
        }
        if (it != s.begin()){
            it--;
            if (modul(*it - poz) <= d)
                uneste (*it,poz);
        }

        s.insert(poz);


        int poz2 = poz_min[get_rad(poz)];

        int val = 1;
        if (poz2 < poz)
            val = max(val, query (1,1,n,poz2,poz) + 1);

        update (1,1,n,poz,val);
    }

    cout<<aint[1];

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 8 ms 916 KB Output is correct
42 Correct 8 ms 796 KB Output is correct
43 Correct 7 ms 716 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 7 ms 800 KB Output is correct
46 Correct 8 ms 716 KB Output is correct
47 Correct 8 ms 716 KB Output is correct
48 Correct 9 ms 716 KB Output is correct
49 Correct 9 ms 716 KB Output is correct
50 Correct 10 ms 716 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 712 KB Output is correct
53 Correct 6 ms 800 KB Output is correct
54 Correct 7 ms 716 KB Output is correct
55 Correct 8 ms 800 KB Output is correct
56 Correct 8 ms 716 KB Output is correct
57 Correct 12 ms 716 KB Output is correct
58 Correct 7 ms 748 KB Output is correct
59 Correct 7 ms 716 KB Output is correct
60 Correct 7 ms 776 KB Output is correct
61 Correct 7 ms 716 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 23244 KB Output is correct
2 Correct 319 ms 23092 KB Output is correct
3 Correct 441 ms 23164 KB Output is correct
4 Correct 537 ms 23108 KB Output is correct
5 Correct 465 ms 23204 KB Output is correct
6 Correct 638 ms 23144 KB Output is correct
7 Correct 325 ms 22944 KB Output is correct
8 Correct 300 ms 23108 KB Output is correct
9 Correct 318 ms 23236 KB Output is correct
10 Correct 272 ms 23172 KB Output is correct
11 Correct 388 ms 23212 KB Output is correct
12 Correct 439 ms 23092 KB Output is correct
13 Correct 503 ms 23240 KB Output is correct
14 Correct 534 ms 23380 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 300 ms 23172 KB Output is correct
2 Correct 479 ms 23228 KB Output is correct
3 Correct 602 ms 23168 KB Output is correct
4 Correct 615 ms 23284 KB Output is correct
5 Correct 518 ms 23152 KB Output is correct
6 Correct 573 ms 23076 KB Output is correct
7 Correct 334 ms 23224 KB Output is correct
8 Correct 292 ms 23140 KB Output is correct
9 Correct 330 ms 22980 KB Output is correct
10 Correct 374 ms 23028 KB Output is correct
11 Correct 570 ms 23240 KB Output is correct
12 Correct 520 ms 23108 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 8 ms 916 KB Output is correct
42 Correct 8 ms 796 KB Output is correct
43 Correct 7 ms 716 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 7 ms 800 KB Output is correct
46 Correct 8 ms 716 KB Output is correct
47 Correct 8 ms 716 KB Output is correct
48 Correct 9 ms 716 KB Output is correct
49 Correct 9 ms 716 KB Output is correct
50 Correct 10 ms 716 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 712 KB Output is correct
53 Correct 6 ms 800 KB Output is correct
54 Correct 7 ms 716 KB Output is correct
55 Correct 8 ms 800 KB Output is correct
56 Correct 8 ms 716 KB Output is correct
57 Correct 12 ms 716 KB Output is correct
58 Correct 7 ms 748 KB Output is correct
59 Correct 7 ms 716 KB Output is correct
60 Correct 7 ms 776 KB Output is correct
61 Correct 7 ms 716 KB Output is correct
62 Correct 306 ms 23244 KB Output is correct
63 Correct 319 ms 23092 KB Output is correct
64 Correct 441 ms 23164 KB Output is correct
65 Correct 537 ms 23108 KB Output is correct
66 Correct 465 ms 23204 KB Output is correct
67 Correct 638 ms 23144 KB Output is correct
68 Correct 325 ms 22944 KB Output is correct
69 Correct 300 ms 23108 KB Output is correct
70 Correct 318 ms 23236 KB Output is correct
71 Correct 272 ms 23172 KB Output is correct
72 Correct 388 ms 23212 KB Output is correct
73 Correct 439 ms 23092 KB Output is correct
74 Correct 503 ms 23240 KB Output is correct
75 Correct 534 ms 23380 KB Output is correct
76 Correct 300 ms 23172 KB Output is correct
77 Correct 479 ms 23228 KB Output is correct
78 Correct 602 ms 23168 KB Output is correct
79 Correct 615 ms 23284 KB Output is correct
80 Correct 518 ms 23152 KB Output is correct
81 Correct 573 ms 23076 KB Output is correct
82 Correct 334 ms 23224 KB Output is correct
83 Correct 292 ms 23140 KB Output is correct
84 Correct 330 ms 22980 KB Output is correct
85 Correct 374 ms 23028 KB Output is correct
86 Correct 570 ms 23240 KB Output is correct
87 Correct 520 ms 23108 KB Output is correct
88 Correct 535 ms 23096 KB Output is correct
89 Correct 573 ms 23256 KB Output is correct
90 Correct 603 ms 23092 KB Output is correct
91 Correct 594 ms 23108 KB Output is correct
92 Correct 413 ms 23096 KB Output is correct
93 Correct 580 ms 23160 KB Output is correct
94 Correct 578 ms 23168 KB Output is correct
95 Correct 504 ms 23092 KB Output is correct
96 Correct 591 ms 23216 KB Output is correct
97 Correct 608 ms 23108 KB Output is correct
98 Correct 602 ms 23168 KB Output is correct
99 Correct 670 ms 23268 KB Output is correct
100 Correct 608 ms 23220 KB Output is correct
101 Correct 313 ms 23168 KB Output is correct
102 Correct 315 ms 23144 KB Output is correct
103 Correct 339 ms 23156 KB Output is correct
104 Correct 348 ms 23172 KB Output is correct
105 Correct 427 ms 23108 KB Output is correct
106 Correct 369 ms 23108 KB Output is correct
107 Correct 424 ms 23264 KB Output is correct
108 Correct 571 ms 23156 KB Output is correct
109 Correct 431 ms 23108 KB Output is correct
110 Correct 602 ms 23092 KB Output is correct
111 Correct 634 ms 23172 KB Output is correct
112 Correct 427 ms 23236 KB Output is correct
113 Correct 608 ms 23236 KB Output is correct
114 Correct 635 ms 23348 KB Output is correct
115 Correct 348 ms 23236 KB Output is correct
116 Correct 354 ms 23160 KB Output is correct
117 Correct 402 ms 23236 KB Output is correct
118 Correct 416 ms 23288 KB Output is correct
119 Correct 382 ms 23032 KB Output is correct
120 Correct 354 ms 23108 KB Output is correct