# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
650114 |
2022-10-12T13:06:33 Z |
dozer |
Baloni (COCI15_baloni) |
C++14 |
|
91 ms |
31000 KB |
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define N 1000005
#define int long long
vector<int> h[N];
int arr[N];
int32_t main()
{
fastio();
int n;
cin>>n;
for (int i = 1; i <= n; i++)
cin>>arr[i];
for (int i = n; i >= 1; i--)
{
if (h[arr[i] - 1].empty())
h[arr[i]].pb(1);
else
{
int t = h[arr[i] - 1].back();
h[arr[i] - 1].pop_back();
h[arr[i]].pb(t + 1);
}
}
int ans = 0;
for (int i = 1; i < N; i++) ans += h[i].size();
cout<<ans<<endl;
cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
23764 KB |
Output is correct |
2 |
Correct |
15 ms |
23816 KB |
Output is correct |
3 |
Correct |
16 ms |
23892 KB |
Output is correct |
4 |
Correct |
16 ms |
23896 KB |
Output is correct |
5 |
Correct |
84 ms |
30212 KB |
Output is correct |
6 |
Correct |
77 ms |
31000 KB |
Output is correct |
7 |
Correct |
72 ms |
29636 KB |
Output is correct |
8 |
Correct |
91 ms |
29576 KB |
Output is correct |
9 |
Correct |
86 ms |
29892 KB |
Output is correct |
10 |
Correct |
74 ms |
30212 KB |
Output is correct |