# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
251674 |
2020-07-22T07:10:28 Z |
VEGAnn |
Baloni (COCI15_baloni) |
C++14 |
|
2000 ms |
131076 KB |
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 1000100;
const int C = 22;
const int md = 10007;
set<i2> st;
set<int> ps[N];
set<int>::iterator iter;
int n, a[N], ans, nt[N], pos[N];
int mult(int x, int y) { return (x * y) % md; }
void SUM(int &x, int y){
x += y;
if (x >= md)
x -= md;
}
int main() {
#ifdef _LOCAL
freopen("in.txt","r",stdin); // freopen("output.txt","w",stdout);
#else
// freopen("mining.in","r",stdin); freopen("mining.out","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i > 0; i--){
nt[i] = pos[a[i] - 1];
pos[a[i]] = i;
st.insert({a[i], -i});
ps[a[i]].insert(i);
}
while (sz(st) > 0){
ans++;
i2 cr = (*(--st.end()));
st.erase(cr);
int pst = -cr[1], vl = cr[0];
while (pst != 0){
if (sz(ps[vl - 1]) == 0) break;
iter = ps[vl - 1].upper_bound(pst);
if (iter == ps[vl - 1].end()) break;
ps[vl - 1].erase(iter);
pst = *iter;
vl--;
st.erase({a[pst], -pst});
}
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
47480 KB |
Output is correct |
2 |
Correct |
31 ms |
47480 KB |
Output is correct |
3 |
Correct |
27 ms |
47744 KB |
Output is correct |
4 |
Correct |
28 ms |
47872 KB |
Output is correct |
5 |
Execution timed out |
2021 ms |
127992 KB |
Time limit exceeded |
6 |
Runtime error |
1147 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
7 |
Correct |
1785 ms |
121812 KB |
Output is correct |
8 |
Correct |
1960 ms |
120752 KB |
Output is correct |
9 |
Correct |
1838 ms |
124828 KB |
Output is correct |
10 |
Correct |
1994 ms |
127964 KB |
Output is correct |