oj.uz

답안 #463550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
463550 2021-08-11T10:05:34 Z Kerim Exam (eJOI20_exam) C++17
65 / 100
 1000 ms 14520 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;
}
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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4980 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5068 KB Output is correct
2 Correct 57 ms 5456 KB Output is correct
3 Execution timed out 1089 ms 10124 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 16 ms 5428 KB Output is correct
5 Correct 14 ms 5536 KB Output is correct
6 Correct 15 ms 5452 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5452 KB Output is correct
2 Correct 57 ms 8824 KB Output is correct
3 Correct 215 ms 14480 KB Output is correct
4 Correct 189 ms 14520 KB Output is correct
5 Execution timed out 1093 ms 10712 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4980 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 4 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4980 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 4 ms 5068 KB Output is correct
9 Correct 6 ms 5196 KB Output is correct
10 Correct 16 ms 5428 KB Output is correct
11 Correct 14 ms 5536 KB Output is correct
12 Correct 15 ms 5452 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 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 28 ms 5192 KB Output is correct
24 Correct 13 ms 5068 KB Output is correct
25 Correct 7 ms 5196 KB Output is correct
26 Correct 6 ms 5196 KB Output is correct
27 Correct 6 ms 5172 KB Output is correct
28 Correct 8 ms 5452 KB Output is correct
29 Correct 11 ms 5324 KB Output is correct
30 Correct 12 ms 5324 KB Output is correct
31 Correct 14 ms 5324 KB Output is correct
32 Correct 10 ms 5324 KB Output is correct