# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231212 | 2020-05-13T04:38:21 Z | mohamedsobhi777 | Mountains (IOI17_mountains) | C++14 | 5 ms | 256 KB |
/* 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
3 | Incorrect | 4 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
3 | Incorrect | 4 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
3 | Incorrect | 4 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
3 | Incorrect | 4 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |