oj.uz

Submission #169208

# Submission time Handle Problem Language Result Execution time Memory
169208 2019-12-19T04:41:37 Z Trickster Money (IZhO17_money) C++14
0 / 100
 2 ms 376 KB 
//Suleyman Atayew

#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>

#define N 1000010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define inf 1000000007
#define pii pair <int, int>

using namespace std;

int n;
int v[N];
set <int> S;

int main()
{
	cin >> n;
	
	int ans = 0;
	S.insert(1e9);
	for(int i = 1; i <= n; i++)
		cin >> v[i];
	
	for(int i = 1; i <= n; i++) {
		int h = i+1;
		int y = *S.lower_bound(v[i]);
		
		while(h <= n) {
			int x = *S.lower_bound(v[h]);
			
			if(x != y || v[h] < v[h-1]) break;
			
			h++;
		}
		
		for(int j = i; j < h; j++) S.insert(v[j]);
		
		ans ++;
		i = h-1;
	}
	
	cout << ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 368 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 368 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 368 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 368 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -