oj.uz

답안 #534062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534062 2022-03-07T22:42:01 Z farhan132 Financial Report (JOI21_financial) C++17
100 / 100
 609 ms 25572 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>



using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctz(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)

const ll mod =  (ll) 998244353;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

bool USACO = 0;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less< ll >, rb_tree_tag,tree_order_statistics_node_update>

const ll N = 5e5 + 5;

struct seg_tree{

  struct typo{
    ll mx;
    void setup(){
      mx = 0;
    }
  };

  vector < typo > b;
  ll n;

  void init(ll l, ll r, ll node){
    b[node].setup();
    return;
  }

  typo merge(typo a, typo b){
    typo c;
    c.mx = max({a.mx , b.mx});
    return c;
  }

  void build(ll l, ll r, ll node){
    if(l == r){
      init(l,r,node);
      return;
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    build(l, mid , n1);
    build(mid+1, r, n2);
    b[node] = merge(b[n1] , b[n2]);
    return;
  }

  void build(ll _n){
    n = _n;
    b.resize(0);
    b.resize(4*n);
    build(1,n,1); // optional
  }

  void up(ll l, ll r, ll node, ll x, ll y, ll v){
    if(y < l || x > r) return;
    if(x <= l && y >= r){
      b[node].mx = v;

      return;
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    up(l , mid , n1 , x , y , v);
    up(mid + 1, r, n2, x, y , v);
    b[node] = merge(b[n1] , b[n2]);
    return;
  }

  void up(ll x, ll y, ll v){
    up(1,n,1,x,y,v);
    return;
  }
  
  typo get(ll l, ll r, ll node, ll x, ll y){
    if(y < l || x > r) return {0};
    if(x <= l && y >= r){
      return b[node];
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    return merge(get(l , mid , n1 , x , y) , get(mid + 1, r , n2 , x , y));
  }

  ll get(ll l, ll r){
    return get(1,n,1,l,r).mx;
  }

  /* Final Check!!!
     1. Typo, Okay?
     2. Init Okay? (Build!!)
     3. Merge, Okay?
     4. Lazy Needed ? YES | NO (if NO, REMOVE anything related to lazy prop)
     5. Dummy?
     6. Check Update, Get, etc function's Merge, Lazy Prop , Init :D
     7, Even after a WA, check for possible Out Of Bound/MLE/RE cases
  */

}T;

set < ii > s;
set < ll > t;
ll n , d; 
void add(ll l, ll r){
	if(r < l) return;
	if(r - l + 1 < d) return;
	s.in({l , r});
	t.in(r);
	return;
}
void rem(ll x){
	auto p = s.lower_bound({x + 1, -1});
	if(p == s.begin()) return;
	p--;
	auto [l , r] = *p;
	if(l <= x && x <= r){
	    s.erase({l, r});
	    t.erase(r);
	    add(l, x-1);
	    add(x+1, r);
	}
	return;
}

void solve(){
	
	cin >> n >> d;
	vector < ii > idx;
	for(ll i = 1; i <= n; i++){
		ll a; cin >> a;
		idx.pb({a , -i});
	}
	T.build(n);
	t.in(0);
	add(1,n);
	sort(idx.begin(), idx.end());
	ll ans = 1;


	for(auto [val , i] : idx){
		i = -i;
		rem(i);
		auto p = --t.upper_bound(i);
		ll j = *p; j = min(j+1, i);
		ll mx = T.get(j, i) + 1;
		ans = max(mx , ans);
		T.up(i,i, mx);

	}
	cout << ans << '\n';

   return;
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
      
    #endif
    //pre(N);
    
    ll T = 1;
    //cin >> T;
    ll CT = 0;
    while(T--){
      //  cout << "Case #" << ++CT <<": " ;
        solve();
    }
 
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:226:8: warning: unused variable 'CT' [-Wunused-variable]
  226 |     ll CT = 0;
      |        ^~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 9 ms 804 KB Output is correct
42 Correct 10 ms 844 KB Output is correct
43 Correct 4 ms 716 KB Output is correct
44 Correct 4 ms 684 KB Output is correct
45 Correct 4 ms 716 KB Output is correct
46 Correct 4 ms 840 KB Output is correct
47 Correct 6 ms 844 KB Output is correct
48 Correct 5 ms 844 KB Output is correct
49 Correct 4 ms 844 KB Output is correct
50 Correct 4 ms 844 KB Output is correct
51 Correct 6 ms 844 KB Output is correct
52 Correct 7 ms 844 KB Output is correct
53 Correct 3 ms 844 KB Output is correct
54 Correct 3 ms 840 KB Output is correct
55 Correct 5 ms 844 KB Output is correct
56 Correct 4 ms 844 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 3 ms 844 KB Output is correct
59 Correct 3 ms 840 KB Output is correct
60 Correct 3 ms 804 KB Output is correct
61 Correct 4 ms 844 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 14544 KB Output is correct
2 Correct 334 ms 22456 KB Output is correct
3 Correct 438 ms 22620 KB Output is correct
4 Correct 609 ms 25572 KB Output is correct
5 Correct 403 ms 23280 KB Output is correct
6 Correct 595 ms 25480 KB Output is correct
7 Correct 159 ms 17248 KB Output is correct
8 Correct 153 ms 17420 KB Output is correct
9 Correct 160 ms 17324 KB Output is correct
10 Correct 180 ms 17456 KB Output is correct
11 Correct 409 ms 17704 KB Output is correct
12 Correct 445 ms 18328 KB Output is correct
13 Correct 334 ms 17328 KB Output is correct
14 Correct 414 ms 17960 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 14520 KB Output is correct
2 Correct 172 ms 14544 KB Output is correct
3 Correct 203 ms 14740 KB Output is correct
4 Correct 178 ms 14432 KB Output is correct
5 Correct 159 ms 14532 KB Output is correct
6 Correct 206 ms 14536 KB Output is correct
7 Correct 110 ms 14540 KB Output is correct
8 Correct 107 ms 14540 KB Output is correct
9 Correct 122 ms 14452 KB Output is correct
10 Correct 159 ms 14420 KB Output is correct
11 Correct 169 ms 14512 KB Output is correct
12 Correct 153 ms 14536 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 9 ms 804 KB Output is correct
42 Correct 10 ms 844 KB Output is correct
43 Correct 4 ms 716 KB Output is correct
44 Correct 4 ms 684 KB Output is correct
45 Correct 4 ms 716 KB Output is correct
46 Correct 4 ms 840 KB Output is correct
47 Correct 6 ms 844 KB Output is correct
48 Correct 5 ms 844 KB Output is correct
49 Correct 4 ms 844 KB Output is correct
50 Correct 4 ms 844 KB Output is correct
51 Correct 6 ms 844 KB Output is correct
52 Correct 7 ms 844 KB Output is correct
53 Correct 3 ms 844 KB Output is correct
54 Correct 3 ms 840 KB Output is correct
55 Correct 5 ms 844 KB Output is correct
56 Correct 4 ms 844 KB Output is correct
57 Correct 4 ms 844 KB Output is correct
58 Correct 3 ms 844 KB Output is correct
59 Correct 3 ms 840 KB Output is correct
60 Correct 3 ms 804 KB Output is correct
61 Correct 4 ms 844 KB Output is correct
62 Correct 140 ms 14544 KB Output is correct
63 Correct 334 ms 22456 KB Output is correct
64 Correct 438 ms 22620 KB Output is correct
65 Correct 609 ms 25572 KB Output is correct
66 Correct 403 ms 23280 KB Output is correct
67 Correct 595 ms 25480 KB Output is correct
68 Correct 159 ms 17248 KB Output is correct
69 Correct 153 ms 17420 KB Output is correct
70 Correct 160 ms 17324 KB Output is correct
71 Correct 180 ms 17456 KB Output is correct
72 Correct 409 ms 17704 KB Output is correct
73 Correct 445 ms 18328 KB Output is correct
74 Correct 334 ms 17328 KB Output is correct
75 Correct 414 ms 17960 KB Output is correct
76 Correct 117 ms 14520 KB Output is correct
77 Correct 172 ms 14544 KB Output is correct
78 Correct 203 ms 14740 KB Output is correct
79 Correct 178 ms 14432 KB Output is correct
80 Correct 159 ms 14532 KB Output is correct
81 Correct 206 ms 14536 KB Output is correct
82 Correct 110 ms 14540 KB Output is correct
83 Correct 107 ms 14540 KB Output is correct
84 Correct 122 ms 14452 KB Output is correct
85 Correct 159 ms 14420 KB Output is correct
86 Correct 169 ms 14512 KB Output is correct
87 Correct 153 ms 14536 KB Output is correct
88 Correct 498 ms 22128 KB Output is correct
89 Correct 428 ms 20768 KB Output is correct
90 Correct 296 ms 18580 KB Output is correct
91 Correct 216 ms 17352 KB Output is correct
92 Correct 166 ms 17532 KB Output is correct
93 Correct 209 ms 17344 KB Output is correct
94 Correct 178 ms 17348 KB Output is correct
95 Correct 383 ms 21380 KB Output is correct
96 Correct 287 ms 18724 KB Output is correct
97 Correct 223 ms 17692 KB Output is correct
98 Correct 215 ms 17444 KB Output is correct
99 Correct 174 ms 17396 KB Output is correct
100 Correct 195 ms 17468 KB Output is correct
101 Correct 205 ms 17340 KB Output is correct
102 Correct 127 ms 17440 KB Output is correct
103 Correct 157 ms 17440 KB Output is correct
104 Correct 163 ms 17328 KB Output is correct
105 Correct 159 ms 17324 KB Output is correct
106 Correct 170 ms 17328 KB Output is correct
107 Correct 192 ms 17504 KB Output is correct
108 Correct 176 ms 17452 KB Output is correct
109 Correct 283 ms 17444 KB Output is correct
110 Correct 224 ms 17768 KB Output is correct
111 Correct 181 ms 17440 KB Output is correct
112 Correct 165 ms 17416 KB Output is correct
113 Correct 191 ms 17540 KB Output is correct
114 Correct 171 ms 17336 KB Output is correct
115 Correct 136 ms 17384 KB Output is correct
116 Correct 115 ms 17436 KB Output is correct
117 Correct 139 ms 17316 KB Output is correct
118 Correct 137 ms 17448 KB Output is correct
119 Correct 155 ms 17428 KB Output is correct
120 Correct 159 ms 17416 KB Output is correct