Submission #230952

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
230952	2020-05-12T07:01:53 Z	kym	Baloni (COCI15_baloni)	C++14	0 / 100	2000 ms	73312 KB

baloni

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = 1e6+5;
#ifndef LOCAL
#define cerr if(0)cout
#endif
int A[MAXN];
bool comp(int a, int b) {
	if(A[a] != A[b])return A[a] > A[b];
	else return a<b;
}
vector<int> V[MAXN];
int32_t main() 
{
	IAMSPEED
	int n; cin >> n;
	set<int,decltype(comp)*>s(comp);
	FOR(i,1,n) {
		int x; cin >> x;
		A[i]=x;
		s.insert(i);
		V[x].pb(i);
	}
	int ans = 0;
	while(s.size()) {
		//dbv(s);
		++ans;
		int lvl = A[*s.begin()];
		//db(lvl);
		int idx = *s.begin();
		s.erase(s.begin());
		auto it = upper_bound(all(V[lvl-1]),idx);
		while(lvl>0&&it!=V[lvl-1].end()) {
			idx=*it;
			s.erase(*it);
			--lvl;
			it=upper_bound(all(V[lvl-1]),idx);
		}
	}
	cout<<ans;
}

/* DEBUG
** Array bounds
** Overflow
** Edge cases
** do something instead of nothing
** write stuff down
*/

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	18 ms	23936 KB	Output isn't correct
2	Incorrect	20 ms	23936 KB	Output isn't correct
3	Incorrect	20 ms	24064 KB	Output isn't correct
4	Incorrect	20 ms	24192 KB	Output isn't correct
5	Execution timed out	2092 ms	68728 KB	Time limit exceeded
6	Execution timed out	2096 ms	73312 KB	Time limit exceeded
7	Execution timed out	2091 ms	65804 KB	Time limit exceeded
8	Execution timed out	2095 ms	64120 KB	Time limit exceeded
9	Execution timed out	2085 ms	67576 KB	Time limit exceeded
10	Execution timed out	2092 ms	68216 KB	Time limit exceeded