QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#721768#8992. Light UpN_z_AC ✓0ms3836kbC++236.9kb2024-11-07 16:47:312024-11-07 16:47:32

Judging History

This is the latest submission verdict.

  • [2024-11-07 16:47:32]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3836kb
  • [2024-11-07 16:47:31]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void init();void solve(int tc);
main()
{
	init();int t=1;
	// cin>>t;
	for(int tc=1;tc<=t;tc++)solve(tc);
}
void init()
{
}
void solve([[maybe_unused]]int tc)
{
	int n;
	cin>>n;
	vector<string>s(n+2,string(n+2,'X'));
	for(int x=1;x<=n;x++)
	for(int y=1;y<=n;y++)
	cin>>s[x][y];
	vector<vector<int>>vis(n+2,vector<int>(n+2));
	auto fail=[&]()
	{
		cout<<0<<endl;
		exit(0);
	};
	for(int x=1;x<=n;x++)
	for(int y=1;y<=n;y++)
	if(s[x][y]=='?')
	{
		int u=x-1;
		while(s[u][y]=='.')vis[u--][y]=1;
		if(s[u][y]=='?')fail();
		u=x+1;
		while(s[u][y]=='.')vis[u++][y]=1;
		if(s[u][y]=='?')fail();
		u=y-1;
		while(s[x][u]=='.')vis[x][u--]=1;
		if(s[x][u]=='?')fail();
		u=y+1;
		while(s[x][u]=='.')vis[x][u++]=1;
		if(s[x][u]=='?')fail();
	}
	else if(isdigit(s[x][y]))
	{
		if(s[x][y]-'0'!=(s[x-1][y]=='?')+(s[x+1][y]=='?')+(s[x][y-1]=='?')+(s[x][y+1]=='?'))fail();
	}
	for(int x=1;x<=n;x++)
	for(int y=1;y<=n;y++)
	if(s[x][y]=='.'&&!vis[x][y])fail();
	cout<<1<<endl;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3596kb

input:

7
.?.0..?
..X.1?.
.X.?.2.
.....?.
?3?..2.
.?3.X?.
..?X?..

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3596kb

input:

7
.?.0..?
..X.1?.
.X...2.
.....?.
?3?..2.
.?3.X?.
..?X?..

output:

0

result:

ok single line: '0'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

1
?

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

1
0

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3768kb

input:

1
1

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

2
0.
.?

output:

1

result:

ok single line: '1'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

2
2?
?.

output:

1

result:

ok single line: '1'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

3
..?
.0.
?..

output:

1

result:

ok single line: '1'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

3
..?
.0.
?.?

output:

0

result:

ok single line: '0'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

3
?..
.2.
..?

output:

0

result:

ok single line: '0'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

10
.1?20.1?3?
?22?2?.3?.
.?211..?21
..?2?2?2.?
.01..02.?3
...?2.?.3?
1.?3?12.?.
?.10.1?.11
2?......2?
...?.00.?2

output:

1

result:

ok single line: '1'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

20
.....?10..2?.2?3?...
0..?...1..?3.?3?....
.?.1...?..2?21...?..
?3?2?2?2....?..00.?.
..1.......?12?....1.
0......?............
.?..0.0..?...01?.2?.
.....?.2?2.......?..
?1.....?.0...?......
...?1.......?4?..1..
.?....1.0....?3..?2.
1.?2?2?2.?..0.?2?3?.
?...2.2?..01.......?
1.01?.1....?........
......

output:

1

result:

ok single line: '1'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3544kb

input:

30
.?....0.0..........?..........
?2.?.....0........?2...?....0.
.......?...............2...?..
0..1?1...0.?....1?...0.?..01..
............?..............1.?
0.?.........2...........?.1?..
...1..?....1?.....1..?........
...?3?3...........?.0.?...0...
.?13?3?.............0....?...0
.21?..1..?3?1...?....

output:

1

result:

ok single line: '1'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3796kb

input:

30
?.............................
.?............................
..?...........................
...?..........................
....?.........................
.....?........................
......?.......................
.......?......................
........?.....................
.........?...........

output:

1

result:

ok single line: '1'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

30
X?X?X?X?X?X?X?X?X?X?X?X?X?X?X?
?X?X?X?X?X?X?X?X?X?X?X?X?X?X?X
X?X?X?X?X?X?X?X?X?X?X?X?X?X?X?
?X?X?X?X?X?X?X?X?X?X?X?X?X?X?X
X?X?X?X?X?X?X?X?X?X?X?X?X?X?X?
?X?X?X?X?X?X?X?X?X?X?X?X?X?X?X
X?X?X?X?X?X?X?X?X?X?X?X?X?X?X?
?X?X?X?X?X?X?X?X?X?X?X?X?X?X?X
X?X?X?X?X?X?X?X?X?X?X?X?X?X?X?
?X?X?X?X?X?X?X?X?X...

output:

1

result:

ok single line: '1'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

30
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000000000000000
000000000000000000...

output:

1

result:

ok single line: '1'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

3
.?.
?4?
.?.

output:

1

result:

ok single line: '1'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
XXXXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXXXXXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2?XX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

1

result:

ok single line: '1'

Test #19:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
XXXXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXX?XXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2?XX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

0

result:

ok single line: '0'

Test #20:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
XXXXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXXXXXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2XXX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

0

result:

ok single line: '0'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
XXXXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXXXXXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2?XX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

0

result:

ok single line: '0'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
XXXXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXXXXXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2?XX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

0

result:

ok single line: '0'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3804kb

input:

19
XXXXXXXXX?XXX?XXX?X
X0XXX1?XX2XX?3XX?4?
X?XXXXXXX?XXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXX?XXXXXXX?XXX?X
X0XXX1XX?2XX?3?X?4?
XXXXXXXXX?XXXXXXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXX?X
X0XX?1XX?2?X?3?X?4?
XXXXXXXXXXXXX?XXX?X
XXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXX?XXX?X
X0XXX1XXX2?XX3?X?4?
XXXXX?XXX?XXX?XXX...

output:

0

result:

ok single line: '0'