oj.uz

Submission #388730

# Submission time Handle Problem Language Result Execution time Memory
388730 2021-04-12T17:33:34 Z Iwanttobreakfree Mountains (IOI17_mountains) C++17
0 / 100
 1 ms 284 KB 
#include "mountains.h"
#include <vector>
using namespace std;
int maximum_deevs(vector<int> y) {
	int n=y.size();
	int cont=0;
	if(n==1||n==2)return 1;
	for(int i=0;i<n;i++){
		if(i==0){
			if(y[i+1]>y[i])cont++;
		}
		else if(i==n-1){
			if(y[i-1]>y[i])cont++;
		}
		else{
			if(y[i-1]>y[i]&&y[i]<y[i+1])cont++;
		}
	}
	if(cont==0)return 1;
	else return cont;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -