Competitive-Programming/template.cpp at main · linhhuynhcoding/Competitive-Programming · GitHub

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
// Author: Linh
// Problem:
// Tags:
#include "cassert" // for is_sorted(all(a))
#include <bits/stdc++.h>

#pragma GCC target("popcnt")

using namespace std;

// TEMPLATE
template <typename T>
istream &operator>>(std::istream &is, vector<T> &a)
{
  for (auto &i : a)
    is >> i;
  return is;
}
template <typename T>
ostream &operator<<(std::ostream &os, const vector<T> a)
{
  if (a.size() == 0)
  {
    os << "[null]\n";
    return os;
  }
  os << "[";
  for (auto i : a)
    os
        << i << " ";
  os << "]";
  os << "\n";
  return os;
}
template <typename T>
ostream &operator<<(std::ostream &os, const deque<T> a)
{
  if (a.size() == 0)
  {
    os << "[null]\n";
    return os;
  }
  os << "[";
  for (auto i : a)
    os
        << i << " ";
  os << "]";
  os << "\n";
  return os;
}
// TEMPLATE
#define pii pair<int, int>
#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) size(a)
#define so(a) sizeof(a)
#define vi vector<int>
#define invi(a)    \
  for (int &i : a) \
    cin >> i;
#define outvi(a)                  \
  for (int i = 0; i < sz(a); i++) \
    cout << a[i] << " \n"[i == sz(a) - 1];

const int inf = 1e18 + 9;

void solve()
{
  int n, q;
  cin >> n >> q;
}

signed main()
{
  clock_t start = clock();
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  int T = 1;
  // cin >> T;
  while (T--)
  {
    solve();
  }
  clock_t end = clock();
  cerr << "\nTime = " << (double)(end - start) / (double)CLOCKS_PER_SEC << "\n";
}