oj.uz

Submission #37448

# Submission time Handle Problem Language Result Execution time Memory
37448 2017-12-25T14:09:11 Z Kerim Money (IZhO17_money) C++14
45 / 100
 1500 ms 92208 KB 
#include "bits/stdc++.h"
#define MAXN 1090009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
multiset<int>s;
int arr[MAXN];
int main(){
    //~ freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
		scanf("%d",arr+i);
	int pos=-1;	
	for(int i=1;i<n;i++){
		s.insert(arr[i]);
		if(arr[i]>arr[i+1]){
			pos=i+1;
			break;
		}
	}
	if(pos==-1){
		puts("1");
		return 0;
	}
	int ans=1;
	while(1){
		__typeof((s).begin())it=s.upper_bound(arr[pos]);
		int right=INF;
		if(it!=s.end())
			right=*it;
		int now=arr[pos],tmp=pos;
		ans++;
		for(int i=pos;i<=n;i++){
			s.insert(arr[i]);
			if(now<=arr[i] and arr[i]<=right)
				now=arr[i];
			else{
				pos=i;
				break;
			}
		}
		if(tmp==pos)
			break;
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:25:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
money.cpp:27:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",arr+i);
                    ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6276 KB Output is correct
2 Correct 0 ms 6276 KB Output is correct
3 Correct 0 ms 6276 KB Output is correct
4 Correct 0 ms 6276 KB Output is correct
5 Correct 0 ms 6276 KB Output is correct
6 Correct 0 ms 6276 KB Output is correct
7 Correct 0 ms 6276 KB Output is correct
8 Correct 0 ms 6276 KB Output is correct
9 Correct 0 ms 6276 KB Output is correct
10 Correct 0 ms 6276 KB Output is correct
11 Correct 0 ms 6276 KB Output is correct
12 Correct 0 ms 6276 KB Output is correct
13 Correct 0 ms 6276 KB Output is correct
14 Correct 0 ms 6276 KB Output is correct
15 Correct 0 ms 6276 KB Output is correct
16 Correct 0 ms 6276 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6276 KB Output is correct
2 Correct 0 ms 6276 KB Output is correct
3 Correct 0 ms 6276 KB Output is correct
4 Correct 0 ms 6276 KB Output is correct
5 Correct 0 ms 6276 KB Output is correct
6 Correct 0 ms 6276 KB Output is correct
7 Correct 0 ms 6276 KB Output is correct
8 Correct 0 ms 6276 KB Output is correct
9 Correct 0 ms 6276 KB Output is correct
10 Correct 0 ms 6276 KB Output is correct
11 Correct 0 ms 6276 KB Output is correct
12 Correct 0 ms 6276 KB Output is correct
13 Correct 0 ms 6276 KB Output is correct
14 Correct 0 ms 6276 KB Output is correct
15 Correct 0 ms 6276 KB Output is correct
16 Correct 0 ms 6276 KB Output is correct
17 Correct 0 ms 6276 KB Output is correct
18 Correct 0 ms 6276 KB Output is correct
19 Correct 0 ms 6276 KB Output is correct
20 Correct 0 ms 6276 KB Output is correct
21 Correct 0 ms 6276 KB Output is correct
22 Correct 0 ms 6276 KB Output is correct
23 Correct 0 ms 6276 KB Output is correct
24 Correct 0 ms 6276 KB Output is correct
25 Correct 0 ms 6276 KB Output is correct
26 Correct 0 ms 6276 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6276 KB Output is correct
2 Correct 0 ms 6276 KB Output is correct
3 Correct 0 ms 6276 KB Output is correct
4 Correct 0 ms 6276 KB Output is correct
5 Correct 0 ms 6276 KB Output is correct
6 Correct 0 ms 6276 KB Output is correct
7 Correct 0 ms 6276 KB Output is correct
8 Correct 0 ms 6276 KB Output is correct
9 Correct 0 ms 6276 KB Output is correct
10 Correct 0 ms 6276 KB Output is correct
11 Correct 0 ms 6276 KB Output is correct
12 Correct 0 ms 6276 KB Output is correct
13 Correct 0 ms 6276 KB Output is correct
14 Correct 0 ms 6276 KB Output is correct
15 Correct 0 ms 6276 KB Output is correct
16 Correct 0 ms 6276 KB Output is correct
17 Correct 0 ms 6276 KB Output is correct
18 Correct 0 ms 6276 KB Output is correct
19 Correct 0 ms 6276 KB Output is correct
20 Correct 0 ms 6276 KB Output is correct
21 Correct 0 ms 6276 KB Output is correct
22 Correct 0 ms 6276 KB Output is correct
23 Correct 0 ms 6276 KB Output is correct
24 Correct 0 ms 6276 KB Output is correct
25 Correct 0 ms 6276 KB Output is correct
26 Correct 0 ms 6276 KB Output is correct
27 Correct 0 ms 6276 KB Output is correct
28 Correct 0 ms 6276 KB Output is correct
29 Correct 0 ms 6276 KB Output is correct
30 Correct 0 ms 6276 KB Output is correct
31 Correct 0 ms 6276 KB Output is correct
32 Correct 0 ms 6276 KB Output is correct
33 Correct 0 ms 6276 KB Output is correct
34 Correct 0 ms 6276 KB Output is correct
35 Correct 0 ms 6276 KB Output is correct
36 Correct 0 ms 6276 KB Output is correct
37 Correct 0 ms 6276 KB Output is correct
38 Correct 0 ms 6276 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6276 KB Output is correct
2 Correct 0 ms 6276 KB Output is correct
3 Correct 0 ms 6276 KB Output is correct
4 Correct 0 ms 6276 KB Output is correct
5 Correct 0 ms 6276 KB Output is correct
6 Correct 0 ms 6276 KB Output is correct
7 Correct 0 ms 6276 KB Output is correct
8 Correct 0 ms 6276 KB Output is correct
9 Correct 0 ms 6276 KB Output is correct
10 Correct 0 ms 6276 KB Output is correct
11 Correct 0 ms 6276 KB Output is correct
12 Correct 0 ms 6276 KB Output is correct
13 Correct 0 ms 6276 KB Output is correct
14 Correct 0 ms 6276 KB Output is correct
15 Correct 0 ms 6276 KB Output is correct
16 Correct 0 ms 6276 KB Output is correct
17 Correct 0 ms 6276 KB Output is correct
18 Correct 0 ms 6276 KB Output is correct
19 Correct 0 ms 6276 KB Output is correct
20 Correct 0 ms 6276 KB Output is correct
21 Correct 0 ms 6276 KB Output is correct
22 Correct 0 ms 6276 KB Output is correct
23 Correct 0 ms 6276 KB Output is correct
24 Correct 0 ms 6276 KB Output is correct
25 Correct 0 ms 6276 KB Output is correct
26 Correct 0 ms 6276 KB Output is correct
27 Correct 0 ms 6276 KB Output is correct
28 Correct 0 ms 6276 KB Output is correct
29 Correct 0 ms 6276 KB Output is correct
30 Correct 0 ms 6276 KB Output is correct
31 Correct 0 ms 6276 KB Output is correct
32 Correct 0 ms 6276 KB Output is correct
33 Correct 0 ms 6276 KB Output is correct
34 Correct 0 ms 6276 KB Output is correct
35 Correct 0 ms 6276 KB Output is correct
36 Correct 0 ms 6276 KB Output is correct
37 Correct 0 ms 6276 KB Output is correct
38 Correct 0 ms 6276 KB Output is correct
39 Correct 323 ms 43764 KB Output is correct
40 Correct 799 ms 74124 KB Output is correct
41 Correct 236 ms 35448 KB Output is correct
42 Correct 306 ms 36372 KB Output is correct
43 Correct 196 ms 27528 KB Output is correct
44 Correct 899 ms 89568 KB Output is correct
45 Correct 786 ms 86664 KB Output is correct
46 Correct 886 ms 89568 KB Output is correct
47 Correct 509 ms 64884 KB Output is correct
48 Correct 646 ms 76632 KB Output is correct
49 Execution timed out 1500 ms 92208 KB Execution timed out
50 Halted 0 ms 0 KB -