제출 #833417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833417		vjudge1	Exam (eJOI20_exam)	C++17	0 / 100	3 ms	852 KiB

exam

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define pll pair<long long, long long>
#define loop(i,n) for(int i=1;i<=n;i++)
#define loop0(i,n) for(int i=0;i<n;i++)
using namespace std;

//pbds template
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

ll n;
ll arr[5005] = {0};
ll beda[5005] = {0};
map<ll,ll> mp;
map<ll,ll> mp2;

void case1(ll chk){
	if(!mp.count(chk)){
		cout << "0" << endl;
		return;
	}
	priority_queue<ll> pq;
	ll ans = 0;
	for(int i=1;i<=n;i++){
//		cout << i << ' ' << pq.size() << endl;
		if(arr[i]>chk){
			if(pq.empty()) continue;
			if(pq.top()==chk) ans += pq.size();
			pq = priority_queue<ll>();
		}
		else if(arr[i]<=chk) pq.push(arr[i]);
	}
	if(!pq.empty()&&pq.top()==chk){
		ans += pq.size();
	}
	cout << ans << endl;
}

void solve(){
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> arr[i];
		mp[arr[i]] = 1;
	}
	for(int i=1;i<=n;i++){
		cin >> beda[i];
		mp2[beda[i]] = 1;
	}
	if(mp2.size()==1){
		case1(beda[1]);
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tc = 1;
//	cin >> tc;
	while(tc--){
	   solve();
	}
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22