oj.uz

Submission #421323

# Submission time Handle Problem Language Result Execution time Memory
421323 2021-06-09T02:59:54 Z kwongweng Financial Report (JOI21_financial) C++17
100 / 100
 523 ms 29264 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second

ll MOD = 1000000007;
ll A = 998244353;

ll power(ll base, ll n){
    if (n == 0) return 1;
    if (n == 1) return base;
    ll halfn = power(base, n/2);
    if (n%2 == 0) return (halfn*halfn)%MOD;
    return (((halfn*halfn)%MOD)*base) % MOD;
}

ll inverse(ll n){
    return power(n, MOD-2);
}

ll add(ll a, ll b){
    return (a+b) % MOD;
}

ll mul(ll a, ll b){
    return (a*b) % MOD;
}

ll gcd(ll a, ll b){
    if (a == 0) return b;
    if (a == 1) return 1;
    return gcd(b%a, a);
}

struct segtree{
    int sz; vi mini;
    void init(int n){
        sz = n;
        mini.assign(4*n, 0);
    }
    void update(int v, int tl, int tr, int pos, int val){
        if (tl == tr){
            mini[v] = val;
            return;
        }
        int tm = (tl + tr)/2;
        if (pos <= tm){
            update(2*v, tl, tm, pos, val);
        }else{
            update(2*v+1, tm+1, tr, pos, val);
        }
        mini[v] = max(mini[2*v], mini[2*v+1]);
    }
    void update(int pos, int val){
        update(1, 0, sz-1, pos, val);
    }
    int get(int v, int tl, int tr, int l, int r){
        if (tl == l && tr == r) return mini[v];
        if (l > r) return 0;
        int tm = (tl + tr)/2;
        return max(get(2*v, tl, tm, l, min(r, tm)), get(2*v+1, tm+1, tr, max(l, tm+1), r));
    }
    int get(int l, int r){
        return get(1, 0, sz-1, l, r);
    }
};
int n, d;
const int N = 300000;
vi p(N);
set<int> st;
int get(int a){
    if (p[a] == a) return a;
    p[a] = get(p[a]);
    return p[a];
}

void add(int a){
    auto it = st.upper_bound(a);
    int b = *it;
    if (it != st.end()){
        if (b - a <= d) p[a] = b;
    }
    if (it != st.begin()){
        --it;
        b = *it;
        if (a - b <= d) p[b] = a;
    }
    st.insert(a);
}

int main(){
    ios::sync_with_stdio(false);
    cin >> n >> d;
    vi a(n); FOR(i, 0, n) cin >> a[i];
    vii b(n); FOR(i, 0, n) b[i] = {a[i], i};
    sort(b.begin(), b.end());
    vi r(n);
    FOR(i, 0, n) p[i] = i;
    for (int i = 0; i < n;){
        int j = i;
        while (j < n && b[j].fi == b[i].fi){
            add(b[j].se);
            j++;
        }
        while (i < j){
            r[b[i].se] = get(b[i].se) + d;
            i++;
        }
    }
    int maxi = 1;
    segtree st;
    st.init(n);
    vi dp(n);
    for (int i = n-1; i >= 0;){
        int j = i;
        while (j >= 0 && b[j].fi == b[i].fi){
            int k = b[j].se; r[k] = min(r[k], n-1);
            dp[k] = st.get(k, r[k]) + 1;
            maxi = max(maxi, dp[k]);
            j--;
        }
        while (i > j){
            int k = b[i].se;
            st.update(k, dp[k]);
            i--;
        }
    }
    cout << maxi << '\n';
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 2 ms 1484 KB Output is correct
25 Correct 1 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct
27 Correct 1 ms 1484 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 1 ms 1484 KB Output is correct
33 Correct 2 ms 1484 KB Output is correct
34 Correct 1 ms 1484 KB Output is correct
35 Correct 1 ms 1484 KB Output is correct
36 Correct 2 ms 1484 KB Output is correct
37 Correct 1 ms 1484 KB Output is correct
38 Correct 1 ms 1484 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 2 ms 1484 KB Output is correct
41 Correct 7 ms 1996 KB Output is correct
42 Correct 8 ms 2024 KB Output is correct
43 Correct 6 ms 1996 KB Output is correct
44 Correct 6 ms 1868 KB Output is correct
45 Correct 7 ms 2044 KB Output is correct
46 Correct 7 ms 1968 KB Output is correct
47 Correct 7 ms 2048 KB Output is correct
48 Correct 8 ms 2124 KB Output is correct
49 Correct 10 ms 2064 KB Output is correct
50 Correct 8 ms 1996 KB Output is correct
51 Correct 7 ms 1996 KB Output is correct
52 Correct 7 ms 2040 KB Output is correct
53 Correct 7 ms 1996 KB Output is correct
54 Correct 8 ms 2000 KB Output is correct
55 Correct 7 ms 1996 KB Output is correct
56 Correct 6 ms 1996 KB Output is correct
57 Correct 7 ms 1996 KB Output is correct
58 Correct 5 ms 1996 KB Output is correct
59 Correct 6 ms 1996 KB Output is correct
60 Correct 6 ms 1996 KB Output is correct
61 Correct 6 ms 1996 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 29228 KB Output is correct
2 Correct 269 ms 27592 KB Output is correct
3 Correct 421 ms 26456 KB Output is correct
4 Correct 507 ms 26180 KB Output is correct
5 Correct 403 ms 26120 KB Output is correct
6 Correct 457 ms 26088 KB Output is correct
7 Correct 260 ms 25952 KB Output is correct
8 Correct 242 ms 25948 KB Output is correct
9 Correct 234 ms 26052 KB Output is correct
10 Correct 231 ms 26128 KB Output is correct
11 Correct 360 ms 26116 KB Output is correct
12 Correct 350 ms 26136 KB Output is correct
13 Correct 439 ms 26148 KB Output is correct
14 Correct 464 ms 26136 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 29264 KB Output is correct
2 Correct 347 ms 26176 KB Output is correct
3 Correct 423 ms 26092 KB Output is correct
4 Correct 467 ms 26180 KB Output is correct
5 Correct 391 ms 26136 KB Output is correct
6 Correct 502 ms 26204 KB Output is correct
7 Correct 258 ms 26248 KB Output is correct
8 Correct 242 ms 26084 KB Output is correct
9 Correct 258 ms 25924 KB Output is correct
10 Correct 319 ms 26012 KB Output is correct
11 Correct 462 ms 26056 KB Output is correct
12 Correct 362 ms 26192 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 2 ms 1484 KB Output is correct
25 Correct 1 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct
27 Correct 1 ms 1484 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 1 ms 1484 KB Output is correct
33 Correct 2 ms 1484 KB Output is correct
34 Correct 1 ms 1484 KB Output is correct
35 Correct 1 ms 1484 KB Output is correct
36 Correct 2 ms 1484 KB Output is correct
37 Correct 1 ms 1484 KB Output is correct
38 Correct 1 ms 1484 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 2 ms 1484 KB Output is correct
41 Correct 7 ms 1996 KB Output is correct
42 Correct 8 ms 2024 KB Output is correct
43 Correct 6 ms 1996 KB Output is correct
44 Correct 6 ms 1868 KB Output is correct
45 Correct 7 ms 2044 KB Output is correct
46 Correct 7 ms 1968 KB Output is correct
47 Correct 7 ms 2048 KB Output is correct
48 Correct 8 ms 2124 KB Output is correct
49 Correct 10 ms 2064 KB Output is correct
50 Correct 8 ms 1996 KB Output is correct
51 Correct 7 ms 1996 KB Output is correct
52 Correct 7 ms 2040 KB Output is correct
53 Correct 7 ms 1996 KB Output is correct
54 Correct 8 ms 2000 KB Output is correct
55 Correct 7 ms 1996 KB Output is correct
56 Correct 6 ms 1996 KB Output is correct
57 Correct 7 ms 1996 KB Output is correct
58 Correct 5 ms 1996 KB Output is correct
59 Correct 6 ms 1996 KB Output is correct
60 Correct 6 ms 1996 KB Output is correct
61 Correct 6 ms 1996 KB Output is correct
62 Correct 260 ms 29228 KB Output is correct
63 Correct 269 ms 27592 KB Output is correct
64 Correct 421 ms 26456 KB Output is correct
65 Correct 507 ms 26180 KB Output is correct
66 Correct 403 ms 26120 KB Output is correct
67 Correct 457 ms 26088 KB Output is correct
68 Correct 260 ms 25952 KB Output is correct
69 Correct 242 ms 25948 KB Output is correct
70 Correct 234 ms 26052 KB Output is correct
71 Correct 231 ms 26128 KB Output is correct
72 Correct 360 ms 26116 KB Output is correct
73 Correct 350 ms 26136 KB Output is correct
74 Correct 439 ms 26148 KB Output is correct
75 Correct 464 ms 26136 KB Output is correct
76 Correct 275 ms 29264 KB Output is correct
77 Correct 347 ms 26176 KB Output is correct
78 Correct 423 ms 26092 KB Output is correct
79 Correct 467 ms 26180 KB Output is correct
80 Correct 391 ms 26136 KB Output is correct
81 Correct 502 ms 26204 KB Output is correct
82 Correct 258 ms 26248 KB Output is correct
83 Correct 242 ms 26084 KB Output is correct
84 Correct 258 ms 25924 KB Output is correct
85 Correct 319 ms 26012 KB Output is correct
86 Correct 462 ms 26056 KB Output is correct
87 Correct 362 ms 26192 KB Output is correct
88 Correct 436 ms 26328 KB Output is correct
89 Correct 503 ms 26256 KB Output is correct
90 Correct 493 ms 26212 KB Output is correct
91 Correct 484 ms 26216 KB Output is correct
92 Correct 317 ms 26216 KB Output is correct
93 Correct 410 ms 26072 KB Output is correct
94 Correct 520 ms 26136 KB Output is correct
95 Correct 420 ms 26088 KB Output is correct
96 Correct 479 ms 26248 KB Output is correct
97 Correct 523 ms 26052 KB Output is correct
98 Correct 427 ms 26180 KB Output is correct
99 Correct 485 ms 26136 KB Output is correct
100 Correct 445 ms 26216 KB Output is correct
101 Correct 221 ms 26044 KB Output is correct
102 Correct 257 ms 26092 KB Output is correct
103 Correct 293 ms 26076 KB Output is correct
104 Correct 315 ms 26220 KB Output is correct
105 Correct 382 ms 26128 KB Output is correct
106 Correct 295 ms 26200 KB Output is correct
107 Correct 329 ms 26092 KB Output is correct
108 Correct 427 ms 26256 KB Output is correct
109 Correct 371 ms 26240 KB Output is correct
110 Correct 433 ms 26204 KB Output is correct
111 Correct 510 ms 26140 KB Output is correct
112 Correct 333 ms 26052 KB Output is correct
113 Correct 440 ms 26132 KB Output is correct
114 Correct 434 ms 26084 KB Output is correct
115 Correct 258 ms 26212 KB Output is correct
116 Correct 253 ms 26104 KB Output is correct
117 Correct 311 ms 26180 KB Output is correct
118 Correct 314 ms 26092 KB Output is correct
119 Correct 266 ms 26128 KB Output is correct
120 Correct 272 ms 26212 KB Output is correct