QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#647775#8110. AdditionN_z_WA 1ms3860kbC++237.1kb2024-10-17 15:38:472024-10-17 15:38:47

Judging History

你现在查看的是最新测评结果

  • [2024-10-17 15:38:47]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3860kb
  • [2024-10-17 15:38:47]
  • 提交

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)
{
	vector<pair<string,string>>t;
	t.emplace_back("a0","0a");
	t.emplace_back("a1","1a");
	t.emplace_back("b0","0b");
	t.emplace_back("b1","1b");
	t.emplace_back("a","c");
	t.emplace_back("b","d");
	t.emplace_back("0c","e");
	t.emplace_back("1c","f");
	t.emplace_back("0d","f");
	t.emplace_back("1d","qe");
	t.emplace_back("0q","1");
	t.emplace_back("1q","q0");
	t.emplace_back("q","1");
	t.emplace_back("0+","+a");
	t.emplace_back("1+","+b");
	t.emplace_back("+0","0");
	t.emplace_back("+1","1");
	t.emplace_back("e","0");
	t.emplace_back("f","1");
	t.emplace_back("d0","10");
	t.emplace_back("d1","11");
	// string s="110+0";
	// while(1)
	// {
	// 	cout<<s<<endl;
	// 	for(auto v:t)
	// 	if(s.find(v.first)!=string::npos)
	// 	{
	// 		s.replace(s.find(v.first),v.first.size(),v.second);
	// 		goto again;
	// 	}
	// 	break;
	// 	again:;
	// }
	// cout<<s<<endl;
	cout<<t.size()<<endl;
	for(auto [u,v]:t)cout<<u<<' '<<v<<endl;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3816kb

input:

1

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #2:

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

input:

2

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #3:

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

input:

3

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #4:

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

input:

4

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #5:

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

input:

5

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #6:

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

input:

6

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #7:

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

input:

7

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #8:

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

input:

8

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #9:

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

input:

9

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #10:

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

input:

10

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #11:

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

input:

11

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #12:

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

input:

12

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #13:

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

input:

13

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #14:

score: 0
Accepted
time: 1ms
memory: 3552kb

input:

14

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #15:

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

input:

15

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #16:

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

input:

16

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #17:

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

input:

17

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #18:

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

input:

18

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #19:

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

input:

19

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #20:

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

input:

20

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #21:

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

input:

21

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #22:

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

input:

22

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #23:

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

input:

23

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #24:

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

input:

24

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #25:

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

input:

25

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #26:

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

input:

26

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #27:

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

input:

27

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #28:

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

input:

28

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #29:

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

input:

29

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #30:

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

input:

30

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #31:

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

input:

31

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #32:

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

input:

32

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

ok OK!

Test #33:

score: -100
Wrong Answer
time: 0ms
memory: 3492kb

input:

33

output:

21
a0 0a
a1 1a
b0 0b
b1 1b
a c
b d
0c e
1c f
0d f
1d qe
0q 1
1q q0
q 1
0+ +a
1+ +b
+0 0
+1 1
e 0
f 1
d0 10
d1 11

result:

wrong answer Zla odpowiedz. Oczekiwano 100, a wczytano +dc0