oj.uz

Submission #827137

# Submission time Handle Problem Language Result Execution time Memory
827137 2023-08-16T09:10:31 Z OAleksa Baloni (COCI15_baloni) C++14
0 / 100
 543 ms 45500 KB 
#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);

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];
		int dp[n];
		dp[0] = 1;
		for(int i = 1;i < n;i++) {
			dp[i] = dp[i - 1] + 1;
			for(int j = i - 1;j >= 0;j--) {
				if(a[j] == a[i])
					break;
				if(a[j] == a[i] + 1) {
					dp[i] = min(dp[j], dp[i]);
					break;
				}
			}
		}
		cout << dp[n - 1];
	}
   return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 31572 KB Output isn't correct
2 Incorrect 15 ms 31640 KB Output isn't correct
3 Incorrect 15 ms 31700 KB Output isn't correct
4 Incorrect 18 ms 31652 KB Output isn't correct
5 Incorrect 543 ms 44016 KB Output isn't correct
6 Incorrect 466 ms 45500 KB Output isn't correct
7 Incorrect 306 ms 43072 KB Output isn't correct
8 Incorrect 335 ms 42928 KB Output isn't correct
9 Incorrect 424 ms 43572 KB Output isn't correct
10 Incorrect 393 ms 44040 KB Output isn't correct