Submission #402566

#	Time	Username	Problem	Language	Result	Execution time	Memory
402566		penguinhacker	Exercise Deadlines (CCO20_day1problem2)	C++14	25 / 25	309 ms	22748 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

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

const int mxN=2e5;
int n, a[mxN];
vector<int> oc[mxN];
ll ans;
set<int> s;
tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> t;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i=0; i<n; ++i) {
		cin >> a[i], --a[i];
		oc[a[i]].push_back(i);
	}
	for (int i=n-1; ~i; --i) {
		for (int j : oc[i])
			s.insert(j);
		if (s.empty()) {
			cout << -1;
			return 0;
		}
		int x=*s.rbegin();
		s.erase(--s.end());
		t.insert(x);
		x-=t.order_of_key(x);
		ans+=i-x;
	}
	cout << ans;
	return 0;
}

• Subtask 1: 17 / 17
• Subtask 2: 8 / 8