QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#152411#6418. Ah, It's Yesterday Once Moreqzez#WA 1ms3696kbC++141.0kb2023-08-28 07:48:152023-08-28 07:48:17

Judging History

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

  • [2023-08-28 07:48:17]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3696kb
  • [2023-08-28 07:48:15]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
int main(){
    puts("\
20 20\n\
11010101010101010101\n\
01111111111111111111\n\
01010000000000000010\n\
01010111111111111010\n\
01010100101000101011\n\
01010101001011001010\n\
01010101101001101011\n\
01010101011110101010\n\
01010101010010101010\n\
01010101011010100111\n\
11010101010010111101\n\
01010101000010100011\n\
01010101111110101010\n\
11010100000000101010\n\
01010111111111101011\n\
01010000000000001010\n\
11011111111111111011\n\
01000100010010001010\n\
11111011010101110111\n\
00101110010111011101\
");
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3696kb

input:



output:

20 20
11010101010101010101
01111111111111111111
01010000000000000010
01010111111111111010
01010100101000101011
01010101001011001010
01010101101001101011
01010101011110101010
01010101010010101010
01010101011010100111
11010101010010111101
01010101000010100011
01010101111110101010
11010100000000101010
...

result:

wrong answer 6 successful hack.