oj.uz

Submission #547980

# Submission time Handle Problem Language Result Execution time Memory
547980 2022-04-12T06:16:45 Z Fysty Financial Report (JOI21_financial) C++17
100 / 100
 562 ms 25252 KB 
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
//#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define F first
#define S second
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)
const int N=3e5+5;
int a[N];
struct SegTree
{
    int st[N<<2];
    void upd(int l,int r,int x,int val,int id)
    {
        if(l==r) st[id]=val;
        else
        {
            int mid=l+r>>1;
            if(x<=mid) upd(l,mid,x,val,id<<1);
            else upd(mid+1,r,x,val,id<<1|1);
            st[id]=max(st[id<<1],st[id<<1|1]);
        }
    }
    int qry(int l,int r,int ql,int qr,int id)
    {
        if(ql<=l&&r<=qr) return st[id];
        else
        {
            int mid=l+r>>1;
            if(qr<=mid) return qry(l,mid,ql,qr,id<<1);
            else if(ql>mid) return qry(mid+1,r,ql,qr,id<<1|1);
            else return max(qry(l,mid,ql,mid,id<<1),qry(mid+1,r,mid+1,qr,id<<1|1));
        }
    }
} seg;
struct DSU
{
    int p[N];
    void init(int n){rep1(i,n) p[i]=i;}
    int fp(int x){return x==p[x]?x:p[x]=fp(p[x]);}
    void unite(int u,int v)
    {
        int x=fp(u),y=fp(v);
        if(x==y) return;
        if(x>y) swap(x,y);
        p[y]=x;
    }
} dsu;
bool cmp(int i,int j)
{
    if(a[i]!=a[j]) return a[i]<a[j];
    return i>j;
}
set<int> s;
signed main()
{
    MottoHayaku
    int n,d,ans=1;
    cin>>n>>d;
    vector<int> v;
    rep1(i,n)
    {
        cin>>a[i];
        v.pb(i);
    }
    sort(v.begin(),v.end(),cmp);
    dsu.init(n);
    for(int i:v)
    {
        auto it=s.lower_bound(i);
        if(it!=s.end())
        {
            int u=*it;
            if(u-i<=d) dsu.unite(i,u);
        }
        if(it!=s.begin())
        {
            int u=*prev(it);
            if(i-u<=d) dsu.unite(i,u);
        }
        s.insert(i);
        int tmp=1;
        if(dsu.fp(i)<=i-1) tmp=max(tmp,1+seg.qry(1,n,dsu.fp(i),i-1,1));
        seg.upd(1,n,i,tmp,1);
        ans=max(ans,tmp);
    }
    cout<<ans;
}

Compilation message

Main.cpp: In member function 'void SegTree::upd(int, int, int, int, int)':
Main.cpp:53:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |             int mid=l+r>>1;
      |                     ~^~
Main.cpp: In member function 'int SegTree::qry(int, int, int, int, int)':
Main.cpp:64:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |             int mid=l+r>>1;
      |                     ~^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 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 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 332 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 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 332 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 6 ms 856 KB Output is correct
42 Correct 5 ms 804 KB Output is correct
43 Correct 5 ms 860 KB Output is correct
44 Correct 5 ms 796 KB Output is correct
45 Correct 5 ms 800 KB Output is correct
46 Correct 6 ms 852 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 6 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 6 ms 856 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 804 KB Output is correct
53 Correct 4 ms 856 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 6 ms 852 KB Output is correct
56 Correct 5 ms 856 KB Output is correct
57 Correct 6 ms 852 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 5 ms 812 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 25004 KB Output is correct
2 Correct 210 ms 24512 KB Output is correct
3 Correct 300 ms 24888 KB Output is correct
4 Correct 437 ms 24916 KB Output is correct
5 Correct 290 ms 24856 KB Output is correct
6 Correct 425 ms 24916 KB Output is correct
7 Correct 191 ms 24844 KB Output is correct
8 Correct 181 ms 24900 KB Output is correct
9 Correct 200 ms 24896 KB Output is correct
10 Correct 148 ms 25068 KB Output is correct
11 Correct 249 ms 24912 KB Output is correct
12 Correct 294 ms 24928 KB Output is correct
13 Correct 335 ms 24992 KB Output is correct
14 Correct 363 ms 24964 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 25252 KB Output is correct
2 Correct 320 ms 24928 KB Output is correct
3 Correct 416 ms 24916 KB Output is correct
4 Correct 409 ms 25032 KB Output is correct
5 Correct 421 ms 24816 KB Output is correct
6 Correct 398 ms 25072 KB Output is correct
7 Correct 219 ms 24896 KB Output is correct
8 Correct 182 ms 24940 KB Output is correct
9 Correct 184 ms 24768 KB Output is correct
10 Correct 268 ms 24768 KB Output is correct
11 Correct 504 ms 25016 KB Output is correct
12 Correct 393 ms 24920 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 332 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 6 ms 856 KB Output is correct
42 Correct 5 ms 804 KB Output is correct
43 Correct 5 ms 860 KB Output is correct
44 Correct 5 ms 796 KB Output is correct
45 Correct 5 ms 800 KB Output is correct
46 Correct 6 ms 852 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 6 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 6 ms 856 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 804 KB Output is correct
53 Correct 4 ms 856 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 6 ms 852 KB Output is correct
56 Correct 5 ms 856 KB Output is correct
57 Correct 6 ms 852 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 5 ms 812 KB Output is correct
62 Correct 177 ms 25004 KB Output is correct
63 Correct 210 ms 24512 KB Output is correct
64 Correct 300 ms 24888 KB Output is correct
65 Correct 437 ms 24916 KB Output is correct
66 Correct 290 ms 24856 KB Output is correct
67 Correct 425 ms 24916 KB Output is correct
68 Correct 191 ms 24844 KB Output is correct
69 Correct 181 ms 24900 KB Output is correct
70 Correct 200 ms 24896 KB Output is correct
71 Correct 148 ms 25068 KB Output is correct
72 Correct 249 ms 24912 KB Output is correct
73 Correct 294 ms 24928 KB Output is correct
74 Correct 335 ms 24992 KB Output is correct
75 Correct 363 ms 24964 KB Output is correct
76 Correct 193 ms 25252 KB Output is correct
77 Correct 320 ms 24928 KB Output is correct
78 Correct 416 ms 24916 KB Output is correct
79 Correct 409 ms 25032 KB Output is correct
80 Correct 421 ms 24816 KB Output is correct
81 Correct 398 ms 25072 KB Output is correct
82 Correct 219 ms 24896 KB Output is correct
83 Correct 182 ms 24940 KB Output is correct
84 Correct 184 ms 24768 KB Output is correct
85 Correct 268 ms 24768 KB Output is correct
86 Correct 504 ms 25016 KB Output is correct
87 Correct 393 ms 24920 KB Output is correct
88 Correct 425 ms 24916 KB Output is correct
89 Correct 429 ms 24944 KB Output is correct
90 Correct 490 ms 24852 KB Output is correct
91 Correct 478 ms 24948 KB Output is correct
92 Correct 341 ms 24964 KB Output is correct
93 Correct 507 ms 24896 KB Output is correct
94 Correct 528 ms 24916 KB Output is correct
95 Correct 441 ms 24832 KB Output is correct
96 Correct 491 ms 24888 KB Output is correct
97 Correct 521 ms 24864 KB Output is correct
98 Correct 562 ms 24944 KB Output is correct
99 Correct 558 ms 24820 KB Output is correct
100 Correct 538 ms 24880 KB Output is correct
101 Correct 185 ms 24852 KB Output is correct
102 Correct 221 ms 24916 KB Output is correct
103 Correct 243 ms 24912 KB Output is correct
104 Correct 274 ms 24876 KB Output is correct
105 Correct 377 ms 24936 KB Output is correct
106 Correct 268 ms 24856 KB Output is correct
107 Correct 297 ms 24820 KB Output is correct
108 Correct 531 ms 24840 KB Output is correct
109 Correct 324 ms 24900 KB Output is correct
110 Correct 562 ms 24928 KB Output is correct
111 Correct 519 ms 24820 KB Output is correct
112 Correct 288 ms 24864 KB Output is correct
113 Correct 510 ms 24932 KB Output is correct
114 Correct 540 ms 24920 KB Output is correct
115 Correct 208 ms 24916 KB Output is correct
116 Correct 200 ms 24908 KB Output is correct
117 Correct 267 ms 24820 KB Output is correct
118 Correct 261 ms 24904 KB Output is correct
119 Correct 248 ms 24916 KB Output is correct
120 Correct 232 ms 24840 KB Output is correct