Submission #791966

#TimeUsernameProblemLanguageResultExecution timeMemory
791966ttamxTriangles (CEOI18_tri)C++14
0 / 100
1 ms344 KiB
#include"trilib.h" #include<bits/stdc++.h> using namespace std; vector<int> lower,upper; deque<int> hull; set<int> ans; bool cmp(int x,int y){ return is_clockwise(1,x,y); } void upd(int x){ while(hull.size()>1&&!is_clockwise(hull.end()[-2],hull.back(),x))hull.pop_back(); hull.emplace_back(x); } int main(){ cin.tie(nullptr)->sync_with_stdio(false); int n; n=get_n(); for(int i=3;i<=n;i++){ if(is_clockwise(1,2,i))upper.emplace_back(i); else lower.emplace_back(i); } sort(lower.begin(),lower.end(),cmp); sort(upper.begin(),upper.end(),cmp); for(int i=0;i<2;i++){ upd(1); for(auto x:lower)upd(x); upd(2); for(auto x:upper)upd(x); } for(auto x:hull)ans.emplace(x); give_answer(ans.size()); }
#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...