zipdang04

checker

Nov 1st, 2021 (edited)
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.33 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. /*
  4. #include <ext/pb_ds/assoc_container.hpp>
  5. #include <ext/pb_ds/tree_policy.hpp>
  6. using namespace __gnu_pbds;
  7. typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
  8. */
  9.  
  10. typedef long long ll;
  11. typedef long double ld;
  12. typedef vector<int> vi;
  13. typedef vector<ll> vl;
  14. typedef pair<int, int> pii;
  15. typedef pair<ll, ll> pll;
  16. typedef map<int, int> mii;
  17. typedef unordered_map<int, int> umii;
  18. typedef map<ll, ll> mll;
  19. typedef unordered_map<ll, ll> umll;
  20. template <class T1, class T2>
  21. void maximize(T1 &a, T2 b){
  22.     if (b > a) a = b;
  23. }
  24. template <class T1, class T2>
  25. void minimize(T1 &a, T2 b){
  26.     if (b < a) a = b;
  27. }
  28. template <class T>
  29. void read(T &number)
  30. {
  31.     bool negative = false;
  32.     register int c;
  33.     number = 0;
  34.     c = getchar();
  35.     while (c != '-' && !isalnum(c)) c = getchar();
  36.     if (c=='-'){
  37.         negative = true;
  38.         c = getchar();
  39.     }
  40.     for (; (c>47 && c<58); c=getchar())
  41.         number = number *10 + c - 48;
  42.     if (negative)
  43.         number *= -1;
  44. }
  45. template <class T, class ...Ts>
  46. void read(T &a, Ts& ... args){
  47.     read(a);
  48.     read(args...);
  49. }
  50.  
  51. /*
  52. struct Node
  53. {
  54.     int node, len;
  55.     Node() {node = len = 0;}
  56.     Node(int node, int len) {this -> node = node, this -> len = len;}
  57. };
  58. typedef vector<Node> vg;
  59. */
  60.  
  61. #define MAX 1000001
  62. #define MOD 1000000007
  63.  
  64. #define fi first
  65. #define se second
  66. #define pf push_front
  67. #define pb push_back
  68.  
  69. #define FOR(type, i, a, b) for(type i = (a); i <= (b); i++)
  70. #define FORD(type, i, b, a) for(type i = (b); i >= (a); i--)
  71.  
  72. #define testBit(n, bit) ((n >> bit) & 1)
  73. #define flipBit(n, bit) (n ^ (1ll << bit))
  74. #define cntBit(n) __builtin_popcount(n)
  75. #define cntBitll(n) __builtin_popcountll(n)
  76. #define randomize mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
  77.  
  78. void error(string message){
  79.     cout << message;
  80.     exit(1);
  81. }
  82.  
  83. ifstream inp, out, ans;
  84.  
  85. void readInput(){
  86.     //
  87. }
  88.  
  89.  
  90. void readAnswer(){
  91.     //
  92. }
  93.  
  94.  
  95. void readOutput(){
  96.     //
  97. }
  98.  
  99.  
  100. void check(){
  101.     //
  102. }
  103.  
  104. int main(int argc, char** argv)
  105. {
  106.     ios_base::sync_with_stdio(0); cin.tie(0);
  107.     inp = ifstream(argv[1]);
  108.     out = ifstream(argv[2]);
  109.     ans = ifstream(argv[3]);
  110.     readInput();
  111.     readOutput();
  112.     readAnswer();
  113.     check();
  114. }
Add Comment
Please, Sign In to add comment