oj.uz

답안 #833178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833178 2023-08-22T02:49:56 Z vjudge1 Exam (eJOI20_exam) C++17
12 / 100
 60 ms 3112 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
using namespace std;
int n, h[100010], t[100010], ans;
bool vis[100010];
vector<int> tmp;

void sub2(){
	for(auto i : tmp){
		vis[i]=1; 
		ans++;
		int l=i, r=i;
		while(l-1>=1 && !vis[l-1]){
			l--;
			vis[l]=1;
			if(h[l]>=h[i]) break;
			ans++;
		}
		while(r+1<=n && !vis[r+1]){
			r++;
			vis[r]=1;
			if(h[r]>=h[i]) break;
			ans++;
		}
	}	
}

void sub3(){
	set<int> tmp;
	for(int i=n; i>=1; i--){
		tmp.insert(h[i]);
		if(tmp.find(t[i])!=tmp.end()){
			ans++;
		}
	}
}

int main(){
	bool s2=1, s3=1;
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> h[i];
		if(i>1 && h[i]<=h[i-1])s3=0;
	}
	for(int i=1; i<=n; i++){
		cin >> t[i];
		if(t[i]==h[i]){
			tmp.pb(i);
		}
		if(i>1 && t[i]!=t[i-1]) s2=0;	
	}
	if(s2){
		sub2();
	}
	else if(s3){
		sub3();
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 12 ms 852 KB Output is correct
3 Correct 41 ms 2188 KB Output is correct
4 Correct 21 ms 1492 KB Output is correct
5 Correct 57 ms 3112 KB Output is correct
6 Correct 25 ms 1740 KB Output is correct
7 Correct 31 ms 1704 KB Output is correct
8 Correct 60 ms 2892 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -