Submission #980064
Source Code Expand
#define _USE_MATH_DEFINES #include <sstream> //string stream its useful! #include<string> #include<iostream> #include<utility> //pair #include <vector> // vector #include <algorithm> // swap,sort,binary_search #include <functional> // std::greater #include <map> //map #include<set> //set #include<queue> //queue #include<list> //list #include<cmath> #include<numeric> #include<cassert> #include <iomanip> //cout<<setprecision typedef long long ll; #define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0])) using namespace std; void omajinai() { cin.tie(0); ios::sync_with_stdio(false); cout<<setprecision(15); //freopen("txt.csv","r",stdin); } int main(){ omajinai(); int H,W; cin>>H>>W; vector<vector<char > > A(H,vector<char>(W,' ')); for(int i = 0 ; i<H;i++) for(int j = 0; j<W;j++) cin>>A[i][j]; int nowi = 0, nowj = 0; while(true){ bool upleftcondition = (nowi-1>0 && A[nowi-1][nowj] == '#')&&(nowj-1>0 && A[nowi][nowj-1] == '#'); if (upleftcondition){ cout<<"Impossible"<<endl; exit(0); } if(nowi==H-1 && nowj == W-1) break; bool tate = nowi+1<H&&A[nowi+1][nowj] == '#'; bool yoko = nowj+1<W&&A[nowi][nowj+1] == '#'; if (!(tate^yoko)){ cout<<"Impossible"<<endl; exit(0); } if(tate) nowi++; if(yoko) nowj++; } cout<<"Possible"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | tamtam484 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1495 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 | 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 | AC | 3 ms | 256 KB |
010.txt | AC | 3 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 | 3 ms | 256 KB |
015.txt | AC | 3 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 |