Submission #128445

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
128445	2019-07-10 23:15:08	TadijaSebez	Triangles (CEOI18_tri)	C++11	100 / 100	31 ms	1908 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 "trilib.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
bool comp(int i, int j){ return is_clockwise(1,i,j);}
int main()
{
  int n=get_n();
  vector<int> v[2]={{2},{2}},u[2];
  for(int i=3;i<=n;i++) v[is_clockwise(1,2,i)].pb(i);
  for(int t=0;t<2;t++)
  {
    sort(v[t].begin(),v[t].end(),[](int i, int j){ return is_clockwise(1,i,j);});
    for(int i:v[t])
    {
      while(u[t].size()>1 && !is_clockwise(u[t][u[t].size()-2],u[t].back(),i)) u[t].pop_back();
      u[t].pb(i);
    }
    if(t) reverse(u[t].begin(),u[t].end());
    u[t].insert(u[t].begin(),1);
  }
  if(min(u[0].size(),u[1].size())==2)
  {
    give_answer(max(u[0].size(),u[1].size()));
    return 0;
  }
  for(int t=0;t<2;t++)
  {
    u[0].pop_back();
    while(1)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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