Submission #1173541

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1173541	2025-03-25 11:55:43	sleepntsheep	Triangles (CEOI18_tri)	C++20	20 / 100	0 ms	328 KiB

tri

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
#include <algorithm>
#include "trilib.h"
#include <string.h>
#include <stdlib.h>
#include <deque>
int main() {
  std::deque<int>L,R,ll,rr;
  int n = get_n();
  for(int i=3;i<=n;++i)
    if(is_clockwise(1,2,i))R.push_back(i);
    else L.push_back(i);
  std::sort(R.begin(),R.end(),[](int i,int j){ return is_clockwise(2,i,j); });
  std::sort(L.begin(),L.end(),[](int i,int j){ return is_clockwise(1,i,j); });
  rr={2};
  ll={1};
  for(auto i:R){
    while(rr.size()>1&&!is_clockwise(rr[rr.size()-2],rr.back(),i))rr.pop_back();
    rr.push_back(i);
  }
  for(auto i:L){
    while(ll.size()>1&&!is_clockwise(ll[ll.size()-2],ll.back(),i))ll.pop_back();
    ll.push_back(i);
  }
  while(1){
    while(rr.size()>=2&&ll.size()>=1&&!is_clockwise(ll.back(),rr[0],rr[1])){rr.pop_front();continue;}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 20 / 20
• Subtask 5: 0 / 25