Submission #979071
Source Code Expand
#include <algorithm> #include <cstdio> #include <cstdlib> #include <cctype> #include <cmath> #include <iostream> #include <queue> #include <list> #include <stack> #include <map> #include <numeric> #include <set> #include <sstream> #include <string> #include <vector> using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; string field[10]; int main(){ ios::sync_with_stdio(false); int H, W; cin >> H >> W; rep(i,H){ cin >> field[i]; } bool flg = true; field[0][0]='@'; while(field[H-1][W-1]=='#'){ bool check = false; rep(i,H){ rep(j,W){ if(field[i][j]=='@'){ int cnt = 0; if(i+1<H && field[i+1][j]=='#'){ field[i+1][j]='@'; cnt++; check = true; } if(j+1<W && field[i][j+1]=='#'){ field[i][j+1]='@'; cnt++; check = true; } if(cnt==2) flg = false; } } } if(!check) flg = false; if(!flg) break; } rep(i,H){ rep(j,W){ if(field[i][j]=='#') flg = false; } } if(flg){ cout << "Possible" << endl; }else{ cout << "Impossible" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | phyllo |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1451 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.txt |
All | 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 | AC | 3 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 3 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 3 ms | 256 KB |
012.txt | AC | 3 ms | 256 KB |
013.txt | AC | 3 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 3 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 3 ms | 256 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |