Boilerplate for program solving

main.cpp

#include <bits/stdc++.h>

#define ffor(i, x) for (int (i)=0;(i)<(x);(i)++)
#define fffor(i, x) for (int (i)=1;(i)<=(x);(i)++)
#define I(x) int (x); cin >> (x)
#define P(x) cout << (x) << '\n'
#define ll long long
#define ii pair<int, int>

#define fforR(x, i) for (int (i) = (x) - 1 ; (i) >= 0 ; --(i))
#define ffforR(x, i) for (int (i) = (x) ; (i) > 0 ; --(i))
//priority_queue<ii > pq; // default order: 'less' (biggest first)

using namespace std;

int dx[] = {1, 0, -1, 0}; // 동 남 서 북
int dy[] = {0, 1, 0, -1};
int INF = 1e9 + 7;

bool cmp(ii a, ii b) {
    if (a.second != b.second) {
        return a.second < b.second;
    }
    return a.first < b.first;
}
//priority_queue<ii, vector<ii >, cmp> pq;

// 파도가 🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊 철썩 철썩


int main() {
    // 파도가 🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊 철썩철썩 @formatter:off
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    // freopen("result.txt", "w", stdout);
#endif // 파도가 🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊 철썩철썩 @formatter:on

    

}

main.py

# -*- coding: utf-8 -*-
from collections import deque
import operator as op
from itertools import combinations
from functools import cmp_to_key, reduce
import bisect
import random
from queue import PriorityQueue as PQ
import sys
sys.setrecursionlimit(10000)


def readN(T=int):
    return map(T, sys.stdin.readline().split())


def read(T=int):
    return T(sys.stdin.readline().strip())


# 🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊🌊 파도가 철썩 철썩