제출 #242904

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
242904	2020-06-29 18:51:50	MatesV13	Svjetlost (COI18_svjetlost)	C++11	40 / 100	3031 ms	6136 KiB

Main

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 <bits/stdc++.h>
using namespace std;
long long n, q, V, x[100005], y[100005], prijasnji[100005];
void update(int vrh){
  int minus=0;
  for (int i=1; i<vrh; i++){
    if (prijasnji[i]) minus++;
  } prijasnji[vrh]++; vrh-=minus;
  for (int i=vrh+1; i<=n; i++){
    x[i-1]=x[i]; y[i-1]=y[i];
  } return;
}
bool ok (int idx1, int idx2){
  idx1 = (idx1+n-1)%n+1; idx2 = (idx2+n-1)%n+1;
  long long dx1 = x[idx1] - x[idx1-1];
  long long dy1 = y[idx1] - y[idx1-1];
  long long dx2 = x[idx2] - x[idx2-1];
  long long dy2 = y[idx2] - y[idx2-1];
//  cout << dx1 << " " << dy1 << "   " << dx2 << " " << dy2 << endl;
//  cout << dx1*dy2 << " " << dx2*dy1 << endl;
  return (dx1*dy2 > dx2*dy1);
}
long double leng(int idx){
  idx = (idx+n-1)%n+1;
  long long dx = x[idx] - x[idx-1];
  long long dy = y[idx] - y[idx-1];
//  cout << "duljina izmedu " << idx << " i " << idx-1 << " iznosi: " << sqrtl(dx*dx + dy*dy) << endl;
  return sqrtl(dx*dx + dy*dy);
}
long double dp[200005];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31