Submission #1695924
Source Code Expand
/*
____________ ______________ __
/ _________ /\ /_____ _____/\ / /\
/ /\ / / \\ / /\ \ \ / / \
/ / \_____/ / / \__/ / \____\/ / / /
/ / / / / / / / / / / /
/ / / / / / / / / / / /
/ / / / / / / / / / / /
/ /___/____/ / / / / / / /___/________
/____________/ / /__/ / /______________/\
\ \ / \ \ / \ \ \
\____________\/ \__\/ \______________\/
___ ___ ___ __________
/ /\ / /\ / /\ /_______ /\
/ /__\___/ / \ / / \ \ / / \
/____ ____/ / / / / \____/ / /
\ / /\ \ / / / / / / /
\_/ / \___\/ ___ / / / / / /
/ / / / /\ / / / / / /
/ / / / /__\__/ / / / /___/____
/___/ / /___________/ / /___________/\
\ \ / \ \ / \ \ \
\___\/ \___________\/ \___________\/
A FAN OF FIZZYDAVID
*/
#include<bits/stdc++.h>
#define HEAP priority_queue
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define forn(i,l,r) for(int i=(l);i<=(r);i++)
#define nrof(i,r,l) for(int i=(r);i>=(l);i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-20
#define pi 3.1415926535897932384626433832795
#define orz int
#define yjz main
#define fizzydavid return
#define ak 0
#define la ;
#define debug puts("OK");
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
using namespace std;
typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int iinf=1e9+7;
const LL linf=1ll<<60;
const flt dinf=1e10;
template <typename T>
inline void scf(T &x)
{
bool f=0; x=0; char c=getchar();
while((c<'0' || c>'9') && c!='-') c=getchar();
if(c=='-') { f=1; c=getchar(); }
while(c>='0' && c<='9') { x=x*10+c-'0'; c=getchar(); }
if(f) x=-x; return;
}
template <typename T1,typename T2>
void scf(T1 &x,T2 &y) { scf(x); return scf(y); }
template <typename T1,typename T2,typename T3>
void scf(T1 &x,T2 &y,T3 &z) { scf(x); scf(y); return scf(z); }
#ifdef ONLINE_JUDGE
#else
#define DEBUG
#endif
//---------------------------head----------------------------
const int N=11;
int n,m;
char cmap[N][N];
bool f[N][N];
orz yjz()
{
scf(n,m);
forn(i,1,n) scanf("%s",cmap[i]+1);
forn(i,1,n) forn(j,1,m) f[i][j]=(cmap[i][j]=='#');
forn(i,1,n) forn(j,1,m) if(f[i][j] && f[i][j+1] && f[i+1][j]){ puts("Impossible"); fizzydavid ak la }
int x=1,y=1; f[1][1]=1;
if(!f[1][1]){ puts("Impossible"); fizzydavid ak la }
while(x!=n || y!=m)
{
int tx=x,ty=y;
f[x][y]=0;
if(f[x][y+1]) y++;
else if(f[x+1][y]) x++;
if(x==tx && y==ty){ puts("Impossible"); fizzydavid ak la }
}
f[n][m]=0;
forn(i,1,n) forn(j,1,m) if(f[i][j]){ puts("Impossible"); fizzydavid ak la }
puts("Possible");
fizzydavid ak la
}
Submission Info
Submission Time
2017-10-21 09:44:04+0900
Task
A - Shik and Stone
User
OMTWOCZWEIXVI
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
3408 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:95:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
forn(i,1,n) scanf("%s",cmap[i]+1);
^
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
1 ms
256 KB
001.txt
AC
1 ms
256 KB
002.txt
AC
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
AC
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