# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84335 | zoooma13 | Baloni (COCI15_baloni) | C++14 | 2077 ms | 132096 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 1000006
int GIR; char GIC;
inline int GI() {
GIR = 0 ,GIC = getchar();
while(GIC < '0' || '9' < GIC)
GIC = getchar();
while('0' <= GIC && GIC <= '9') {
GIR = (GIR * 10) + (GIC - '0');
GIC = getchar();
}
return GIR;
}
int N ,A;
set <int> ss[MAX_N];
multiset <int> ms;
int main()
{
N = GI(); assert(N < MAX_N);
for(int i=0; i<N; i++)
{
A = GI();
ss[A].insert(i);
ms.insert(A);
}
int Ans = 0;
set<int>::iterator it;
while(!ms.empty())
{
int i = *prev(ms.end());
int j = -1;
while(true)
{
it = ss[i].upper_bound(j);
if(it == ss[i].end())
break;
j = *it;
ss[i].erase(it);
ms.erase(ms.find(i--));
}
Ans++;
}
cout << Ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |