oj.uz

답안 #469247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469247 2021-08-31T08:49:38 Z Millad LIS (INOI20_lis) C++14
20 / 100
 4000 ms 116008 KB 
/// In the name of god
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#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],fen[maxn], dp[maxn], lis, pw2[25];
set <ll> A[maxn], B[maxn];
vector <ll> Qu;
int main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	pw2[0] = 1;
	for(ll i = 1; i < 22; i ++)pw2[i] = (pw2[i - 1] * 2ll);
	cin >> q;
	for(ll i = 1; i <= q; i ++){
		cin >> p[i] >> x[i];
		for(ll j = i; j <= q; j += (j & (-j)))
			fen[j] ++;
	}
	for(ll i = q; i; i --){
		ll sum = 0, cur = 0;
		for(ll j = 19; j >= 0; j --){
			if(cur + pw2[j] > q)continue;
			if(sum + fen[cur + pw2[j]] < p[i]){
				cur += pw2[j];
				sum += fen[cur];
			}
		}
		ind[i - 1] = cur;
		b[cur] = x[i];
		cur ++;
		for(; cur < q; cur += (cur & (-cur)))fen[cur] --;
	}
	set<ll>::iterator pnt;
	for(ll i = 0; i < q; i ++){
		ll id = ind[i], d = 1;
		A[b[id]].insert(id);;
		for(ll j = 1; j < b[id]; j ++){
			if(A[j].empty())continue;
			if(*A[j].begin() > id)continue;
			pnt = A[j].upper_bound(id);
			pnt --; d = max(d, dp[*pnt] + 1);
		}
		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])continue;
				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';
	}
}

Compilation message

Main.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
Main.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94272 KB Output is correct
2 Correct 49 ms 94148 KB Output is correct
3 Correct 54 ms 94508 KB Output is correct
4 Correct 53 ms 94516 KB Output is correct
5 Correct 82 ms 94404 KB Output is correct
6 Correct 68 ms 94448 KB Output is correct
7 Correct 61 ms 94468 KB Output is correct
8 Correct 59 ms 94404 KB Output is correct
9 Correct 57 ms 94472 KB Output is correct
10 Correct 57 ms 94460 KB Output is correct
11 Correct 58 ms 94464 KB Output is correct
12 Correct 60 ms 94404 KB Output is correct
13 Correct 59 ms 94608 KB Output is correct
14 Correct 68 ms 94440 KB Output is correct
15 Correct 60 ms 94556 KB Output is correct
16 Correct 61 ms 94484 KB Output is correct
17 Correct 65 ms 94476 KB Output is correct
18 Correct 63 ms 94488 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94272 KB Output is correct
2 Correct 49 ms 94148 KB Output is correct
3 Correct 54 ms 94508 KB Output is correct
4 Correct 53 ms 94516 KB Output is correct
5 Correct 82 ms 94404 KB Output is correct
6 Correct 68 ms 94448 KB Output is correct
7 Correct 61 ms 94468 KB Output is correct
8 Correct 59 ms 94404 KB Output is correct
9 Correct 57 ms 94472 KB Output is correct
10 Correct 57 ms 94460 KB Output is correct
11 Correct 58 ms 94464 KB Output is correct
12 Correct 60 ms 94404 KB Output is correct
13 Correct 59 ms 94608 KB Output is correct
14 Correct 68 ms 94440 KB Output is correct
15 Correct 60 ms 94556 KB Output is correct
16 Correct 61 ms 94484 KB Output is correct
17 Correct 65 ms 94476 KB Output is correct
18 Correct 63 ms 94488 KB Output is correct
19 Correct 380 ms 115972 KB Output is correct
20 Correct 369 ms 116008 KB Output is correct
21 Execution timed out 4093 ms 100488 KB Time limit exceeded
22 Halted 0 ms 0 KB -