Submission #334844

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)

int main() {
  int h, w, m, n;
  cin >> h >> w >> m >> n;

  vector<vector<int> > grid(h, vector<int>(w));
  vector<int> xs1(n), xs2(n), ys1(n), ys2(n);
  rep(k, n) cin >> ys1[k] >> ys2[k] >> xs1[k] >> xs2[k];
  rep(k, n) { xs1[k]--; ys1[k]--; }

  rep(k, n) {
    int x1 = xs1[k], x2 = xs2[k], y1 = ys1[k], y2 = ys2[k];
    rep(i, h) rep(j, w) if (x1 <= j && j < x2 and y1 <= i && i < y2) grid[i][j] += 1;
    rep(i, h) rep(j, w) grid[i][j] %= 4;
  }

  rep(k, n) {
    int x1 = xs1[k], x2 = xs2[k], y1 = ys1[k], y2 = ys2[k];
    rep(i, h) rep(j, w) if (x1 <= j && j < x2 and y1 <= i && i < y2) grid[i][j] += 3;
    rep(i, h) rep(j, w) grid[i][j] %= 4;

    int cnt = 0;
    rep(i, h) rep(j, w) if (grid[i][j] == 0) cnt++;
    if (cnt == m) cout << (k+1) << endl;

    rep(i, h) rep(j, w) if (x1 <= j && j < x2 and y1 <= i && i < y2) grid[i][j] += 1;
    rep(i, h) rep(j, w) grid[i][j] %= 4;
  }

  return 0;
}

Submission Info

Submission Time
Task E - 儀式
User suminos
Language C++ (G++ 4.6.4)
Score 100
Code Size 1070 Byte
Status AC
Exec Time 274 ms
Memory 1132 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 32
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
All subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask1-27.txt, subtask1-28.txt, subtask1-29.txt, subtask1-30.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 27 ms 924 KiB
subtask0-sample-02.txt AC 25 ms 1040 KiB
subtask1-01.txt AC 25 ms 944 KiB
subtask1-02.txt AC 27 ms 1044 KiB
subtask1-03.txt AC 25 ms 1040 KiB
subtask1-04.txt AC 27 ms 1052 KiB
subtask1-05.txt AC 30 ms 1044 KiB
subtask1-06.txt AC 48 ms 1048 KiB
subtask1-07.txt AC 37 ms 1048 KiB
subtask1-08.txt AC 114 ms 1044 KiB
subtask1-09.txt AC 186 ms 1044 KiB
subtask1-10.txt AC 215 ms 1036 KiB
subtask1-11.txt AC 219 ms 1060 KiB
subtask1-12.txt AC 76 ms 944 KiB
subtask1-13.txt AC 121 ms 1044 KiB
subtask1-14.txt AC 164 ms 944 KiB
subtask1-15.txt AC 214 ms 1132 KiB
subtask1-16.txt AC 263 ms 940 KiB
subtask1-17.txt AC 255 ms 944 KiB
subtask1-18.txt AC 256 ms 996 KiB
subtask1-19.txt AC 262 ms 1044 KiB
subtask1-20.txt AC 262 ms 1044 KiB
subtask1-21.txt AC 261 ms 1048 KiB
subtask1-22.txt AC 261 ms 1052 KiB
subtask1-23.txt AC 261 ms 1044 KiB
subtask1-24.txt AC 262 ms 1052 KiB
subtask1-25.txt AC 274 ms 1044 KiB
subtask1-26.txt AC 268 ms 1048 KiB
subtask1-27.txt AC 264 ms 944 KiB
subtask1-28.txt AC 255 ms 1044 KiB
subtask1-29.txt AC 263 ms 1052 KiB
subtask1-30.txt AC 263 ms 1084 KiB