Submission #736800


Source Code Expand

#include <algorithm>
#include <array>
#include <complex>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

inline bool valid(const int x, const int r) { return 0 <= x && x < r; }

void initIOStream() {
  ios::sync_with_stdio(false); // stdinなどと同期しない
  cin.tie(0); // cinの前にflushしない
  cout.setf(ios::fixed);
  cout.precision(10); // 四捨五入して指定桁数表示
}

int main() {
  initIOStream();

  int N;
  bool S[200][200];
  cin >> N;
  for(int i = 0; i < N; ++i) {
    for(int j = 0; j < N; ++j) {
      char c;
      cin >> c;
      S[i][j] = (c == '1');
    }
  }

  bool h[200];
  memset(h, 0, sizeof(h));
  for(int j = 0; j < N; ++j){
    for(int i = 0; i < N; ++i){
      h[i] ^= S[i][j];
    }
  }
  bool v[200];
  memset(v, 0, sizeof(v));
  for(int i = 0; i < N; ++i){
    for(int j = 0; j < N; ++j){
      v[j] ^= S[i][j];
    }
  }
  int cnt_h = 0, cnt_v = 0;
  for(int i = 0; i < N; ++i){
    if(h[i]) ++cnt_h;
    if(v[i]) ++cnt_v;
  }
  //cout << "cnt_h = " << cnt_h << ", cnt_v = " << cnt_v << endl;
  cout << ((cnt_h % 2) & (cnt_v % 2) ? "Odd" : "Even") << endl;
}

Submission Info

Submission Time
Task C - 鯛焼き
User lawel3110
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1543 Byte
Status WA
Exec Time 5 ms
Memory 256 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 26
WA × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt
Case Name Status Exec Time Memory
01.txt AC 4 ms 256 KiB
02.txt WA 4 ms 256 KiB
03.txt WA 4 ms 256 KiB
04.txt AC 4 ms 256 KiB
05.txt AC 4 ms 256 KiB
06.txt WA 4 ms 256 KiB
07.txt WA 4 ms 256 KiB
08.txt AC 4 ms 256 KiB
09.txt AC 4 ms 256 KiB
10.txt WA 4 ms 256 KiB
11.txt WA 4 ms 256 KiB
12.txt AC 4 ms 256 KiB
13.txt AC 4 ms 256 KiB
14.txt WA 4 ms 256 KiB
15.txt WA 4 ms 256 KiB
16.txt AC 4 ms 256 KiB
17.txt WA 4 ms 256 KiB
18.txt WA 4 ms 256 KiB
19.txt AC 4 ms 256 KiB
20.txt WA 4 ms 256 KiB
21.txt WA 5 ms 256 KiB
22.txt WA 5 ms 256 KiB
23.txt WA 5 ms 256 KiB
24.txt AC 5 ms 256 KiB
25.txt AC 5 ms 256 KiB
26.txt AC 5 ms 256 KiB
27.txt WA 5 ms 256 KiB
28.txt AC 5 ms 256 KiB
29.txt AC 5 ms 256 KiB
30.txt AC 5 ms 256 KiB
31.txt WA 5 ms 256 KiB
32.txt WA 5 ms 256 KiB
33.txt AC 5 ms 256 KiB
34.txt WA 5 ms 256 KiB
35.txt WA 5 ms 256 KiB
36.txt AC 5 ms 256 KiB
37.txt AC 5 ms 256 KiB
38.txt AC 5 ms 256 KiB
39.txt WA 5 ms 256 KiB
40.txt WA 5 ms 256 KiB
41.txt WA 5 ms 256 KiB
42.txt WA 5 ms 256 KiB
43.txt AC 5 ms 256 KiB
44.txt WA 5 ms 256 KiB
45.txt WA 5 ms 256 KiB
46.txt AC 5 ms 256 KiB
47.txt AC 4 ms 256 KiB
48.txt AC 4 ms 256 KiB
49.txt WA 4 ms 256 KiB
50.txt AC 4 ms 256 KiB
51.txt AC 4 ms 256 KiB
52.txt AC 4 ms 256 KiB
53.txt WA 4 ms 256 KiB
54.txt WA 4 ms 256 KiB
sample_01.txt AC 4 ms 256 KiB
sample_02.txt AC 4 ms 256 KiB
sample_03.txt AC 4 ms 256 KiB
sample_04.txt AC 4 ms 256 KiB