Submission #978921
Source Code Expand
#include<bits/stdc++.h> #define x first #define y second using namespace std; int n, m; char v[100][100]; queue<pair<int, int>> q; bool in(int x, int y) { return (x>=1 && x<=n && y>=1 && y<=m && v[x][y]=='#'); } int main() { cin >> n >> m; for(int i = 1;i<=n;++i) for(int j = 1;j<=m;++j) cin >> v[i][j]; if(v[1][1]!='#') { cout << "Impossible"; return 0; } q.push({1,1}); while(!q.empty()) { pair<int, int> E = q.front(); q.pop(); if(E.x == n && E.y==m) { cout << "Possible"; return 0; } if(in(E.x, E.y-1)) { cout << "Impossible"; return 0; } if(in(E.x+1, E.y)) q.push({E.x+1, E.y}); if(in(E.x, E.y+1)) q.push({E.x, E.y+1}); } cout << "Impossible"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | aleeN |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 960 Byte |
Status | WA |
Exec Time | 2 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 | 2 ms | 256 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 | WA | 2 ms | 256 KB |
010.txt | WA | 2 ms | 256 KB |
011.txt | WA | 2 ms | 256 KB |
012.txt | WA | 2 ms | 256 KB |
013.txt | WA | 2 ms | 256 KB |
014.txt | WA | 2 ms | 256 KB |
015.txt | WA | 2 ms | 256 KB |
016.txt | WA | 2 ms | 256 KB |
017.txt | WA | 2 ms | 256 KB |
018.txt | WA | 2 ms | 256 KB |
example0.txt | WA | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |