oj.uz

Submission #135223

# Submission time Handle Problem Language Result Execution time Memory
135223 2019-07-23T20:40:46 Z FedericoS Money (IZhO17_money) C++14
0 / 100
 2 ms 380 KB 
#include <iostream>
#include <set>
using namespace std;

int N;
int A[1000006];
set<int> S;
int ans;

int main(){
	cin>>N;
	for(int i=0;i<N;i++)
		cin>>A[i];
	S.insert(N+1);

	for(int i=0;i<N-1;i++){
		//cout<<A[i]<<" ";
		if((A[i]>A[i+1]) or (A[i]<A[i+1] and *S.lower_bound(A[i])<A[i+1])){
			ans++;
			//cout<<"| ";
		}
		S.insert(A[i]);
	}
	//cout<<A[N-1]<<endl;

	cout<<ans+1;

}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -