oj.uz

Submission #463562

# Submission time Handle Problem Language Result Execution time Memory
463562 2021-08-11T10:11:45 Z Kerim Exam (eJOI20_exam) C++17
66 / 100
 221 ms 14968 KB 
#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;
 
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int a[MAXN],b[MAXN],n,c,ans;
map<int,int>pm;
vector<int>adj[MAXN];
int F[MAXN],l[MAXN],r[MAXN];
void upd(int x,int val){
	for(;x<MAXN;x+=x&(-x))
		umax(F[x],val);
}
int tap(int x){
	int res=0;
	for(;x;x-=x&(-x))
		umax(res,F[x]);
	return res;
}
bool subtask2(){
	for(int i=1;i<=n;i++)
		if(b[i]!=b[1])
			return 0;
	return 1;
}
set<int>s;
int main(){
    //~ freopen("file.in", "r", stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)	
		scanf("%d",a+i),pm[a[i]]=1;
	for(int i=1;i<=n;i++)
		scanf("%d",b+i),pm[b[i]]=1;
	a[0]=a[n+1]=INF;
	if(subtask2()){
		int ans=0;
		for(int i=1;i<=n+1;i++){
			if(a[i]>b[1]){
				if(s.count(b[1]))
					ans+=s.size();
				s.clear();
			}	
			else
				s.insert(a[i]);
		}
		printf("%d\n",ans);
		return 0;
	}
	tr(it,pm)it->ss=++c;
	stack<int>st;
	st.push(0);
	for(int i=1;i<=n;i++){
		while(!st.empty() and a[st.top()]<a[i])st.pop();
		l[i]=st.top();
		st.push(i);
	}
	while(!st.empty())st.pop();
	st.push(n+1);
	for(int i=n;i>=1;i--){
		while(!st.empty() and a[st.top()]<a[i])st.pop();
		r[i]=st.top();
		st.push(i);
	}
	for(int i=1;i<=n;i++)adj[pm[a[i]]].pb(i);
	for(int i=1;i<=n;i++){
		vector<int>&v=adj[pm[b[i]]];
		if(v.empty())continue;
		for(int ind=v.size()-1;ind>=0;ind--){
			int j=v[ind];
			if(i<=l[j] or r[j]<=i)continue;
			int dp=tap(j)+1;
			umax(ans,dp);
			upd(j,dp);
		}
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
exam.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d",a+i),pm[a[i]]=1;
      |   ~~~~~^~~~~~~~~~
exam.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   scanf("%d",b+i),pm[b[i]]=1;
      |   ~~~~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 8 ms 5452 KB Output is correct
5 Correct 7 ms 5540 KB Output is correct
6 Correct 8 ms 5476 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5452 KB Output is correct
2 Correct 58 ms 8892 KB Output is correct
3 Correct 189 ms 14548 KB Output is correct
4 Correct 212 ms 14596 KB Output is correct
5 Correct 140 ms 14716 KB Output is correct
6 Correct 132 ms 14772 KB Output is correct
7 Correct 146 ms 14968 KB Output is correct
8 Correct 191 ms 14684 KB Output is correct
9 Correct 221 ms 14772 KB Output is correct
10 Correct 97 ms 14760 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 6 ms 5196 KB Output is correct
10 Correct 8 ms 5452 KB Output is correct
11 Correct 7 ms 5540 KB Output is correct
12 Correct 8 ms 5476 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 4 ms 5032 KB Output is correct
23 Incorrect 4 ms 4940 KB Output isn't correct
24 Halted 0 ms 0 KB -