# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231212 | mohamedsobhi777 | Mountains (IOI17_mountains) | C++14 | 5 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
Pure bruteforce
*/
#include "mountains.h"
#include <bits/stdc++.h>
using namespace std ;
int maximum_deevs(std::vector<int> y) {
int ret = 0 ;
int n = y.size() ;
for(int i = 1 ; i < (1<<n) ; i++){
vector<pair<int , int> > prs ;
for(int j = 0 ;j < n ;j++){
if(i &(1<<j)){
prs.push_back({j , y[j]}) ;
}
}
if(prs.size() < ret) continue ;
bool okk = 1 ;
for(int j = 0 ; j < prs.size() ; j++){
for(int k = j +1 ; k < prs.size() ; k++){
bool ok = 0 ;
for(int l = prs[j].first +1 ; l < prs[k].first ; l++){
int dot = (y[l] - prs[j].second ) * (prs[k].first - l ) - (l - prs[j].first ) * (prs[k].second - y[l]) ;
if(dot < 0) ok = 1;
}
if(!ok){
okk = 0 ;
j = prs.size() ;
break ;
}
}
}
if(okk){
ret = max(ret , (int) prs.size()) ;
}
}
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |