QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#152574#6418. Ah, It's Yesterday Once MoreqzezWA 1ms3488kbC++141.0kb2023-08-28 12:27:332023-08-28 12:27:34

Judging History

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

  • [2023-08-28 12:27:34]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3488kb
  • [2023-08-28 12:27:33]
  • 提交

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\
01010101010101010101\n\
11111111111111111111\n\
10101010101010101010\n\
01010100010101010011\n\
11010100111110110110\n\
01111110100101100011\n\
11000101110110110110\n\
01101110101101100011\n\
11000101110110110110\n\
01101110101101100011\n\
11000101110110110110\n\
01100110101101100011\n\
11011101110110110110\n\
01100110101101100011\n\
11011100100110110110\n\
01101011111011100011\n\
11001110101000100110\n\
01010001010101010011\n\
11111111111111111110\n\
10101010101010101011\
");
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:



output:

20 20
01010101010101010101
11111111111111111111
10101010101010101010
01010100010101010011
11010100111110110110
01111110100101100011
11000101110110110110
01101110101101100011
11000101110110110110
01101110101101100011
11000101110110110110
01100110101101100011
11011101110110110110
01100110101101100011
...

result:

wrong answer Not connected.