oj.uz

Submission #696843

# Submission time Handle Problem Language Result Execution time Memory
696843 2023-02-07T11:46:52 Z Do_you_copy Financial Report (JOI21_financial) C++17
100 / 100
 464 ms 21728 KB 
//Then
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 4e5 + 1;
//const int Mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, d;
int idx[maxN], dp[maxN];
int lab[maxN], minn[maxN];
int a[maxN];
int find_set(int u){
    return lab[u] < 0 ? u : lab[u] = find_set(lab[u]);
}

void unite(int u, int v){
    u = find_set(u);
    v = find_set(v);
    if (u == v) return;
    if (lab[u] > lab[v]) swap(u, v);
    minn[u] = min(minn[u], minn[v]);
    lab[u] += lab[v];
    lab[v] = u;
}

void join(int l, int r){
    if (abs(r - l) > d) return;
    unite(l, r);
}

struct TST{
    int st[maxN * 4];
    TST(){
        memset(st, 0, sizeof(st));
    }
    void update(int id, int i, int x, int l, int r){
        if (l == r){
            st[id] = x;
            return;
        }
        int mid = (l + r) >> 1;
        if (i <= mid) update(id << 1, i, x, l, mid);
        else update(id << 1 | 1, i, x, mid + 1, r);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }
    int get(int id, int i, int j, int l, int r){
        if (i > r || l > j) return 0;
        if (i <= l && r <= j) return st[id];
        int mid = (l + r) >> 1;
        return max(get(id << 1, i, j, l, mid), get(id << 1 | 1, i, j, mid + 1, r));
    }
};
TST st[2];

void Init(){
    cin >> n >> d;
    iota(minn, minn + n + 1, 1 - d);
    for (int i = 1; i <= n; ++i){
        minn[i] = max(0, minn[i]);
        cin >> a[i];
    }
    minn[0] = max(minn[0], 0);
    fill(lab, lab + n + 1, -1);
    iota(idx + 1, idx + n + 1, 1);
    sort(idx + 1, idx + n + 1,[&](const int &i, const int &j){
        if (a[i] == a[j]) return i < j;
        return a[i] < a[j];
    });
    int i = 1, j = 1;
    while (i <= n){
        while (j <= n && a[idx[j]] == a[idx[i]]){
            int pos = st[1].get(1, 0, idx[j], 0, n);
            int k;
            if (idx[j] - pos <= d)
                k = minn[find_set(pos)];
            else k = max(0, idx[j] - d);
            dp[idx[j]] = st[0].get(1, k, idx[j], 0, n) + 1;
            ++j;
        }
        while (i < j){
            int pos1 = st[1].get(1, 0, idx[i], 0, n);
            int pos2 = st[1].get(1, 0, idx[i] + d, 0, n);
            join(pos1, idx[i]);
            join(pos2, idx[i]);
            st[1].update(1, idx[i], idx[i], 0, n);
            st[0].update(1, idx[i], dp[idx[i]], 0, n);
            ++i;
        }
    }
    cout << *max_element(dp + 1, dp + n + 1);
}

#define debug
#define taskname "test"
signed main(){
    faster
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
        #ifndef debug
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        #endif // debug
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:106:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:107:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12884 KB Output is correct
2 Correct 6 ms 12848 KB Output is correct
3 Correct 5 ms 12884 KB Output is correct
4 Correct 5 ms 12884 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 5 ms 12884 KB Output is correct
7 Correct 6 ms 12884 KB Output is correct
8 Correct 7 ms 12756 KB Output is correct
9 Correct 7 ms 12812 KB Output is correct
10 Correct 6 ms 12860 KB Output is correct
11 Correct 5 ms 12884 KB Output is correct
12 Correct 5 ms 12844 KB Output is correct
13 Correct 6 ms 12884 KB Output is correct
14 Correct 5 ms 12784 KB Output is correct
15 Correct 5 ms 12884 KB Output is correct
16 Correct 6 ms 12884 KB Output is correct
17 Correct 7 ms 12884 KB Output is correct
18 Correct 5 ms 12884 KB Output is correct
19 Correct 5 ms 12756 KB Output is correct
20 Correct 5 ms 12884 KB Output is correct
21 Correct 5 ms 12884 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 6 ms 12884 KB Output is correct
24 Correct 5 ms 12884 KB Output is correct
25 Correct 6 ms 12792 KB Output is correct
26 Correct 6 ms 12872 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12884 KB Output is correct
2 Correct 6 ms 12848 KB Output is correct
3 Correct 5 ms 12884 KB Output is correct
4 Correct 5 ms 12884 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 5 ms 12884 KB Output is correct
7 Correct 6 ms 12884 KB Output is correct
8 Correct 7 ms 12756 KB Output is correct
9 Correct 7 ms 12812 KB Output is correct
10 Correct 6 ms 12860 KB Output is correct
11 Correct 5 ms 12884 KB Output is correct
12 Correct 5 ms 12844 KB Output is correct
13 Correct 6 ms 12884 KB Output is correct
14 Correct 5 ms 12784 KB Output is correct
15 Correct 5 ms 12884 KB Output is correct
16 Correct 6 ms 12884 KB Output is correct
17 Correct 7 ms 12884 KB Output is correct
18 Correct 5 ms 12884 KB Output is correct
19 Correct 5 ms 12756 KB Output is correct
20 Correct 5 ms 12884 KB Output is correct
21 Correct 5 ms 12884 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 6 ms 12884 KB Output is correct
24 Correct 5 ms 12884 KB Output is correct
25 Correct 6 ms 12792 KB Output is correct
26 Correct 6 ms 12872 KB Output is correct
27 Correct 6 ms 12884 KB Output is correct
28 Correct 6 ms 12884 KB Output is correct
29 Correct 5 ms 12884 KB Output is correct
30 Correct 6 ms 12884 KB Output is correct
31 Correct 7 ms 12872 KB Output is correct
32 Correct 6 ms 12824 KB Output is correct
33 Correct 6 ms 12884 KB Output is correct
34 Correct 7 ms 12884 KB Output is correct
35 Correct 6 ms 12840 KB Output is correct
36 Correct 7 ms 12884 KB Output is correct
37 Correct 6 ms 12884 KB Output is correct
38 Correct 6 ms 12884 KB Output is correct
39 Correct 6 ms 12884 KB Output is correct
40 Correct 5 ms 12884 KB Output is correct
41 Correct 12 ms 13020 KB Output is correct
42 Correct 11 ms 13012 KB Output is correct
43 Correct 10 ms 13012 KB Output is correct
44 Correct 10 ms 13000 KB Output is correct
45 Correct 12 ms 13012 KB Output is correct
46 Correct 9 ms 12916 KB Output is correct
47 Correct 11 ms 13012 KB Output is correct
48 Correct 11 ms 13012 KB Output is correct
49 Correct 11 ms 13012 KB Output is correct
50 Correct 13 ms 13020 KB Output is correct
51 Correct 10 ms 13008 KB Output is correct
52 Correct 11 ms 13024 KB Output is correct
53 Correct 9 ms 12896 KB Output is correct
54 Correct 9 ms 13012 KB Output is correct
55 Correct 12 ms 12976 KB Output is correct
56 Correct 10 ms 13012 KB Output is correct
57 Correct 11 ms 13016 KB Output is correct
58 Correct 9 ms 13004 KB Output is correct
59 Correct 8 ms 13012 KB Output is correct
60 Correct 9 ms 13012 KB Output is correct
61 Correct 10 ms 13012 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 18832 KB Output is correct
2 Correct 250 ms 18724 KB Output is correct
3 Correct 343 ms 18716 KB Output is correct
4 Correct 440 ms 18724 KB Output is correct
5 Correct 308 ms 18716 KB Output is correct
6 Correct 401 ms 18808 KB Output is correct
7 Correct 186 ms 18652 KB Output is correct
8 Correct 182 ms 18680 KB Output is correct
9 Correct 193 ms 18700 KB Output is correct
10 Correct 215 ms 18732 KB Output is correct
11 Correct 294 ms 18600 KB Output is correct
12 Correct 315 ms 18720 KB Output is correct
13 Correct 315 ms 18720 KB Output is correct
14 Correct 380 ms 18840 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 18720 KB Output is correct
2 Correct 309 ms 18724 KB Output is correct
3 Correct 361 ms 18748 KB Output is correct
4 Correct 326 ms 21632 KB Output is correct
5 Correct 313 ms 21676 KB Output is correct
6 Correct 323 ms 21628 KB Output is correct
7 Correct 157 ms 21728 KB Output is correct
8 Correct 151 ms 21612 KB Output is correct
9 Correct 177 ms 21572 KB Output is correct
10 Correct 239 ms 21552 KB Output is correct
11 Correct 314 ms 21632 KB Output is correct
12 Correct 264 ms 21580 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12884 KB Output is correct
2 Correct 6 ms 12848 KB Output is correct
3 Correct 5 ms 12884 KB Output is correct
4 Correct 5 ms 12884 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 5 ms 12884 KB Output is correct
7 Correct 6 ms 12884 KB Output is correct
8 Correct 7 ms 12756 KB Output is correct
9 Correct 7 ms 12812 KB Output is correct
10 Correct 6 ms 12860 KB Output is correct
11 Correct 5 ms 12884 KB Output is correct
12 Correct 5 ms 12844 KB Output is correct
13 Correct 6 ms 12884 KB Output is correct
14 Correct 5 ms 12784 KB Output is correct
15 Correct 5 ms 12884 KB Output is correct
16 Correct 6 ms 12884 KB Output is correct
17 Correct 7 ms 12884 KB Output is correct
18 Correct 5 ms 12884 KB Output is correct
19 Correct 5 ms 12756 KB Output is correct
20 Correct 5 ms 12884 KB Output is correct
21 Correct 5 ms 12884 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 6 ms 12884 KB Output is correct
24 Correct 5 ms 12884 KB Output is correct
25 Correct 6 ms 12792 KB Output is correct
26 Correct 6 ms 12872 KB Output is correct
27 Correct 6 ms 12884 KB Output is correct
28 Correct 6 ms 12884 KB Output is correct
29 Correct 5 ms 12884 KB Output is correct
30 Correct 6 ms 12884 KB Output is correct
31 Correct 7 ms 12872 KB Output is correct
32 Correct 6 ms 12824 KB Output is correct
33 Correct 6 ms 12884 KB Output is correct
34 Correct 7 ms 12884 KB Output is correct
35 Correct 6 ms 12840 KB Output is correct
36 Correct 7 ms 12884 KB Output is correct
37 Correct 6 ms 12884 KB Output is correct
38 Correct 6 ms 12884 KB Output is correct
39 Correct 6 ms 12884 KB Output is correct
40 Correct 5 ms 12884 KB Output is correct
41 Correct 12 ms 13020 KB Output is correct
42 Correct 11 ms 13012 KB Output is correct
43 Correct 10 ms 13012 KB Output is correct
44 Correct 10 ms 13000 KB Output is correct
45 Correct 12 ms 13012 KB Output is correct
46 Correct 9 ms 12916 KB Output is correct
47 Correct 11 ms 13012 KB Output is correct
48 Correct 11 ms 13012 KB Output is correct
49 Correct 11 ms 13012 KB Output is correct
50 Correct 13 ms 13020 KB Output is correct
51 Correct 10 ms 13008 KB Output is correct
52 Correct 11 ms 13024 KB Output is correct
53 Correct 9 ms 12896 KB Output is correct
54 Correct 9 ms 13012 KB Output is correct
55 Correct 12 ms 12976 KB Output is correct
56 Correct 10 ms 13012 KB Output is correct
57 Correct 11 ms 13016 KB Output is correct
58 Correct 9 ms 13004 KB Output is correct
59 Correct 8 ms 13012 KB Output is correct
60 Correct 9 ms 13012 KB Output is correct
61 Correct 10 ms 13012 KB Output is correct
62 Correct 191 ms 18832 KB Output is correct
63 Correct 250 ms 18724 KB Output is correct
64 Correct 343 ms 18716 KB Output is correct
65 Correct 440 ms 18724 KB Output is correct
66 Correct 308 ms 18716 KB Output is correct
67 Correct 401 ms 18808 KB Output is correct
68 Correct 186 ms 18652 KB Output is correct
69 Correct 182 ms 18680 KB Output is correct
70 Correct 193 ms 18700 KB Output is correct
71 Correct 215 ms 18732 KB Output is correct
72 Correct 294 ms 18600 KB Output is correct
73 Correct 315 ms 18720 KB Output is correct
74 Correct 315 ms 18720 KB Output is correct
75 Correct 380 ms 18840 KB Output is correct
76 Correct 173 ms 18720 KB Output is correct
77 Correct 309 ms 18724 KB Output is correct
78 Correct 361 ms 18748 KB Output is correct
79 Correct 326 ms 21632 KB Output is correct
80 Correct 313 ms 21676 KB Output is correct
81 Correct 323 ms 21628 KB Output is correct
82 Correct 157 ms 21728 KB Output is correct
83 Correct 151 ms 21612 KB Output is correct
84 Correct 177 ms 21572 KB Output is correct
85 Correct 239 ms 21552 KB Output is correct
86 Correct 314 ms 21632 KB Output is correct
87 Correct 264 ms 21580 KB Output is correct
88 Correct 410 ms 21700 KB Output is correct
89 Correct 424 ms 21508 KB Output is correct
90 Correct 447 ms 21628 KB Output is correct
91 Correct 410 ms 21584 KB Output is correct
92 Correct 295 ms 21560 KB Output is correct
93 Correct 409 ms 21628 KB Output is correct
94 Correct 370 ms 21628 KB Output is correct
95 Correct 348 ms 21628 KB Output is correct
96 Correct 464 ms 21584 KB Output is correct
97 Correct 432 ms 21628 KB Output is correct
98 Correct 397 ms 21632 KB Output is correct
99 Correct 402 ms 21708 KB Output is correct
100 Correct 370 ms 21572 KB Output is correct
101 Correct 202 ms 21596 KB Output is correct
102 Correct 202 ms 21616 KB Output is correct
103 Correct 230 ms 21628 KB Output is correct
104 Correct 269 ms 21716 KB Output is correct
105 Correct 275 ms 21580 KB Output is correct
106 Correct 272 ms 21540 KB Output is correct
107 Correct 302 ms 21524 KB Output is correct
108 Correct 344 ms 21632 KB Output is correct
109 Correct 296 ms 21572 KB Output is correct
110 Correct 350 ms 21628 KB Output is correct
111 Correct 368 ms 21628 KB Output is correct
112 Correct 255 ms 21560 KB Output is correct
113 Correct 391 ms 21628 KB Output is correct
114 Correct 360 ms 21704 KB Output is correct
115 Correct 155 ms 21520 KB Output is correct
116 Correct 159 ms 21516 KB Output is correct
117 Correct 192 ms 21600 KB Output is correct
118 Correct 191 ms 21580 KB Output is correct
119 Correct 278 ms 21616 KB Output is correct
120 Correct 301 ms 21616 KB Output is correct