oj.uz

Submission #641803

# Submission time Handle Problem Language Result Execution time Memory
641803 2022-09-17T15:56:03 Z manizare Exam (eJOI20_exam) C++14
88 / 100
 257 ms 392216 KB 
#include<bits/stdc++.h>
 
#define all(a) a.begin(),a.end()
#define pb push_back
#define int long long
using namespace std ;
 
const int maxn = 5002 , maxq = 1e5+10 , mod = 998244353 ,inf = 1e18 ;
int dp[3][maxn][maxn] , n , a[maxq] , b[maxq] , l[maxq] , r[maxq] , c[maxq] , p[maxq]  ;
stack<int> s , t;

int solve(int n){
	map <int , int > m , q  ;
	int cnt = 1 ;
	for(int i = 1; i <= n ; i++){
		m[a[i]] = cnt ;
		p[cnt] = i ;
		cnt++;
	}
	cnt = 1; 
	vector <int> v , last ;
	last.pb(0);
	for(int i = 1; i <= n ; i++){
		last.pb(inf);
		if(m[b[i]] == 0)continue ;
		int ind = p[m[b[i]]] ;
		if(l[ind] < i && r[ind] > i){
			if(q[b[i]] == 0){
				q[b[i]] = cnt ;
              	cnt++;
            }
			v.pb(m[b[i]]);
		}
	}
	int ans = 0 ;
	for(int i = 0; i < v.size() ; i++){
		int x = upper_bound(all(last) , v[i])- last.begin() - 1;
		last[x+1] = min(last[x+1] , v[i]);
		ans = max(x+1 , ans); 
	}
	return ans ;
}

signed main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin >>n ;
	for(int i =1 ; i <= n ; i++){
		cin >> a[i];
	}
	for(int i= 1; i <= n ; i++){
		while(s.size() && a[i] >= a[s.top()])s.pop();
		if(s.size() == 0){
			l[i] = 0 ;
		}else{
			l[i] = s.top();
		}
		s.push(i);
	}
	for(int i = n; i >= 1 ; i--){
		while(t.size() && a[i] >= a[t.top()])t.pop();
		if(t.size() == 0){
			r[i] = n+1 ;
		}else{
			r[i] = t.top();
		}
		t.push(i);
	}
	for(int i = 1; i <= n ; i++){
		cin >> b[i] ;
	//	cout << l[i] << " " << r[i] <<"<-\n";
	}
	if(n > 5000){
		cout << solve(n) << "\n" ;
		return 0 ;
	}
	for(int i = 1; i <= n ; i++){
		for(int j =1  ; j <= n ; j++){
			dp[0][i][j] = max(dp[0][i-1][j] , dp[1][i-1][j]);
			dp[1][i][j] = max(max(dp[0][i-1][j-1] , dp[1][i-1][j-1])  , dp[1][i][j-1]) + ((j > l[i] && r[i] > j) && a[i] == b[j]) ;
		}
	}
	for(int i = 1; i <= n ; i++){
		for(int j =1 ; j <= n ; j++){
	//		cout << dp[0][i][j]  << " " << dp[1][i][j] << "       ";
		}
	//	cout << "\n";
	}
	cout << max(dp[0][n][n] , dp[1][n][n]) << "\n";
	return 0 ;
}

Compilation message

exam.cpp: In function 'long long int solve(long long int)':
exam.cpp:36:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i = 0; i < v.size() ; i++){
      |                 ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24148 KB Output is correct
2 Correct 7 ms 2004 KB Output is correct
3 Correct 45 ms 12752 KB Output is correct
4 Incorrect 13 ms 5772 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 5 ms 8252 KB Output is correct
3 Correct 46 ms 79232 KB Output is correct
4 Correct 235 ms 376364 KB Output is correct
5 Correct 219 ms 391992 KB Output is correct
6 Correct 219 ms 392056 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 33 ms 5060 KB Output is correct
3 Correct 93 ms 11548 KB Output is correct
4 Correct 94 ms 11640 KB Output is correct
5 Correct 138 ms 15976 KB Output is correct
6 Correct 147 ms 15152 KB Output is correct
7 Correct 126 ms 14580 KB Output is correct
8 Correct 89 ms 11600 KB Output is correct
9 Correct 148 ms 14700 KB Output is correct
10 Correct 83 ms 15552 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 596 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 2 ms 2504 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2508 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 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 0 ms 340 KB Output is correct
8 Correct 5 ms 8252 KB Output is correct
9 Correct 46 ms 79232 KB Output is correct
10 Correct 235 ms 376364 KB Output is correct
11 Correct 219 ms 391992 KB Output is correct
12 Correct 219 ms 392056 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 2 ms 2504 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2508 KB Output is correct
20 Correct 3 ms 2516 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 14 ms 24148 KB Output is correct
23 Correct 229 ms 392064 KB Output is correct
24 Correct 233 ms 392108 KB Output is correct
25 Correct 257 ms 392128 KB Output is correct
26 Correct 225 ms 392036 KB Output is correct
27 Correct 230 ms 392004 KB Output is correct
28 Correct 250 ms 392056 KB Output is correct
29 Correct 219 ms 392064 KB Output is correct
30 Correct 222 ms 392216 KB Output is correct
31 Correct 245 ms 392068 KB Output is correct
32 Correct 220 ms 392140 KB Output is correct