# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044659 | Nickpapadak | Game (eJOI20_game) | C++14 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const unsigned int MAXN = 2e+1 + 5;
int grid[MAXN][MAXN];
int N, M;
int cnt;
int main(){
scanf("%d%d", &N, &M);
char ps[M];
scanf("%s", ps);
for(int i = 1; i<=N; ++i){
char s[M];
scanf("%s", s);
for(int j = 1; j <=M;++j)
grid[i][j] = (ps[j-1]-'0') + (s[j-1]-'0');
for(int j = 0; j<M;++j){
ps[j] = s[j];
}
}
for(int i = 1; i<=N; ++i){
char s[M+1];
scanf("%s", s);
for(int j = 1; j<=M; ++j){
grid[i][j] += (s[j] -'0') + (s[j-1] - '0');
if(grid[i][j] == 4) cnt++;
}
}
printf("%d", -1*((N*M) - cnt));
// for(int i = 1; i<=N;++i){
// for(int j = 1; j <=M;++j){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |