제출 #465189

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
465189	2021-08-15 10:22:07	kilikuma	Game (eJOI20_game)	C++14	20 / 100	1 ms	292 KiB

game

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
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>>grille((n + 1), vector<int>(m)), grille3((n), vector<int>(m+1));
  string a;
  for (int i = 0; i <= n; i++) {
    cin >> a;
    for (int j = 0; j < m; j++) {
      if (a[j] == '1')
        grille[i][j] = 1;
      else
        grille[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> a;
    for (int j = 0; j <= m; j++) {
      if (a[j] == '1')
        grille3[i][j] = 1;
      else
        grille3[i][j] = 0;
    }
  }
  vector<pair<pii, pii>>grille1(n*m);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      grille1[i * m + j].first.first = grille3[i][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20