Submission #2660620

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))


bool solve(int H, int W, vector<string>& a){
    int te = (H-1) + (W-1);
    vector<int> pat(te, 1);
    rep(i, H-1) pat[i] = 0;
    char board[8][8];
    do{
        mset(board, '.');
        int x=0,y=0;
        board[y][x] = '#';
        rep(i,te){
            if (pat[i] == 1) ++x;
            else ++y;
            board[y][x] = '#';
        }
#ifdef DEBUG
        cout << pat << endl;
        rep(y,H){
            rep(x,W) putchar(board[y][x]);
            putchar('\n');
        }
        cout << '-' << endl;
        rep(y,H){
            cout << a[y] << endl;
        }
#endif
        bool ok = true;
        rep(y,H)rep(x,W){
            if (board[y][x] != a[y][x]){
                ok = false; goto bad;
            }
        }
        return true;
    bad:
        ;

    } while(next_permutation(ALL(pat)));

    return false;
}

int main() {
    int H,W;
    cin >> H>>W;
    vector<string> a(H);
    rep(i,H) cin >> a[i];
    cout << (solve(H,W,a) ? "Possible":"Impossible") << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Shik and Stone
User naoya_t
Language C++14 (GCC 5.4.1)
Score 200
Code Size 2141 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0.txt, example1.txt, example2.txt
All 200 / 200 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt 1 ms 256 KB
001.txt 1 ms 256 KB
002.txt 2 ms 256 KB
003.txt 1 ms 256 KB
004.txt 1 ms 256 KB
005.txt 1 ms 256 KB
006.txt 1 ms 256 KB
007.txt 1 ms 256 KB
008.txt 1 ms 256 KB
009.txt 1 ms 256 KB
010.txt 1 ms 256 KB
011.txt 1 ms 256 KB
012.txt 1 ms 256 KB
013.txt 1 ms 256 KB
014.txt 1 ms 256 KB
015.txt 1 ms 256 KB
016.txt 1 ms 256 KB
017.txt 1 ms 256 KB
018.txt 1 ms 256 KB
example0.txt 1 ms 256 KB
example1.txt 1 ms 256 KB
example2.txt 1 ms 256 KB