kokoa shinkeonkim

## todo.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                shinkeonkim
                / todo.md
            
            
              Last active
              January 14, 2023 09:36
            
              
                TODO
              
          
    Segment Tree Beats


https://codeforces.com/blog/entry/57319


## gist:3781fbeb03812a79e86c2782d0a174cf
출처: NGD

0. 직선의 표현과 선분 교차
1. 컨벡스 헐
2. 로테이팅 캘리퍼스
3. 스위핑 (+ 샤모스 호이)
4. 볼록다각형 내 점 판별(logN)
5. 볼록다각형에 접선 긋기(logN)
6. HPI(NlogN)
7. 보로노이 & 델로네 삼각분할

## kokoa's Army Stats
🎉 전역을 축하합니다!
🗓 입대일: 2022-11-28
🗓 전역일: 2024-05-26
🚩 100% : ████████████████████████████████████████

## vector2.cpp
#include <bits/stdc++.h>

using namespace std;

const double PI = 2.0 * acos(0.0);
const double EPSILON = 1e-9;
const double INF = 1e200;

struct Vector2 {
  double x;

## convex_hull.cpp
#include <bits/stdc++.h>

#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()

using namespace std;

## rotating_calipers.cpp
#include <bits/stdc++.h>

#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()

using namespace std;

## linked_list.py
class Node:
  def __init__(self, value, next=None):
    self.value = value
    self.next = next


class LinkedList:
  def __init__(self):
    self.head = None
    self.count = 0

## kokoa's GitHub Stats
⭐    Total Stars:                               46
➕    Total Commits:                          6,981
🔀    Total PRs:                                884
🚩    Total Issues:                             537
📦    Contributed to:                             4

## cpp.json
{
    "ps-start": {
        "prefix": "ps",
        "body": [
            "#include <bits/stdc++.h>",
            "",
            "#define for1(s,n) for(int i = s; i < n; i++)",
            "#define for1j(s,n) for(int j = s; j < n; j++)",
            "#define foreach(k) for(auto i : k)",
            "#define foreachj(k) for(auto j : k)",

## 11438-HLD.cpp
#include <bits/stdc++.h>

#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()

#define MX_EDGE_CNT 110000
	출처: NGD

	0. 직선의 표현과 선분 교차
	1. 컨벡스 헐
	2. 로테이팅 캘리퍼스
	3. 스위핑 (+ 샤모스 호이)
	4. 볼록다각형 내 점 판별(logN)
	5. 볼록다각형에 접선 긋기(logN)
	6. HPI(NlogN)
	7. 보로노이 & 델로네 삼각분할
	🎉 전역을 축하합니다!
	🗓 입대일: 2022-11-28
	🗓 전역일: 2024-05-26
	🚩 100% : ████████████████████████████████████████
	#include <bits/stdc++.h>

	using namespace std;

	const double PI = 2.0 * acos(0.0);
	const double EPSILON = 1e-9;
	const double INF = 1e200;

	struct Vector2 {
	double x;
	#include <bits/stdc++.h>

	#define for1(s,n) for(int i = s; i < n; i++)
	#define for1j(s,n) for(int j = s; j < n; j++)
	#define foreach(k) for(auto i : k)
	#define foreachj(k) for(auto j : k)
	#define pb(a) push_back(a)
	#define sz(a) a.size()

	using namespace std;
	class Node:
	def __init__(self, value, next=None):
	self.value = value
	self.next = next


	class LinkedList:
	def __init__(self):
	self.head = None
	self.count = 0
	⭐ Total Stars: 46
	➕ Total Commits: 6,981
	🔀 Total PRs: 884
	🚩 Total Issues: 537
	📦 Contributed to: 4
	{
	"ps-start": {
	"prefix": "ps",
	"body": [
	"#include <bits/stdc++.h>",
	"",
	"#define for1(s,n) for(int i = s; i < n; i++)",
	"#define for1j(s,n) for(int j = s; j < n; j++)",
	"#define foreach(k) for(auto i : k)",
	"#define foreachj(k) for(auto j : k)",