Submission #2630368

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

int sim(int N, int M) {
    vvi a(N, vi(M, 0));
    rep(r,N) rep(c,M) {
        for (int j=-1; j<=1; ++j) {
            for (int i=-1; i<=1; ++i) {
                int y = r+j, x = c+i;
                if (IN(y,0,N-1) && IN(x,0,M-1)) {
                    ++a[y][x];
                }
            }
        }
    }
    int cnt = 0;
    rep(r,N) {
        rep(c,M) {
            // printf("%d", a[r][c]);
            if (a[r][c] % 2) ++cnt;
        }
        // printf("\n");
    }
    return cnt;
}

int main() {
    // for (int n=1; n<=10; ++n) {
    //     for (int m=1; m<=10; ++m) {
    //         printf("N=%d M=%d : %d\n", n, m, sim(n, m));;
    //     }
    // }
    int N, M; cin >> N >> M;
    cout << ((ll)abs(N-2) * abs(M-2)) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Flip,Flip, and Flip......
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1867 Byte
Status
Exec Time 9 ms
Memory 764 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 9 ms 764 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 1 ms 256 KB
07.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB