QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#352291#7779. Swiss StageOccDreamer#WA 0ms3616kbC++141.5kb2024-03-13 08:14:402024-03-13 08:14:41

Judging History

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

  • [2024-03-13 08:14:41]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3616kb
  • [2024-03-13 08:14:40]
  • 提交

answer

//code by Emissary
#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(int x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(int x){write(x), putchar(32);}
	inline void eprint(int x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 5e5+5;
const int mod = 998244353;
//const int mod = 1e9+7;

signed main(){
	input(a);
	int x, y;
	cin >> x >> y;
	if(x==0 && y==0) cout << 4;
	if(x==0 && y==1) cout << 4;
	if(x==0 && y==2) cout << 6;
	if(x==1 && y==0) cout << 3;
	if(x==1 && y==1) cout << 3;
	if(x==1 && y==2) cout << 4;
	if(x==2 && y==0) cout << 2;
	if(x==2 && y==1) cout << 2;
	if(x==2 && y==2) cout << 2;
	return 0;
}





































































Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3616kb

input:

0 1

output:


result:

wrong answer Answer contains longer sequence [length = 1], but output contains 0 elements