Submission #1153796

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153796		thelegendary08	Po (COCI21_po)	C++17	70 / 70	61 ms	27716 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1e5 + 5;
pii tree[mxn * 4];
int n;
int v[mxn];
void update(int k, int x){
	k += n;
	tree[k] = {x, k-n};
	for(k/=2; k>=1; k/=2){
		tree[k] = min(tree[k*2], tree[k*2+1]);
	}
}
pii quer(int l, int r){
	l += n; r += n;
	pii ret = {4e18, 0};
	while(l <= r){
		if(l % 2 == 1)ret = min(ret, tree[l++]);
		if(r % 2 == 0)ret = min(ret, tree[r--]);
		l/=2; r/=2;
	}
	return ret;
}
int nxt[mxn];
map<int, vi>m;
int solve(int l, int r){
	//dout2(l,r);
	if(l > r)return 0;
	pii mn = quer(l, r);
	int cur = mn.second;
	int lef = mn.second;
	vi splits;
	int ans=1;
	splits.pb(l-1);
	splits.pb(cur);
	while(nxt[cur] <= r && nxt[cur] != -1){
		cur = nxt[cur];
		splits.pb(cur);
	}
	splits.pb(r + 1);
	//vout(splits);
	f0r(i,splits.size() - 1){
		ans += solve(splits[i] + 1, splits[i+1] - 1);
	}
	return ans;
	
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	cin>>n;
	f0r(i,n)cin>>v[i];
	f0r(i,n){
		update(i, v[i]);
	}
	f0r(i,n)nxt[i] = -1;
	f0r(i,n){
		if(m[v[i]].size() != 0){
			nxt[m[v[i]][m[v[i]].size() - 1]] = i;
		}
		
		m[v[i]].pb(i);
	}
	//f0r(i,n)cout<<nxt[i]<<' ';
	//cout<<'\n';
	int ans = 0;
	int l = -1;
	
	f0r(i,n){
		if(v[i] == 0){
			if(l != -1){
				ans += solve(l, i-1);
				l = -1;
			}
		}
		else{
			if(l == -1)l = i;
		}
	}
	if(l != -1)ans += solve(l, n-1);
	out(ans);
}

• Subtask 1: 70 / 70