QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#134924#6641. XOR Dicewhsyhyyh#WA 1ms3820kbC++141.2kb2023-08-05 10:04:022023-08-05 10:04:03

Judging History

This is the latest submission verdict.

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 10:04:03]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 3820kb
  • [2023-08-05 10:04:02]
  • Submitted

answer

#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 15
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int n,d;
void work1() {
	rep(i,1,n) {
		int now=0;
		rep(A,0,1) rep(B,0,1) {
			int tmp=d<<13;
			if(!A) tmp^=0;else tmp^=d;
			if(!B) tmp^=d<<6;else tmp^=d<<7;
			printf("%d ",tmp);
		}
		printf("%d %d\n",(d<<6)^(d<<14),(d<<7)^(d<<14));
	}
}
void work2() {
	rep(i,1,n) {
		int now=0;
		rep(A,0,1) rep(B,0,1) {
			int tmp=d<<13;
			if(!A) tmp^=0;else tmp^=d;
			if(!B) tmp^=d<<6;else tmp^=(d<<7)^(d<<6);
			printf("%d ",tmp);
		}
		printf("%d %d\n",(d<<6)^(d<<14)^(d<<13),(d<<7)^(d<<14)^(d<13));
	}
}
int main() {
	n=rd(),d=rd();
	if(n&1) work1();
	else work2();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3 2

output:

16512 16640 16514 16642 32896 33024
16512 16640 16514 16642 32896 33024
16512 16640 16514 16642 32896 33024

result:

ok Correct answer

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3816kb

input:

100 60

output:

495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360 495872 495420 495932 560896 990720
495360...

result:

wrong answer Invalid output