oj.uz

Submission #826947

# Submission time Handle Problem Language Result Execution time Memory
826947 2023-08-16T07:16:33 Z vjudge1 Financial Report (JOI21_financial) C++14
100 / 100
 458 ms 27056 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = (1 << 19) ;
int n, d, ans, dp[N + 1], p[N + 1], kol[N + 1], mn[2 * N + 1], mx[2 * N + 1] ;
pair<int, int> a[N + 1] ;
int get(int a)
{
    while(a != p[a])
        a = p[a] ;
    return a ;
}
void join(int a, int b)
{
    a = get(a) ;
    b = get(b) ;
    if(a == b)
        return ;
    if(kol[a] > kol[b])
        swap(a, b) ;
    mn[b] = min(mn[a], mn[b]) ;
    kol[b] += kol[a] ;
    kol[a] = 0 ;
    p[a] = b ;
}
int get_min(int a)
{
    a = get(a) ;
    return mn[a] ;
}
void update(int l, int r, int ind, int num, int v)
{
    if(l > ind || r < ind)
        return ;
    if(l == r)
    {
        mx[v] = num ;
        return ;
    }
    int mid = (l + r) >> 1 ;
    update(l, mid, ind, num, v * 2) ;
    update(mid + 1, r, ind, num, v * 2 + 1) ;
    mx[v] = max(mx[v * 2], mx[v * 2 + 1]) ;
}
int get_max(int l, int r, int l1, int r1, int v)
{
    if(l > r1 || r < l1)
        return 0 ;
    if(l1 <= l && r <= r1)
        return mx[v] ;
    int mid = (l + r) >> 1 ;
    return max(get_max(l, mid, l1, r1, v * 2), get_max(mid + 1, r, l1, r1, v * 2 + 1)) ;
}
bool cmp(pair<int, int> p1, pair<int, int> p2)
{
    if(p1.fi != p2.fi)
        return p1.fi < p2.fi ;
    else
        return p1.se > p2.se ;
}
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n >> d ;
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> a[i].fi ;
        p[i] = i ;
        mn[i] = i ;
        kol[i] = 1 ;
        a[i].se = i ;
    }
    sort(a + 1, a + n + 1, cmp) ;
    set<int> all ;
    for(int i = 1 ; i <= n ; i++)
    {
        auto it = all.lower_bound(a[i].se) ;
        if(it != all.end() && *it - d <= a[i].se)
            join(*it, a[i].se) ;
        if(it != all.begin() && *--it + d >= a[i].se)
            join(*it, a[i].se) ;
        int num = get_max(1, N, get_min(a[i].se), a[i].se, 1) ;
        dp[a[i].se] = num + 1 ;
        update(1, N, a[i].se, num + 1, 1) ;
        ans = max(ans, dp[a[i].se]) ;
        all.insert(a[i].se) ;
    }
    cout << ans ;
    return 0 ;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 980 KB Output is correct
42 Correct 5 ms 980 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 6 ms 852 KB Output is correct
46 Correct 8 ms 980 KB Output is correct
47 Correct 5 ms 984 KB Output is correct
48 Correct 5 ms 980 KB Output is correct
49 Correct 8 ms 976 KB Output is correct
50 Correct 7 ms 944 KB Output is correct
51 Correct 5 ms 980 KB Output is correct
52 Correct 7 ms 980 KB Output is correct
53 Correct 4 ms 980 KB Output is correct
54 Correct 6 ms 980 KB Output is correct
55 Correct 5 ms 980 KB Output is correct
56 Correct 5 ms 980 KB Output is correct
57 Correct 7 ms 980 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 4 ms 980 KB Output is correct
60 Correct 6 ms 976 KB Output is correct
61 Correct 4 ms 976 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 26688 KB Output is correct
2 Correct 215 ms 26320 KB Output is correct
3 Correct 312 ms 26728 KB Output is correct
4 Correct 406 ms 26712 KB Output is correct
5 Correct 340 ms 26700 KB Output is correct
6 Correct 458 ms 26640 KB Output is correct
7 Correct 186 ms 26456 KB Output is correct
8 Correct 196 ms 26700 KB Output is correct
9 Correct 180 ms 26712 KB Output is correct
10 Correct 181 ms 26736 KB Output is correct
11 Correct 256 ms 26652 KB Output is correct
12 Correct 275 ms 26680 KB Output is correct
13 Correct 333 ms 26756 KB Output is correct
14 Correct 389 ms 26768 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 27056 KB Output is correct
2 Correct 367 ms 26732 KB Output is correct
3 Correct 337 ms 26632 KB Output is correct
4 Correct 431 ms 26704 KB Output is correct
5 Correct 344 ms 26696 KB Output is correct
6 Correct 330 ms 26764 KB Output is correct
7 Correct 187 ms 26632 KB Output is correct
8 Correct 224 ms 26720 KB Output is correct
9 Correct 183 ms 26580 KB Output is correct
10 Correct 252 ms 26612 KB Output is correct
11 Correct 351 ms 26700 KB Output is correct
12 Correct 350 ms 26844 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 980 KB Output is correct
42 Correct 5 ms 980 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 6 ms 852 KB Output is correct
46 Correct 8 ms 980 KB Output is correct
47 Correct 5 ms 984 KB Output is correct
48 Correct 5 ms 980 KB Output is correct
49 Correct 8 ms 976 KB Output is correct
50 Correct 7 ms 944 KB Output is correct
51 Correct 5 ms 980 KB Output is correct
52 Correct 7 ms 980 KB Output is correct
53 Correct 4 ms 980 KB Output is correct
54 Correct 6 ms 980 KB Output is correct
55 Correct 5 ms 980 KB Output is correct
56 Correct 5 ms 980 KB Output is correct
57 Correct 7 ms 980 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 4 ms 980 KB Output is correct
60 Correct 6 ms 976 KB Output is correct
61 Correct 4 ms 976 KB Output is correct
62 Correct 195 ms 26688 KB Output is correct
63 Correct 215 ms 26320 KB Output is correct
64 Correct 312 ms 26728 KB Output is correct
65 Correct 406 ms 26712 KB Output is correct
66 Correct 340 ms 26700 KB Output is correct
67 Correct 458 ms 26640 KB Output is correct
68 Correct 186 ms 26456 KB Output is correct
69 Correct 196 ms 26700 KB Output is correct
70 Correct 180 ms 26712 KB Output is correct
71 Correct 181 ms 26736 KB Output is correct
72 Correct 256 ms 26652 KB Output is correct
73 Correct 275 ms 26680 KB Output is correct
74 Correct 333 ms 26756 KB Output is correct
75 Correct 389 ms 26768 KB Output is correct
76 Correct 193 ms 27056 KB Output is correct
77 Correct 367 ms 26732 KB Output is correct
78 Correct 337 ms 26632 KB Output is correct
79 Correct 431 ms 26704 KB Output is correct
80 Correct 344 ms 26696 KB Output is correct
81 Correct 330 ms 26764 KB Output is correct
82 Correct 187 ms 26632 KB Output is correct
83 Correct 224 ms 26720 KB Output is correct
84 Correct 183 ms 26580 KB Output is correct
85 Correct 252 ms 26612 KB Output is correct
86 Correct 351 ms 26700 KB Output is correct
87 Correct 350 ms 26844 KB Output is correct
88 Correct 366 ms 26736 KB Output is correct
89 Correct 380 ms 26748 KB Output is correct
90 Correct 391 ms 26688 KB Output is correct
91 Correct 393 ms 26728 KB Output is correct
92 Correct 308 ms 26648 KB Output is correct
93 Correct 372 ms 26868 KB Output is correct
94 Correct 392 ms 26652 KB Output is correct
95 Correct 325 ms 26692 KB Output is correct
96 Correct 419 ms 26716 KB Output is correct
97 Correct 400 ms 26668 KB Output is correct
98 Correct 411 ms 26760 KB Output is correct
99 Correct 375 ms 26704 KB Output is correct
100 Correct 378 ms 26692 KB Output is correct
101 Correct 199 ms 26644 KB Output is correct
102 Correct 190 ms 26728 KB Output is correct
103 Correct 202 ms 26736 KB Output is correct
104 Correct 225 ms 26664 KB Output is correct
105 Correct 285 ms 26712 KB Output is correct
106 Correct 244 ms 26764 KB Output is correct
107 Correct 288 ms 26660 KB Output is correct
108 Correct 402 ms 26728 KB Output is correct
109 Correct 254 ms 26700 KB Output is correct
110 Correct 365 ms 26700 KB Output is correct
111 Correct 367 ms 26664 KB Output is correct
112 Correct 240 ms 26644 KB Output is correct
113 Correct 323 ms 26760 KB Output is correct
114 Correct 366 ms 26756 KB Output is correct
115 Correct 223 ms 26808 KB Output is correct
116 Correct 195 ms 26680 KB Output is correct
117 Correct 255 ms 26700 KB Output is correct
118 Correct 284 ms 26652 KB Output is correct
119 Correct 226 ms 26700 KB Output is correct
120 Correct 225 ms 26644 KB Output is correct