Submission #979077
Source Code Expand
#include<bits/stdc++.h> int a[10][10]; int n,m; using namespace std; int main(){ ios::sync_with_stdio(false); int n,m; cin>>n>>m; int total=0; for(int i=1;i<=n;i++){ string s; cin>>s; for(int j=1;j<=m;j++){ if(s[j-1]=='#') { a[i][j]=1; total++; } } } if(!a[1][1]){ cout<<"Impossible"; return 0; } int x=1,y=1; int cnt=1; while(1){ if(x==n&&y==m){ if(cnt==total){ cout<<"Possible"; return 0; } cout<<"Impossible"; return 0; } if(!(a[x+1][y]^a[x][y+1])){ cout<<"Impossible"; return 0; } if(a[x+1][y]){ x++; cnt++; continue; } else{ y++; cnt++; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | kakalan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 701 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 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 | 2 ms | 384 KB |
001.txt | AC | 2 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 2 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 2 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 2 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 2 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 2 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |