oj.uz

Submission #529713

# Submission time Handle Problem Language Result Execution time Memory
529713 2022-02-23T14:03:01 Z Killer2501 Financial Report (JOI21_financial) C++14
100 / 100
 576 ms 53956 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 5e5+5;
const int M = 5e3+5;
const int mod = 1e9+7;
const ll base = 75;
const int inf = 1e9+7;
int m, n, t, b[N], c[N], d[N], cnt, ntime, id[N];
int dp[N], k, a[N];
int ans, tong;
vector<int> adj[N];
vector<pii> g[N];
vector<pii> kq;
string s;
bool vis[N];
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n&1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
vector<pll> vi;
struct IT
{
    int n;
    vector<int> st;
    IT(int _n)
    {
        n = _n;
        st.resize(n*4+4, 0);
    }
    void build(int id, int l, int r, int pos, int x)
    {
        if(l == r)
        {
            st[id] = x;
            return;
        }
        int mid = (l+r)>>1;
        if(pos <= mid)build(id<<1, l, mid, pos, x);
        else build(id<<1|1, mid+1, r, pos, x);
        st[id] = max(st[id<<1], st[id<<1|1]);
    }
    void build(int pos, int x)
    {
        build(1, 1, n, pos, x);
    }
    int get(int id, int l, int r, int u, int v)
    {
        if(u <= l && r <= v)return st[id];
        if(u > r || l > v)return 0;
        int mid = (l+r)>>1;
        return max(get(id<<1, l, mid, u, v), get(id<<1|1, mid+1, r, u, v));
    }
    int get(int l, int r)
    {
        return get(1, 1, n, l, r);
    }
};
struct DSU
{
    int n;
    vector<int> lab, mn;
    DSU(int _n)
    {
        n = _n;
        lab.resize(n+1, -1);
        mn.resize(n+1);
        for(int i = 0; i <= n; i ++)mn[i] = i;
    }
    int findp(int u)
    {
        return lab[u] < 0 ? u : lab[u] = findp(lab[u]);
    }
    void hop(int u, int v)
    {
        u = findp(u);
        v = findp(v);
        if(u == v)return;
        if(lab[u] > lab[v])swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        mn[u] = min(mn[u], mn[v]);
    }
};
pll p[N];
void sol()
{
    cin >> n >> k;
    for(int i = 1; i <= n; i ++)
    {
        cin >> p[i].fi;
        p[i].se = i;
    }
    sort(p+1, p+1+n);
    set<int> pos;
    IT st(n);
    DSU dsu(n);
    for(int i = 1; i <= n; )
    {
        int j = i;
        while(i <= n && p[i].fi == p[j].fi)
        {
            auto it = pos.lower_bound(p[i].se);
            if(it != pos.begin())
            {
                --it;
                if(p[i].se-(*it) <= k)
                    a[i] = st.get(dsu.mn[dsu.findp(*it)], p[i].se)+  1;
                else a[i] = 1;
            }
            else a[i] = 1;
            ans = max(ans, a[i]);
            //cout << p[i].se <<" "<<p[i].fi<<" "<<a[i] << '\n';
            ++i;
        }
        for(int x = j; x < i; x ++)
        {
            st.build(p[x].se, a[x]);
            auto it = pos.lower_bound(p[x].se);
            if(it != pos.end() && (*it)-p[x].se <= k)dsu.hop(p[x].se, (*it));
            if(it != pos.begin())
            {
                --it;
                if(p[x].se-(*it) <= k)dsu.hop(p[x].se, (*it));
            }
            pos.insert(p[x].se);
        }
    }
    cout << ans;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    #define task "test"
    if(fopen(task".inp", "r"))
	{
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}
    int test = 1;
    //cin >> test;
    while(test -- > 0)sol();
    return 0;
}

Compilation message

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

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23756 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23732 KB Output is correct
6 Correct 12 ms 23756 KB Output is correct
7 Correct 12 ms 23756 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 12 ms 23756 KB Output is correct
10 Correct 12 ms 23756 KB Output is correct
11 Correct 12 ms 23828 KB Output is correct
12 Correct 12 ms 23756 KB Output is correct
13 Correct 12 ms 23756 KB Output is correct
14 Correct 12 ms 23756 KB Output is correct
15 Correct 12 ms 23756 KB Output is correct
16 Correct 13 ms 23792 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 13 ms 23820 KB Output is correct
20 Correct 12 ms 23836 KB Output is correct
21 Correct 12 ms 23820 KB Output is correct
22 Correct 12 ms 23796 KB Output is correct
23 Correct 13 ms 23816 KB Output is correct
24 Correct 13 ms 23824 KB Output is correct
25 Correct 12 ms 23788 KB Output is correct
26 Correct 13 ms 23820 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23756 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23732 KB Output is correct
6 Correct 12 ms 23756 KB Output is correct
7 Correct 12 ms 23756 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 12 ms 23756 KB Output is correct
10 Correct 12 ms 23756 KB Output is correct
11 Correct 12 ms 23828 KB Output is correct
12 Correct 12 ms 23756 KB Output is correct
13 Correct 12 ms 23756 KB Output is correct
14 Correct 12 ms 23756 KB Output is correct
15 Correct 12 ms 23756 KB Output is correct
16 Correct 13 ms 23792 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 13 ms 23820 KB Output is correct
20 Correct 12 ms 23836 KB Output is correct
21 Correct 12 ms 23820 KB Output is correct
22 Correct 12 ms 23796 KB Output is correct
23 Correct 13 ms 23816 KB Output is correct
24 Correct 13 ms 23824 KB Output is correct
25 Correct 12 ms 23788 KB Output is correct
26 Correct 13 ms 23820 KB Output is correct
27 Correct 12 ms 23756 KB Output is correct
28 Correct 12 ms 23820 KB Output is correct
29 Correct 13 ms 23756 KB Output is correct
30 Correct 12 ms 23824 KB Output is correct
31 Correct 14 ms 23756 KB Output is correct
32 Correct 15 ms 23948 KB Output is correct
33 Correct 13 ms 23756 KB Output is correct
34 Correct 12 ms 23760 KB Output is correct
35 Correct 13 ms 23828 KB Output is correct
36 Correct 12 ms 23756 KB Output is correct
37 Correct 13 ms 23836 KB Output is correct
38 Correct 12 ms 23756 KB Output is correct
39 Correct 12 ms 23756 KB Output is correct
40 Correct 12 ms 23756 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23756 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23732 KB Output is correct
6 Correct 12 ms 23756 KB Output is correct
7 Correct 12 ms 23756 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 12 ms 23756 KB Output is correct
10 Correct 12 ms 23756 KB Output is correct
11 Correct 12 ms 23828 KB Output is correct
12 Correct 12 ms 23756 KB Output is correct
13 Correct 12 ms 23756 KB Output is correct
14 Correct 12 ms 23756 KB Output is correct
15 Correct 12 ms 23756 KB Output is correct
16 Correct 13 ms 23792 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 13 ms 23820 KB Output is correct
20 Correct 12 ms 23836 KB Output is correct
21 Correct 12 ms 23820 KB Output is correct
22 Correct 12 ms 23796 KB Output is correct
23 Correct 13 ms 23816 KB Output is correct
24 Correct 13 ms 23824 KB Output is correct
25 Correct 12 ms 23788 KB Output is correct
26 Correct 13 ms 23820 KB Output is correct
27 Correct 12 ms 23756 KB Output is correct
28 Correct 12 ms 23820 KB Output is correct
29 Correct 13 ms 23756 KB Output is correct
30 Correct 12 ms 23824 KB Output is correct
31 Correct 14 ms 23756 KB Output is correct
32 Correct 15 ms 23948 KB Output is correct
33 Correct 13 ms 23756 KB Output is correct
34 Correct 12 ms 23760 KB Output is correct
35 Correct 13 ms 23828 KB Output is correct
36 Correct 12 ms 23756 KB Output is correct
37 Correct 13 ms 23836 KB Output is correct
38 Correct 12 ms 23756 KB Output is correct
39 Correct 12 ms 23756 KB Output is correct
40 Correct 12 ms 23756 KB Output is correct
41 Correct 19 ms 24460 KB Output is correct
42 Correct 18 ms 24432 KB Output is correct
43 Correct 16 ms 24396 KB Output is correct
44 Correct 16 ms 24436 KB Output is correct
45 Correct 19 ms 24460 KB Output is correct
46 Correct 18 ms 24396 KB Output is correct
47 Correct 17 ms 24396 KB Output is correct
48 Correct 18 ms 24508 KB Output is correct
49 Correct 18 ms 24396 KB Output is correct
50 Correct 17 ms 24472 KB Output is correct
51 Correct 16 ms 24484 KB Output is correct
52 Correct 17 ms 24484 KB Output is correct
53 Correct 16 ms 24468 KB Output is correct
54 Correct 17 ms 24464 KB Output is correct
55 Correct 18 ms 24432 KB Output is correct
56 Correct 18 ms 24524 KB Output is correct
57 Correct 18 ms 24472 KB Output is correct
58 Correct 20 ms 24444 KB Output is correct
59 Correct 17 ms 24508 KB Output is correct
60 Correct 17 ms 24408 KB Output is correct
61 Correct 17 ms 24436 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 53736 KB Output is correct
2 Correct 239 ms 53360 KB Output is correct
3 Correct 345 ms 53720 KB Output is correct
4 Correct 422 ms 53796 KB Output is correct
5 Correct 311 ms 53648 KB Output is correct
6 Correct 417 ms 53740 KB Output is correct
7 Correct 223 ms 53444 KB Output is correct
8 Correct 205 ms 53768 KB Output is correct
9 Correct 180 ms 53660 KB Output is correct
10 Correct 176 ms 53816 KB Output is correct
11 Correct 301 ms 53728 KB Output is correct
12 Correct 291 ms 53656 KB Output is correct
13 Correct 383 ms 53692 KB Output is correct
14 Correct 390 ms 53700 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 53956 KB Output is correct
2 Correct 376 ms 53612 KB Output is correct
3 Correct 463 ms 53780 KB Output is correct
4 Correct 453 ms 53612 KB Output is correct
5 Correct 429 ms 53692 KB Output is correct
6 Correct 482 ms 53724 KB Output is correct
7 Correct 225 ms 53836 KB Output is correct
8 Correct 201 ms 53956 KB Output is correct
9 Correct 204 ms 53492 KB Output is correct
10 Correct 275 ms 53612 KB Output is correct
11 Correct 407 ms 53720 KB Output is correct
12 Correct 408 ms 53656 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23756 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23732 KB Output is correct
6 Correct 12 ms 23756 KB Output is correct
7 Correct 12 ms 23756 KB Output is correct
8 Correct 12 ms 23824 KB Output is correct
9 Correct 12 ms 23756 KB Output is correct
10 Correct 12 ms 23756 KB Output is correct
11 Correct 12 ms 23828 KB Output is correct
12 Correct 12 ms 23756 KB Output is correct
13 Correct 12 ms 23756 KB Output is correct
14 Correct 12 ms 23756 KB Output is correct
15 Correct 12 ms 23756 KB Output is correct
16 Correct 13 ms 23792 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 13 ms 23756 KB Output is correct
19 Correct 13 ms 23820 KB Output is correct
20 Correct 12 ms 23836 KB Output is correct
21 Correct 12 ms 23820 KB Output is correct
22 Correct 12 ms 23796 KB Output is correct
23 Correct 13 ms 23816 KB Output is correct
24 Correct 13 ms 23824 KB Output is correct
25 Correct 12 ms 23788 KB Output is correct
26 Correct 13 ms 23820 KB Output is correct
27 Correct 12 ms 23756 KB Output is correct
28 Correct 12 ms 23820 KB Output is correct
29 Correct 13 ms 23756 KB Output is correct
30 Correct 12 ms 23824 KB Output is correct
31 Correct 14 ms 23756 KB Output is correct
32 Correct 15 ms 23948 KB Output is correct
33 Correct 13 ms 23756 KB Output is correct
34 Correct 12 ms 23760 KB Output is correct
35 Correct 13 ms 23828 KB Output is correct
36 Correct 12 ms 23756 KB Output is correct
37 Correct 13 ms 23836 KB Output is correct
38 Correct 12 ms 23756 KB Output is correct
39 Correct 12 ms 23756 KB Output is correct
40 Correct 12 ms 23756 KB Output is correct
41 Correct 19 ms 24460 KB Output is correct
42 Correct 18 ms 24432 KB Output is correct
43 Correct 16 ms 24396 KB Output is correct
44 Correct 16 ms 24436 KB Output is correct
45 Correct 19 ms 24460 KB Output is correct
46 Correct 18 ms 24396 KB Output is correct
47 Correct 17 ms 24396 KB Output is correct
48 Correct 18 ms 24508 KB Output is correct
49 Correct 18 ms 24396 KB Output is correct
50 Correct 17 ms 24472 KB Output is correct
51 Correct 16 ms 24484 KB Output is correct
52 Correct 17 ms 24484 KB Output is correct
53 Correct 16 ms 24468 KB Output is correct
54 Correct 17 ms 24464 KB Output is correct
55 Correct 18 ms 24432 KB Output is correct
56 Correct 18 ms 24524 KB Output is correct
57 Correct 18 ms 24472 KB Output is correct
58 Correct 20 ms 24444 KB Output is correct
59 Correct 17 ms 24508 KB Output is correct
60 Correct 17 ms 24408 KB Output is correct
61 Correct 17 ms 24436 KB Output is correct
62 Correct 168 ms 53736 KB Output is correct
63 Correct 239 ms 53360 KB Output is correct
64 Correct 345 ms 53720 KB Output is correct
65 Correct 422 ms 53796 KB Output is correct
66 Correct 311 ms 53648 KB Output is correct
67 Correct 417 ms 53740 KB Output is correct
68 Correct 223 ms 53444 KB Output is correct
69 Correct 205 ms 53768 KB Output is correct
70 Correct 180 ms 53660 KB Output is correct
71 Correct 176 ms 53816 KB Output is correct
72 Correct 301 ms 53728 KB Output is correct
73 Correct 291 ms 53656 KB Output is correct
74 Correct 383 ms 53692 KB Output is correct
75 Correct 390 ms 53700 KB Output is correct
76 Correct 179 ms 53956 KB Output is correct
77 Correct 376 ms 53612 KB Output is correct
78 Correct 463 ms 53780 KB Output is correct
79 Correct 453 ms 53612 KB Output is correct
80 Correct 429 ms 53692 KB Output is correct
81 Correct 482 ms 53724 KB Output is correct
82 Correct 225 ms 53836 KB Output is correct
83 Correct 201 ms 53956 KB Output is correct
84 Correct 204 ms 53492 KB Output is correct
85 Correct 275 ms 53612 KB Output is correct
86 Correct 407 ms 53720 KB Output is correct
87 Correct 408 ms 53656 KB Output is correct
88 Correct 468 ms 53604 KB Output is correct
89 Correct 455 ms 53732 KB Output is correct
90 Correct 507 ms 53804 KB Output is correct
91 Correct 468 ms 53660 KB Output is correct
92 Correct 329 ms 53720 KB Output is correct
93 Correct 499 ms 53700 KB Output is correct
94 Correct 467 ms 53692 KB Output is correct
95 Correct 390 ms 53684 KB Output is correct
96 Correct 419 ms 53616 KB Output is correct
97 Correct 461 ms 53700 KB Output is correct
98 Correct 483 ms 53688 KB Output is correct
99 Correct 470 ms 53620 KB Output is correct
100 Correct 471 ms 53684 KB Output is correct
101 Correct 204 ms 53828 KB Output is correct
102 Correct 207 ms 53684 KB Output is correct
103 Correct 238 ms 53612 KB Output is correct
104 Correct 254 ms 53696 KB Output is correct
105 Correct 308 ms 53740 KB Output is correct
106 Correct 277 ms 53736 KB Output is correct
107 Correct 309 ms 53680 KB Output is correct
108 Correct 452 ms 53768 KB Output is correct
109 Correct 307 ms 53720 KB Output is correct
110 Correct 447 ms 53636 KB Output is correct
111 Correct 576 ms 53676 KB Output is correct
112 Correct 282 ms 53640 KB Output is correct
113 Correct 441 ms 53872 KB Output is correct
114 Correct 465 ms 53700 KB Output is correct
115 Correct 249 ms 53708 KB Output is correct
116 Correct 280 ms 53636 KB Output is correct
117 Correct 291 ms 53716 KB Output is correct
118 Correct 321 ms 53632 KB Output is correct
119 Correct 261 ms 53728 KB Output is correct
120 Correct 263 ms 53668 KB Output is correct