Submission #653849

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
653849	2022-10-28 13:42:25	haojiandan	Fences (JOI18_fences)	C++14	100 / 100	13 ms	684 KiB

fences

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
// wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
  t=0; char ch=getchar(); int f=1;
  while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
  do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
  if (t<0) { putchar('-'); write(-t); return; }
  if (t>9) write(t/10);
  putchar('0'+t%10);
}
template <typename T> void writeln(T t) { write(t); puts(""); }
#define MP make_pair
const double PIE=acos(-1.0);
const int maxn=220;
const double eps=1e-5;
int n; double S;
struct node {
  double x,y;
  void get() { read(x),read(y); }
  friend node operator + (node A,node B) { return (node){A.x+B.x,A.y+B.y}; }
  friend node operator - (node A,node B) { return (node){A.x-B.x,A.y-B.y}; }
  friend double operator * (node A,node B) { return A.x*B.x+A.y*B.y; }
  friend double operator ^ (node A,node B) { return A.x*B.y-A.y*B.x; }
  friend node operator * (double a,node b) { return (node){b.x*a,b.y*a}; }
  friend node operator * (node b,double a) { return (node){b.x*a,b.y*a}; }
};
struct seg {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 33 / 33
• Subtask 3: 49 / 49