Submission #411654

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
411654	2021-05-25T16:49:00 Z	nxteru	Mountains (IOI17_mountains)	C++14	20 / 100	1 ms	332 KB

mountains

#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;

int maximum_deevs(vector<int> y) {
	int n=y.size();
	if(n==1)return 1;
	vector<int>x;
	for(int i=0;i<n;i++){
		if(i==0){
			if(y[i]>=y[i+1])x.push_back(-1);
			else x.push_back(1);
		}else if(i==n-1){
			if(y[i-1]>=y[i])x.push_back(-1);
			else x.push_back(1);
		}else{
			if(y[i+1]-y[i-1]>=2*(y[i]-y[i-1]))x.push_back(-1);
			else x.push_back(1);
		}
	}
	int ans=0,p=0;
	for(int i=0;i<n;i++){
		if(x[i]==1){
			if(p==1)p=0;
			else{
				if(p==-1)p=0;
				else if(i==n-1||x[i+1]!=-1){
					ans++;
					p=1;
				}
			}
		}else{
			if(p!=-1)ans++;
			p=-1;
		}
	}
	return ans;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Incorrect	1 ms	204 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Incorrect	1 ms	204 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	288 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	296 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Incorrect	1 ms	204 KB	Output isn't correct
18	Halted	0 ms	0 KB	-