Submission #585052

#TimeUsernameProblemLanguageResultExecution timeMemory
585052JomnoiTriangles (CEOI18_tri)C++17
0 / 100
1 ms304 KiB
#include <bits/stdc++.h>
#include "trilib.h"
using namespace std;

int main() {
    int N = get_n();

    vector <int> cand, hull;
    hull.push_back(1);
    for(int i = 2; i <= N; i++) {
        cand.push_back(i);
    }

    sort(cand.begin(), cand.end(), [&](const int &a, const int &b) {
        return is_clockwise(1, a, b) == false;
    });

    for(auto p : cand) {
        while(hull.size() >= 2 and is_clockwise(hull[hull.size() - 2], hull.back(), p) == true) {
            hull.pop_back();
        }
        hull.push_back(p);
    }
    give_answer(hull.size());
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...