oj.uz

Submission #899343

# Submission time Handle Problem Language Result Execution time Memory
899343 2024-01-05T20:00:15 Z davitmarg Financial Report (JOI21_financial) C++17
100 / 100
 377 ms 33696 KB 
/*
DavitMarg
In a honky-tonk,
Down in Mexico
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <random>
#include <chrono>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
 
const int N = 500005;
 
int n, d;
int a[N];
 
 
int par[N], sz[N], mn[N];
 
void init_dsu()
{
    for (int i = 1; i <= n; i++)
    {
        par[i] = i;
        mn[i] = i;
        sz[i] = 1;
    }
}
 
int get_par(int u)
{
    if (par[u] == u)
        return u;
    return par[u] = get_par(par[u]);
}
 
void merge(int u, int v)
{
    u = get_par(u);
    v = get_par(v);
    if (u == v)
        return;
    if (sz[u] < sz[v])
        swap(u, v);
    par[v] = u;
    sz[u] += sz[v];
    mn[u] = min(mn[u], mn[v]);
}
 
 
int dp[N], lst[N];
 
void init()
{
    init_dsu();
    vector<pair<int, int>> v;
    v.push_back(MP(-1, 0));
    for (int i = 1; i <= n; i++)
        v.push_back(MP(a[i], i));
    sort(all(v));
 
    set<int> s;
    s.insert(0);
    s.insert(n + 1);
 
    for (int i = 1; i <= n; i++)
    {
        int j = v[i].second;
        auto it = s.lower_bound(j);
        int r = *it;
        it--;
        int l = *it;
        if (j - l <= d && l > 0)
			merge(j, l);
        if (r - j <= d && r <= n)
            merge(j, r);
 
        lst[j] = mn[get_par(j)];
 
        s.insert(j);
    }
 
 
}
 
int stress_solve()
{
    int best = 0;
    for (int mask = 0; mask < (1 << n); mask++)
    {
        vector<int> v;
        for (int i = 0; i < n; i++)
        {
            if(((1 << i) & mask) == 0)
                continue;
            v.push_back(i + 1);
        }
        int mx = -mod;
        int res = 0;
        for (int i = 0; i < v.size(); i++)
        {
            if (a[v[i]] > mx)
            {
				mx = a[v[i]];
				res++;
			}
            if (i && v[i] - v[i - 1] > d)
            {
                res = 0;
                break;
            }
        }
        if (res == 6)
            res = res * 1;
        best = max(best, res);
	}
    return best;
}
 
int t[4 * N];
 
void build(int v, int l, int r)
{
    t[v] = 0;
    if(l == r)
        return;
    int mid = (l + r) / 2;
    build(2 * v, l, mid);
    build(2 * v + 1, mid + 1, r);
}
 
void upd(int v, int l, int r, int pos, int val)
{
    if (l == r)
    {
		t[v] = val;
		return;
	}
	int mid = (l + r) / 2;
	if(pos <= mid)
		upd(2 * v, l, mid, pos, val);
	else
		upd(2 * v + 1, mid + 1, r, pos, val);
	t[v] = max(t[2 * v], t[2 * v + 1]);
}
 
int get(int v, int l, int r, int i, int j)
{
    if (i > j)
        return 0;
    if (l == i && r == j)
        return t[v];
    int mid = (l + r) / 2;
    return max(get(2 * v, l, mid, i, min(j, mid)), get(2 * v + 1, mid + 1, r, max(i, mid + 1), j));
}
 
void solve()
{
    cin >> n >> d;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    init();
 
    build(1, 1, n);
 
    vector<pair<int, int> > v;
    for (int i = 1; i <= n; i++)
		v.push_back(MP(a[i], i));
 
    sort(all(v));
    reverse(all(v));
    while (!v.empty())
    {
        int val = v.back().first;
        vector<int> cur;
        while (!v.empty() && v.back().first == val)
        {
			cur.push_back(v.back().second);
			v.pop_back();
		}
 
        for (int j = 0; j < cur.size(); j++)
        {
            int i = cur[j];
            dp[i] = get(1, 1, n, lst[i], i) + 1;
        }
 
 
        for (int j = 0; j < cur.size(); j++)
        {
			int i = cur[j];
			upd(1, 1, n, i, dp[i]);
		}
 
    }
 
    int ans = 1;
    for(int i = 1; i <= n; i++)
		ans = max(ans, dp[i]);
 
    cout << ans << endl;
    // cout << stress_solve() << endl;
}
 
 
int main()
{
    fastIO;
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }
 
    return 0;
}
 
/*
 
 
11 5
1 10 10 10 10 10 10 2 3 4 5 
 
 
*/

Compilation message

Main.cpp: In function 'int stress_solve()':
Main.cpp:121:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |         for (int i = 0; i < v.size(); i++)
      |                         ~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:203:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  203 |         for (int j = 0; j < cur.size(); j++)
      |                         ~~^~~~~~~~~~~~
Main.cpp:210:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  210 |         for (int j = 0; j < cur.size(); j++)
      |                         ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 31264 KB Output is correct
2 Correct 217 ms 31524 KB Output is correct
3 Correct 264 ms 33696 KB Output is correct
4 Correct 357 ms 31264 KB Output is correct
5 Correct 268 ms 31268 KB Output is correct
6 Correct 344 ms 31356 KB Output is correct
7 Correct 181 ms 30976 KB Output is correct
8 Correct 186 ms 31052 KB Output is correct
9 Correct 165 ms 31236 KB Output is correct
10 Correct 173 ms 31124 KB Output is correct
11 Correct 262 ms 31100 KB Output is correct
12 Correct 288 ms 31232 KB Output is correct
13 Correct 292 ms 31056 KB Output is correct
14 Correct 322 ms 31212 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 31160 KB Output is correct
2 Correct 271 ms 31224 KB Output is correct
3 Correct 324 ms 33580 KB Output is correct
4 Correct 347 ms 31224 KB Output is correct
5 Correct 319 ms 33264 KB Output is correct
6 Correct 327 ms 31260 KB Output is correct
7 Correct 182 ms 31172 KB Output is correct
8 Correct 194 ms 31148 KB Output is correct
9 Correct 180 ms 30988 KB Output is correct
10 Correct 255 ms 31212 KB Output is correct
11 Correct 329 ms 31232 KB Output is correct
12 Correct 322 ms 31076 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 1 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 1 ms 12636 KB Output is correct
7 Correct 1 ms 12636 KB Output is correct
8 Correct 1 ms 12636 KB Output is correct
9 Correct 1 ms 12636 KB Output is correct
10 Correct 1 ms 12636 KB Output is correct
11 Correct 1 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 12636 KB Output is correct
14 Correct 1 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 1 ms 12632 KB Output is correct
17 Correct 1 ms 12636 KB Output is correct
18 Correct 1 ms 12636 KB Output is correct
19 Correct 1 ms 12636 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 1 ms 12636 KB Output is correct
23 Correct 1 ms 12636 KB Output is correct
24 Correct 1 ms 12636 KB Output is correct
25 Correct 1 ms 12636 KB Output is correct
26 Correct 1 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12804 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12632 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 2 ms 12636 KB Output is correct
36 Correct 2 ms 12636 KB Output is correct
37 Correct 2 ms 12632 KB Output is correct
38 Correct 2 ms 12636 KB Output is correct
39 Correct 2 ms 12632 KB Output is correct
40 Correct 2 ms 12636 KB Output is correct
41 Correct 6 ms 13144 KB Output is correct
42 Correct 6 ms 13144 KB Output is correct
43 Correct 5 ms 13144 KB Output is correct
44 Correct 6 ms 13148 KB Output is correct
45 Correct 6 ms 13148 KB Output is correct
46 Correct 7 ms 13040 KB Output is correct
47 Correct 6 ms 13148 KB Output is correct
48 Correct 6 ms 13148 KB Output is correct
49 Correct 6 ms 13148 KB Output is correct
50 Correct 6 ms 13148 KB Output is correct
51 Correct 6 ms 13148 KB Output is correct
52 Correct 6 ms 13148 KB Output is correct
53 Correct 5 ms 13144 KB Output is correct
54 Correct 5 ms 13148 KB Output is correct
55 Correct 6 ms 13228 KB Output is correct
56 Correct 6 ms 13148 KB Output is correct
57 Correct 6 ms 13148 KB Output is correct
58 Correct 5 ms 12944 KB Output is correct
59 Correct 5 ms 12944 KB Output is correct
60 Correct 5 ms 12952 KB Output is correct
61 Correct 5 ms 12952 KB Output is correct
62 Correct 188 ms 31264 KB Output is correct
63 Correct 217 ms 31524 KB Output is correct
64 Correct 264 ms 33696 KB Output is correct
65 Correct 357 ms 31264 KB Output is correct
66 Correct 268 ms 31268 KB Output is correct
67 Correct 344 ms 31356 KB Output is correct
68 Correct 181 ms 30976 KB Output is correct
69 Correct 186 ms 31052 KB Output is correct
70 Correct 165 ms 31236 KB Output is correct
71 Correct 173 ms 31124 KB Output is correct
72 Correct 262 ms 31100 KB Output is correct
73 Correct 288 ms 31232 KB Output is correct
74 Correct 292 ms 31056 KB Output is correct
75 Correct 322 ms 31212 KB Output is correct
76 Correct 187 ms 31160 KB Output is correct
77 Correct 271 ms 31224 KB Output is correct
78 Correct 324 ms 33580 KB Output is correct
79 Correct 347 ms 31224 KB Output is correct
80 Correct 319 ms 33264 KB Output is correct
81 Correct 327 ms 31260 KB Output is correct
82 Correct 182 ms 31172 KB Output is correct
83 Correct 194 ms 31148 KB Output is correct
84 Correct 180 ms 30988 KB Output is correct
85 Correct 255 ms 31212 KB Output is correct
86 Correct 329 ms 31232 KB Output is correct
87 Correct 322 ms 31076 KB Output is correct
88 Correct 316 ms 31448 KB Output is correct
89 Correct 338 ms 31240 KB Output is correct
90 Correct 355 ms 31264 KB Output is correct
91 Correct 353 ms 31148 KB Output is correct
92 Correct 248 ms 31492 KB Output is correct
93 Correct 321 ms 31100 KB Output is correct
94 Correct 338 ms 33428 KB Output is correct
95 Correct 304 ms 31268 KB Output is correct
96 Correct 323 ms 31152 KB Output is correct
97 Correct 356 ms 31220 KB Output is correct
98 Correct 335 ms 31264 KB Output is correct
99 Correct 377 ms 31316 KB Output is correct
100 Correct 326 ms 31056 KB Output is correct
101 Correct 172 ms 31128 KB Output is correct
102 Correct 190 ms 31276 KB Output is correct
103 Correct 206 ms 31208 KB Output is correct
104 Correct 242 ms 31456 KB Output is correct
105 Correct 273 ms 31124 KB Output is correct
106 Correct 256 ms 31136 KB Output is correct
107 Correct 299 ms 31252 KB Output is correct
108 Correct 342 ms 31260 KB Output is correct
109 Correct 268 ms 31496 KB Output is correct
110 Correct 327 ms 31244 KB Output is correct
111 Correct 367 ms 31112 KB Output is correct
112 Correct 254 ms 31128 KB Output is correct
113 Correct 318 ms 31128 KB Output is correct
114 Correct 376 ms 31232 KB Output is correct
115 Correct 212 ms 31252 KB Output is correct
116 Correct 211 ms 31216 KB Output is correct
117 Correct 244 ms 31240 KB Output is correct
118 Correct 244 ms 31076 KB Output is correct
119 Correct 232 ms 31160 KB Output is correct
120 Correct 227 ms 31036 KB Output is correct