# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827159 | OAleksa | Baloni (COCI15_baloni) | C++14 | 171 ms | 69912 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>
#define f first
#define s second
using namespace std;
#define int long long
const int maxn = 1e6 + 69;
vector<int> g[maxn], vis(maxn), cnt(maxn, -1);
void dfs(int v) {
vis[v] = 1;
for(auto u : g[v]) {
if(!vis[u])
dfs(u);
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++)
cin >> a[i];
for(int i = 0;i < n;i++) {
int x = cnt[a[i] + 1];
if(x != -1) {
g[i].push_back(x);
g[x].push_back(i);
cnt[a[i] + 1] = -1;
}
cnt[a[i]] = i;
}
int ans = 0;
for(int i = 0;i < n;i++) {
if(!vis[i]) {
++ans;
dfs(i);
}
}
cout << ans;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |