QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#726150	#2921. Land Equality	zeyu^#	WA	0ms	3844kb	C++23	2.0kb	2024-11-08 21:57:04	2024-11-08 21:57:05

Judging History

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

[2024-11-08 21:57:05]
评测

测评结果：WA
用时：0ms
内存：3844kb

查看

[2024-11-08 21:57:04]
提交

answer

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m; cin >> n >> m;
	int a[n][m];
	for (int i = 0; i < n; i ++){
		for (int j = 0; j < m; j ++) cin >> a[i][j];
	}
	vector<int> cnt(3);
	for (int i = 0; i < n; i ++){
		for (int j = 0; j < m; j ++) cnt[a[i][j]] ++;
	}
	if (cnt[0]){
		if (cnt[0] > 1) cout << 0;
		else if (cnt[1]) cout << 1;
		else cout << 2;
	} else{
		if (cnt[2] % 2 == 0) cout << 0;
		else cout << (1ll << (cnt[2] / 2));
	}
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3620kb

input:

1 2
0 1

output:

result:

ok single line: '1'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3540kb

input:

1 2
0 2

output:

result:

ok single line: '2'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

1 2
1 2

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3808kb

input:

2 1
1
1

output:

result:

ok single line: '0'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

2 1
0
0

output:

result:

ok single line: '0'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok single line: '0'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

output:

result:

ok single line: '512'

Test #8:

score: 0

Accepted

time: 0ms

memory: 3616kb

input:

2 3
0 1 2
1 1 2

output:

result:

ok single line: '1'

Test #9:

score: 0

Accepted

time: 0ms

memory: 3580kb

input:

2 6
0 2 2 1 2 2
1 1 1 1 2 2

output:

result:

ok single line: '1'

Test #10:

score: 0

Accepted

time: 0ms

memory: 3836kb

input:

output:

result:

ok single line: '1'

Test #11:

score: -100

Wrong Answer

time: 0ms

memory: 3768kb

input:

1 3
0 1 2

output:

result:

wrong answer 1st lines differ - expected: '2', found: '1'