Submission #1173371

---

Source Code Expand

#include <algorithm>
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>


#define INF 1000000002486618624LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)


#define X(x) ((x) % W2)
#define Y(x) ((x) / W2)
#define XY(x, y) ((y) * W2 + (x))


int H, W, K, T, W2;

std::array<int, 450> P, Q;


int main(int argc, char** argv)
{
  std::cin.tie(0);
  std::ios_base::sync_with_stdio(0);

  std::cin >> H >> W >> K >> T;

  W2 = W + 2;

  int a, b, c, d;

  for (int i = 0; i < K; i ++) {
    std::cin >> a >> b >> c >> d;

    P[i] = XY(b + 1, a + 1);
    Q[i] = XY(d + 1, c + 1);
  }

  std::cout << "1" << std::endl;

  std::cout << std::string(K, '-') << std::endl;

  return 0;
}

Submission Info

Judge Result