oj.uz

답안 #469210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469210 2021-08-31T06:16:08 Z Millad LIS (INOI20_lis) C++14
100 / 100
 2590 ms 217964 KB 
/// In the name of god
#include <bits/stdc++.h>


#define F first
#define S second
#define pb push_back
#define debug(x) cerr << #x << " : " << x << '\n'
     
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll, ll> pll;
     
const ll maxn = 1e6 + 5;

ll q, x[maxn], p[maxn], b[maxn], ind[maxn], seg[maxn * 4], dp[maxn], lis;
set <ll> A[maxn], B[maxn];
vector <ll> Qu;
inline ll get_ind(ll id, ll ps = 0, ll v = 1, ll s = 0, ll e = q){
	if(e - s == 1){
		seg[v] = 1;
		return s;
	}
	ll mid = (e + s) >> 1, lc = v << 1, rc = lc | 1, ind;
	if(ps + (mid - s) - seg[lc] < id)ind = get_ind(id, ps + (mid - s) - seg[lc], rc, mid, e);
	else ind = get_ind(id, ps, lc, s, mid);
	seg[v] = seg[lc] + seg[rc];
	return ind;
}
int main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> q;
	for(ll i = 0; i < q; i ++)cin >> p[i] >> x[i];
	for(ll i = q - 1; i >= 0; i --){
		ind[i] = get_ind(p[i]);
		b[ind[i]] = x[i];
	}
	set<ll>::iterator pnt;
	for(ll i = 0; i < q; i ++){
		ll id = ind[i], d = 0;
		A[x[i]].insert(id);
		for(ll j = 1; j < x[i]; j ++){
			if(A[j].empty())continue;
			if(*A[j].begin() > id)continue;
			if(*A[j].rbegin() < id){
              d = max(d, dp[*A[j].rbegin()]);
              continue;
            }	
          	pnt = A[j].upper_bound(id);
			pnt --; d = max(d, dp[*pnt]);
		}
      	d ++;
		dp[id] = d; B[d].insert(id);
		Qu.pb(id); lis = max(lis, d);
		while(Qu.size()){
			ll id2 = Qu.back(); Qu.pop_back();
			pnt = B[dp[id2]].lower_bound(id2);
			vector <ll> vec;
			while(true){
				pnt ++;
				if(pnt == B[dp[id2]].end())break;
				if(b[*pnt] < b[id2])break;
				if(b[*pnt] == b[id2])break;
				vec.pb(*pnt);
			}
			for(ll j : vec){
				B[dp[j]].erase(j);
				dp[j] ++; lis = max(lis, dp[j]);
				B[dp[j]].insert(j); Qu.pb(j); 
			}
		}
		cout << lis << '\n';
	}
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 94152 KB Output is correct
2 Correct 54 ms 94252 KB Output is correct
3 Correct 59 ms 94500 KB Output is correct
4 Correct 54 ms 94524 KB Output is correct
5 Correct 80 ms 94504 KB Output is correct
6 Correct 65 ms 94520 KB Output is correct
7 Correct 65 ms 94428 KB Output is correct
8 Correct 62 ms 94520 KB Output is correct
9 Correct 65 ms 94456 KB Output is correct
10 Correct 58 ms 94532 KB Output is correct
11 Correct 58 ms 94460 KB Output is correct
12 Correct 63 ms 94440 KB Output is correct
13 Correct 71 ms 94520 KB Output is correct
14 Correct 60 ms 94404 KB Output is correct
15 Correct 60 ms 94440 KB Output is correct
16 Correct 61 ms 94516 KB Output is correct
17 Correct 72 ms 94516 KB Output is correct
18 Correct 60 ms 94628 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 94152 KB Output is correct
2 Correct 54 ms 94252 KB Output is correct
3 Correct 59 ms 94500 KB Output is correct
4 Correct 54 ms 94524 KB Output is correct
5 Correct 80 ms 94504 KB Output is correct
6 Correct 65 ms 94520 KB Output is correct
7 Correct 65 ms 94428 KB Output is correct
8 Correct 62 ms 94520 KB Output is correct
9 Correct 65 ms 94456 KB Output is correct
10 Correct 58 ms 94532 KB Output is correct
11 Correct 58 ms 94460 KB Output is correct
12 Correct 63 ms 94440 KB Output is correct
13 Correct 71 ms 94520 KB Output is correct
14 Correct 60 ms 94404 KB Output is correct
15 Correct 60 ms 94440 KB Output is correct
16 Correct 61 ms 94516 KB Output is correct
17 Correct 72 ms 94516 KB Output is correct
18 Correct 60 ms 94628 KB Output is correct
19 Correct 231 ms 117272 KB Output is correct
20 Correct 268 ms 117408 KB Output is correct
21 Correct 499 ms 117800 KB Output is correct
22 Correct 588 ms 117432 KB Output is correct
23 Correct 372 ms 117496 KB Output is correct
24 Correct 394 ms 117460 KB Output is correct
25 Correct 401 ms 117580 KB Output is correct
26 Correct 423 ms 117420 KB Output is correct
27 Correct 399 ms 117444 KB Output is correct
28 Correct 409 ms 117444 KB Output is correct
29 Correct 362 ms 117520 KB Output is correct
30 Correct 401 ms 117480 KB Output is correct
31 Correct 756 ms 117448 KB Output is correct
32 Correct 777 ms 117476 KB Output is correct
33 Correct 698 ms 117392 KB Output is correct
34 Correct 696 ms 117452 KB Output is correct
35 Correct 723 ms 117548 KB Output is correct
36 Correct 827 ms 117380 KB Output is correct
37 Correct 831 ms 117412 KB Output is correct
38 Correct 821 ms 117436 KB Output is correct
39 Correct 842 ms 117520 KB Output is correct
40 Correct 860 ms 117432 KB Output is correct
41 Correct 206 ms 112840 KB Output is correct
42 Correct 89 ms 97776 KB Output is correct
43 Correct 436 ms 112800 KB Output is correct
44 Correct 587 ms 106612 KB Output is correct
45 Correct 75 ms 96164 KB Output is correct
46 Correct 66 ms 94628 KB Output is correct
47 Correct 171 ms 102972 KB Output is correct
48 Correct 125 ms 100180 KB Output is correct
49 Correct 67 ms 95632 KB Output is correct
50 Correct 63 ms 94692 KB Output is correct
51 Correct 108 ms 99632 KB Output is correct
52 Correct 248 ms 109032 KB Output is correct
53 Correct 228 ms 106784 KB Output is correct
54 Correct 220 ms 105564 KB Output is correct
55 Correct 87 ms 96944 KB Output is correct
56 Correct 256 ms 103704 KB Output is correct
57 Correct 122 ms 98276 KB Output is correct
58 Correct 108 ms 97772 KB Output is correct
59 Correct 71 ms 95144 KB Output is correct
60 Correct 380 ms 107616 KB Output is correct
61 Correct 55 ms 94404 KB Output is correct
62 Correct 196 ms 100720 KB Output is correct
63 Correct 136 ms 97788 KB Output is correct
64 Correct 298 ms 104104 KB Output is correct
65 Correct 251 ms 103076 KB Output is correct
66 Correct 104 ms 96680 KB Output is correct
67 Correct 215 ms 101136 KB Output is correct
68 Correct 153 ms 98936 KB Output is correct
69 Correct 217 ms 103028 KB Output is correct
70 Correct 84 ms 96280 KB Output is correct
71 Correct 2522 ms 217956 KB Output is correct
72 Correct 2467 ms 217872 KB Output is correct
73 Correct 2525 ms 217860 KB Output is correct
74 Correct 2590 ms 217956 KB Output is correct
75 Correct 2378 ms 217872 KB Output is correct
76 Correct 2417 ms 217964 KB Output is correct