oj.uz

Submission #463548

# Submission time Handle Problem Language Result Execution time Memory
463548 2021-08-11T10:03:59 Z Kerim Exam (eJOI20_exam) C++17
65 / 100
 1000 ms 12208 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#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;
}
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;
	tr(it,pm)it->ss=++c;
	for(int i=1;i<=n;i++){
		l[i]=i-1;
		r[i]=i+1;
		while(l[i]>=1 and a[l[i]]<a[i])l[i]--;
		while(r[i]<=n and a[r[i]]<a[i])r[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:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
exam.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d",a+i),pm[a[i]]=1;
      |   ~~~~~^~~~~~~~~~
exam.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |   scanf("%d",b+i),pm[b[i]]=1;
      |   ~~~~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 55 ms 3152 KB Output is correct
3 Execution timed out 1085 ms 7828 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 4 ms 2764 KB Output is correct
4 Correct 14 ms 3076 KB Output is correct
5 Correct 13 ms 3148 KB Output is correct
6 Correct 13 ms 3096 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3148 KB Output is correct
2 Correct 57 ms 6460 KB Output is correct
3 Correct 206 ms 12052 KB Output is correct
4 Correct 206 ms 12208 KB Output is correct
5 Execution timed out 1080 ms 8420 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

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

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 4 ms 2764 KB Output is correct
10 Correct 14 ms 3076 KB Output is correct
11 Correct 13 ms 3148 KB Output is correct
12 Correct 13 ms 3096 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2636 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2700 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 3 ms 2764 KB Output is correct
23 Correct 27 ms 2824 KB Output is correct
24 Correct 12 ms 2764 KB Output is correct
25 Correct 6 ms 2764 KB Output is correct
26 Correct 4 ms 2764 KB Output is correct
27 Correct 6 ms 2816 KB Output is correct
28 Correct 7 ms 3020 KB Output is correct
29 Correct 10 ms 3020 KB Output is correct
30 Correct 10 ms 3000 KB Output is correct
31 Correct 11 ms 3020 KB Output is correct
32 Correct 8 ms 3024 KB Output is correct