제출 #1100479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1100479		Muhammet	Money (IZhO17_money)	C++17	0 / 100	1 ms	2384 KiB

money

#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second

const int N = 1e6 + 5;

int n, b[N], vis[N], in[N];

int main(){
	cin >> n;
	vector <int> a(n+1);
	vector <pair<int,int>> v;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		v.push_back({a[i],i});
	}
	sort(v.begin(), v.end());
	for(int i = 0; i < n-1; i++){
		b[v[i].ff] = v[i+1].ff;
	}
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		if(vis[i] == 0){
			cnt++;
			vis[i] = cnt;
		}
		if((i < n) and (a[i] == a[i+1] or b[a[i]] == a[i+1])){
			vis[i+1] = cnt;
		}
		// cout << vis[i] << ' ';
	}
	// cout << '\n';
	for(int i = 0; i < n; i++){
		// cout << vis[v[i].ss] << ' ';
		in[vis[v[i].ss]] = i;
	}
	cnt = n;
	for(int i = 0; i < n-1; i++){
		if(vis[v[i].ss] != vis[v[i+1].ss]){
			if(vis[in[vis[v[i+1].ss]]+1]+1 == vis[v[i].ss]){
				cnt--;
			}
		}
		else {
			cnt--;
		}
	}
	cout << cnt;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55