Submission #950037

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
950037	2024-03-20 03:51:22	crimson231	Printed Circuit Board (CEOI12_circuit)	C++17	100 / 100	31 ms	2908 KiB

circuit

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
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <cassert>
typedef long long ll;
const ll INF = 1e17;
const int LEN = 2e5 + 1;
int N;
bool V[LEN];
struct Pos {
  int x, y, i;
  Pos(int X = 0, int Y = 0, int I = 0) : x(X), y(Y), i(I) {}
  ll operator * (const Pos& p) const { return { (ll)x * p.x + (ll)y * p.y }; }
  ll operator / (const Pos& p) const { return { (ll)x * p.y - (ll)y * p.x }; }
  Pos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }
  Pos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }
  ll Euc() const { return (ll)x * x + (ll)y * y; }
  friend std::istream& operator >> (std::istream& is, Pos& p) {
    is >> p.x >> p.y;
    return is;
  }
  friend std::ostream& operator << (std::ostream& os, const Pos& p) {
    os << p.x << " " << p.y;
    return os;
  }
}; const Pos O = { 0, 0 };
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100