oj.uz

Submission #467315

# Submission time Handle Problem Language Result Execution time Memory
467315 2021-08-22T14:23:51 Z Khizri Exam (eJOI20_exam) C++17
14 / 100
 1000 ms 117084 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=5000+5;
int t=1,n,a[mxn],b[mxn],dp[mxn][mxn],ans=0,val;
map<vector<int>,bool>mp;
int cal(vector<int>vt){
	int ans=0;
	for(int i=0;i<vt.size();i++){
		if(b[i+1]==vt[i]){
			ans++;
		}
	}
	return ans;
}
void funk(vector<int>vt,int l,int r){
	if(l!=-1){
		int x=0;
		for(int i=l;i<=r;i++){
			x=max(x,vt[i]);
		}
		for(int i=l;i<=r;i++){
			vt[i]=x;
		}
	}
	if(mp[vt]){
		return;
	}
	mp[vt]=1;
	ans=max(ans,cal(vt));
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			funk(vt,i,j);
		}
	}
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		val=max(a[i],val);
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
	}
	memset(dp,-1,sizeof(dp));
	vector<int>vt;
	for(int i=1;i<=n;i++){
		vt.pb(a[i]);
	}
	funk(vt,-1,-1);
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

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

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 98240 KB Output is correct
2 Correct 40 ms 98292 KB Output is correct
3 Correct 41 ms 98280 KB Output is correct
4 Correct 41 ms 98240 KB Output is correct
5 Correct 43 ms 98356 KB Output is correct
6 Correct 263 ms 100396 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 103380 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 878 ms 106520 KB Output is correct
2 Execution timed out 1087 ms 100428 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 117084 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 98240 KB Output is correct
2 Correct 40 ms 98292 KB Output is correct
3 Correct 41 ms 98280 KB Output is correct
4 Correct 41 ms 98240 KB Output is correct
5 Correct 43 ms 98356 KB Output is correct
6 Correct 263 ms 100396 KB Output is correct
7 Correct 61 ms 98552 KB Output is correct
8 Execution timed out 1090 ms 98840 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 98240 KB Output is correct
2 Correct 40 ms 98292 KB Output is correct
3 Correct 41 ms 98280 KB Output is correct
4 Correct 41 ms 98240 KB Output is correct
5 Correct 43 ms 98356 KB Output is correct
6 Correct 263 ms 100396 KB Output is correct
7 Correct 878 ms 106520 KB Output is correct
8 Execution timed out 1087 ms 100428 KB Time limit exceeded
9 Halted 0 ms 0 KB -