| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1332814 | Zone_zonee | Baloni (COCI15_baloni) | C++20 | 54 ms | 8720 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int a[N], idx[N];
vector<int> q[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> a[i];
q[a[i]].push_back(i);
}
int ans = 0;
for(int i = 1; i <= n; ++i){
if(idx[a[i]] >= q[a[i]].size() || q[a[i]][idx[a[i]]] != i) continue;
while(idx[a[i]] < q[a[i]].size() && q[a[i]][idx[a[i]]] >= i) idx[a[i]--]++;
ans++;
}
cout << ans << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
