Submission #5569618
Source Code Expand
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; int GCD(int a, int b){return b == 0 ? a : GCD(b, a % b);} int main(){ cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); //freopen("input.txt", "r", stdin); int n, m; cin >> n >> m; string cur, prev; for(int i = 0; i < n; ++i){ cin >> cur; if(i > 0){ for(int j = 1; j < m; ++j){ if(prev[i] == '#' && prev[i - 1] == '#' && cur[i - 1] == '#'){ cout << "Impossible"; return 0; } if(prev[i] == '#' && cur[i] == '#' && cur[i - 1] == '#'){ cout << "Impossible"; return 0; } } } prev = cur; } cout << "Possible"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | Zeyu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 887 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
001.txt | WA | 1 ms | 256 KB |
002.txt | WA | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | WA | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 1 ms | 256 KB |