# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
512334 |
2022-01-16T09:38:50 Z |
Kaguya |
Po (COCI21_po) |
C++17 |
|
1000 ms |
16256 KB |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#pragma GCC optimize("-Ofast")
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto& t : a)
cin >> t;
int ans = 0;
vector<bool> vis(n, false);
set<int> se;
for (int i = 0; i < n; i++)
se.insert(a[i]);
map<int, vector<int>> pos;
for (int i = 0; i < n; i++)
pos[a[i]].push_back(i);
if (se.find(0) == se.end()) {
ans += 1;
se.erase(se.begin());
}
for (int i = 0; i < n; i++)
if (a[i] == 0)
vis[i] = true;
if (se.find(0) != se.end())
se.erase(0);
while (!se.empty()) {
int x = *(se.begin());
se.erase(se.begin());
for (auto t : pos[x]) {
if (vis[t])
continue;
vis[t] = true;
int i = t;
ans += 1;
while (i < n && a[i] >= x) {
if (a[i] == x)
vis[i] = true;
i++;
}
if (a[i] == x)
vis[i] = true;
}
}
cout << ans << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
7 ms |
784 KB |
Output is correct |
5 |
Correct |
15 ms |
1100 KB |
Output is correct |
6 |
Execution timed out |
1078 ms |
8480 KB |
Time limit exceeded |
7 |
Correct |
59 ms |
16256 KB |
Output is correct |