Submission #827152

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
827152	2023-08-16T09:19:40 Z	OAleksa	Baloni (COCI15_baloni)	C++14	0 / 100	266 ms	79120 KB

baloni

#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[x] = -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;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	18 ms	39508 KB	Output isn't correct
2	Incorrect	21 ms	39424 KB	Output isn't correct
3	Incorrect	17 ms	39508 KB	Output isn't correct
4	Incorrect	18 ms	39664 KB	Output isn't correct
5	Incorrect	266 ms	73448 KB	Output isn't correct
6	Incorrect	257 ms	79120 KB	Output isn't correct
7	Incorrect	225 ms	72196 KB	Output isn't correct
8	Incorrect	216 ms	71864 KB	Output isn't correct
9	Incorrect	244 ms	73284 KB	Output isn't correct
10	Incorrect	232 ms	74940 KB	Output isn't correct