oj.uz

Submission #92682

# Submission time Handle Problem Language Result Execution time Memory
92682 2019-01-04T10:09:39 Z GioChkhaidze Money (IZhO17_money) C++14
0 / 100
 3 ms 380 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
int n,a[1000006],fix[1000006],Ans;

pair < int , int > p [1000006]; 

set < int > st; 

void go(int x,int idx)
{
	int ko=0,ID=0;
	Ans++;
	
	fix[idx]=1;
	
	for (int i=idx+1; i<=n; i++)
	{
		if (fix[i] || a[i]<x) break;
		
		if (st.upper_bound(x)==st.end() || a[i]<=*st.upper_bound(x))
		{
			fix[i]=1;
			ID=i;
			x=a[i];
		}
			else break;
	}
	
	for (int i=idx; i<=ID; i++)
		st.insert(a[i]);
}

main ()
{
	ios::sync_with_stdio(false);
	
	cin>>n;
	
	for (int i=1; i<=n; i++)
	{
		cin>>a[i];
		p[i].F=a[i];
		p[i].S=i;
	}
	
	sort(p+1,p+n+1);
		
	for (int i=1; i<=n; i++)
	{
		if (!fix[p[i].S]) go(p[i].F,p[i].S);
		/*
		for (int j=1; j<=n; j++)
			cout<<fix[j]<<" ";
		cout<<endl;*/
	}
		
	cout<<Ans<<endl;
}
/*

10
1 4 6 2 3 7 10 8 9 5
| 1 4 6 | 2 3 | 7 10 | 8 9 | 5 |

6
3 6 4 5 1 2

5 
1 3 5 2 4

8
1 3 2 4 5 8 7 6

5
2 3 5 3 5

4
2 2 2 2

*/

Compilation message

money.cpp: In function 'void go(int, int)':
money.cpp:13:6: warning: unused variable 'ko' [-Wunused-variable]
  int ko=0,ID=0;
      ^~
money.cpp: At global scope:
money.cpp:35:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main ()
       ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -