QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#96383 | #2921. Land Equality | Deadplayer# | AC ✓ | 3ms | 3812kb | C++14 | 2.2kb | 2023-04-13 20:49:25 | 2023-04-13 20:49:59 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define debug(x) cerr << #x << " is " << x << endl;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define one(x) __builtin_popcount(x)
#define ld long double
#define sz(x) x.size()
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
const int N = 1400000;
int cnt[3];
void doWork(){
int r, c;
cin >> r >> c;
int grid[r][c];
for(int i = 0; i < r; ++i){
for(int j = 0; j < c; ++j){
int x;
cin >> x;
grid[i][j] = x;
cnt[x]++;
}
}
if((r == 1 || c == 1) && cnt[0] == 1){
if(r == 1){
if(grid[0][0] == 0){
cout << grid[0][c - 1] << endl;
}
else if(grid[0][c - 1] == 0){
cout << grid[0][0] << endl;
}
else{
cout << min(grid[0][0], grid[0][c - 1]) << endl;
}
}
else{
if(grid[0][0] == 0){
cout << grid[r - 1][0] << endl;
}
else if(grid[r - 1][0] == 0){
cout << grid[0][0] << endl;
}
else{
cout << min(grid[0][0], grid[r - 1][0]) << endl;
}
}
}
else if(cnt[0] >= 2 || (cnt[1] && !cnt[2] && !cnt[0]) || (cnt[2]%2 == 0 && !cnt[0])){
cout << 0 << endl;
}
else if(cnt[0] == 1){
if(cnt[1]){
cout << 1 << endl;
}
else if(!cnt[1] && cnt[2]){
cout << 2 << endl;
}
}
else{
ll B = pow(2ll, (cnt[2] / 2));
cout << B << endl;
}
}
int32_t main(){
FastIO
int tc = 1;
//cin >> tc;
while(tc--){
doWork();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3388kb
input:
1 2 0 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3388kb
input:
1 2 0 2
output:
2
result:
ok single line: '2'
Test #3:
score: 0
Accepted
time: 3ms
memory: 3508kb
input:
1 2 1 2
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
2 1 1 1
output:
0
result:
ok single line: '0'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3400kb
input:
2 1 0 0
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3372kb
input:
5 5 2 2 2 2 2 2 2 1 2 2 2 1 1 1 2 2 2 1 2 2 2 2 2 2 2
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 2ms
memory: 3656kb
input:
5 5 2 2 2 2 2 2 2 1 2 2 2 1 1 1 2 2 2 1 1 2 2 2 2 2 2
output:
512
result:
ok single line: '512'
Test #8:
score: 0
Accepted
time: 2ms
memory: 3364kb
input:
2 3 0 1 2 1 1 2
output:
1
result:
ok single line: '1'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3324kb
input:
2 6 0 2 2 1 2 2 1 1 1 1 2 2
output:
1
result:
ok single line: '1'
Test #10:
score: 0
Accepted
time: 2ms
memory: 3488kb
input:
4 4 2 2 2 2 2 1 2 2 2 0 2 2 2 2 2 2
output:
1
result:
ok single line: '1'
Test #11:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
1 3 0 1 2
output:
2
result:
ok single line: '2'
Test #12:
score: 0
Accepted
time: 2ms
memory: 3396kb
input:
1 6 2 1 2 0 1 2
output:
2
result:
ok single line: '2'
Test #13:
score: 0
Accepted
time: 2ms
memory: 3384kb
input:
6 1 2 1 2 0 1 2
output:
2
result:
ok single line: '2'
Test #14:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
1 5 0 1 1 1 2
output:
2
result:
ok single line: '2'
Test #15:
score: 0
Accepted
time: 2ms
memory: 3396kb
input:
1 6 2 1 2 0 2 1
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 2ms
memory: 3376kb
input:
1 6 1 1 2 0 1 2
output:
1
result:
ok single line: '1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3372kb
input:
6 1 2 1 2 0 2 1
output:
1
result:
ok single line: '1'
Test #18:
score: 0
Accepted
time: 2ms
memory: 3372kb
input:
1 10 2 1 1 1 0 0 1 1 1 2
output:
0
result:
ok single line: '0'
Test #19:
score: 0
Accepted
time: 2ms
memory: 3440kb
input:
1 10 1 2 0 2 2 2 2 0 2 1
output:
0
result:
ok single line: '0'
Test #20:
score: 0
Accepted
time: 2ms
memory: 3360kb
input:
1 10 0 1 1 1 2 2 1 1 1 0
output:
0
result:
ok single line: '0'
Test #21:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
8 8 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
output:
2147483648
result:
ok single line: '2147483648'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
8 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
output:
0
result:
ok single line: '0'
Test #23:
score: 0
Accepted
time: 2ms
memory: 3440kb
input:
8 8 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
output:
0
result:
ok single line: '0'
Test #24:
score: 0
Accepted
time: 2ms
memory: 3372kb
input:
8 8 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
output:
0
result:
ok single line: '0'
Test #25:
score: 0
Accepted
time: 3ms
memory: 3800kb
input:
7 9 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
output:
2147483648
result:
ok single line: '2147483648'
Test #26:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
31 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
output:
0
result:
ok single line: '0'
Test #27:
score: 0
Accepted
time: 2ms
memory: 3552kb
input:
1 61 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
output:
1073741824
result:
ok single line: '1073741824'
Test #28:
score: 0
Accepted
time: 2ms
memory: 3312kb
input:
8 8 1 0 0 1 1 1 1 0 1 1 1 0 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 1 1 0 1 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 1 0
output:
0
result:
ok single line: '0'
Test #29:
score: 0
Accepted
time: 2ms
memory: 3488kb
input:
6 10 0 0 0 1 0 1 1 0 0 0 0 1 0 1 0 0 0 0 1 1 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0
output:
0
result:
ok single line: '0'
Test #30:
score: 0
Accepted
time: 2ms
memory: 3488kb
input:
8 8 2 0 2 2 2 2 2 2 0 2 0 0 0 2 2 2 0 2 2 0 2 2 0 0 0 2 2 2 0 2 0 2 2 2 0 2 0 0 2 0 0 2 0 2 2 0 2 2 0 2 0 0 2 0 2 2 2 2 2 0 0 0 2 2
output:
0
result:
ok single line: '0'
Test #31:
score: 0
Accepted
time: 2ms
memory: 3556kb
input:
10 6 2 0 2 2 0 2 0 0 2 2 0 2 2 2 0 2 0 2 2 2 2 0 2 0 0 0 2 0 0 2 2 2 2 0 2 2 2 0 0 0 2 0 2 2 0 2 0 0 0 2 2 2 0 0 0 0 0 2 2 0
output:
0
result:
ok single line: '0'
Test #32:
score: 0
Accepted
time: 1ms
memory: 3812kb
input:
8 8 1 1 2 1 2 1 1 1 1 2 1 1 2 2 1 1 2 2 1 2 1 2 2 1 1 1 2 2 1 1 1 2 1 2 1 1 2 1 1 1 1 1 1 2 2 1 2 1 1 2 2 1 2 1 2 1 1 2 2 2 2 2 1 1
output:
8192
result:
ok single line: '8192'
Test #33:
score: 0
Accepted
time: 2ms
memory: 3600kb
input:
7 9 2 2 2 2 1 1 1 1 1 1 2 2 2 1 1 2 2 1 1 1 2 1 1 2 2 2 2 2 1 1 1 2 2 2 1 2 2 1 1 1 1 1 2 1 1 2 2 2 2 1 2 2 1 2 2 2 2 2 1 1 1 2 1
output:
65536
result:
ok single line: '65536'
Test #34:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
9 7 2 1 1 1 2 1 2 2 2 1 2 2 1 2 2 1 1 2 1 1 2 1 2 2 2 2 1 2 1 1 1 1 2 2 2 1 2 1 2 2 2 2 1 1 1 1 1 1 1 2 2 2 2 2 2 2 1 2 1 1 2 1 1
output:
65536
result:
ok single line: '65536'
Test #35:
score: 0
Accepted
time: 2ms
memory: 3388kb
input:
8 8 2 1 0 0 2 1 2 2 1 0 0 1 1 0 2 0 1 0 1 2 0 1 0 2 1 2 1 2 1 2 1 2 0 0 1 2 1 0 0 2 0 0 2 1 2 0 2 1 2 1 1 1 1 0 2 0 0 0 1 2 0 1 1 0
output:
0
result:
ok single line: '0'
Test #36:
score: 0
Accepted
time: 2ms
memory: 3308kb
input:
7 9 1 1 1 0 2 1 1 2 0 2 1 2 2 2 2 2 0 1 2 0 2 2 0 1 2 0 2 0 2 2 0 0 2 1 1 2 0 0 1 1 1 1 0 1 1 1 2 0 1 1 0 1 1 0 0 2 0 1 2 2 0 0 2
output:
0
result:
ok single line: '0'
Test #37:
score: 0
Accepted
time: 2ms
memory: 3420kb
input:
9 7 2 2 0 2 2 1 2 2 0 2 0 1 1 1 2 1 1 0 1 0 2 0 0 0 1 1 0 1 1 2 1 2 2 2 0 1 2 0 0 0 0 2 1 2 1 0 1 2 2 0 2 2 2 2 0 2 2 0 2 0 2 0 1
output:
0
result:
ok single line: '0'
Test #38:
score: 0
Accepted
time: 2ms
memory: 3556kb
input:
1 64 0 2 1 2 0 1 2 0 2 1 1 2 2 2 2 2 1 2 2 1 2 0 0 1 2 1 1 0 0 2 0 1 1 1 1 1 2 1 2 1 2 0 2 2 0 0 1 1 2 2 1 1 1 1 0 0 2 1 2 2 2 0 2 1
output:
0
result:
ok single line: '0'
Test #39:
score: 0
Accepted
time: 0ms
memory: 3420kb
input:
64 1 1 1 0 0 1 2 0 1 0 1 0 2 2 2 0 2 1 1 2 1 0 0 2 0 0 1 2 0 1 0 0 2 1 1 0 2 2 0 2 0 1 0 0 1 2 1 0 1 1 2 2 0 1 1 0 0 0 0 2 0 2 1 1 2
output:
0
result:
ok single line: '0'
Test #40:
score: 0
Accepted
time: 2ms
memory: 3548kb
input:
2 32 0 2 2 2 2 1 1 1 2 1 1 2 1 1 2 0 1 1 2 2 2 2 0 0 0 0 0 1 2 1 0 2 0 1 2 2 2 1 1 1 0 0 1 2 2 2 0 0 0 1 1 2 0 0 1 2 2 0 0 2 2 0 2 0
output:
0
result:
ok single line: '0'
Test #41:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
32 2 1 0 1 2 2 0 0 1 0 0 0 2 1 0 1 1 0 2 1 0 1 1 2 0 1 1 1 2 2 0 1 1 0 0 2 0 2 1 1 2 0 2 2 0 0 1 1 2 0 1 1 1 1 1 0 0 2 2 0 1 0 0 2 0
output:
0
result:
ok single line: '0'
Test #42:
score: 0
Accepted
time: 0ms
memory: 3396kb
input:
1 63 1 1 1 2 0 1 1 1 2 1 1 1 2 1 2 2 1 1 2 1 1 2 1 1 1 2 1 1 1 1 2 1 2 2 1 2 2 1 1 2 2 2 1 2 2 1 2 1 2 2 1 1 2 2 1 1 2 2 2 2 1 1 1
output:
1
result:
ok single line: '1'
Test #43:
score: 0
Accepted
time: 2ms
memory: 3488kb
input:
1 64 1 2 1 2 2 1 1 1 0 2 1 1 2 1 2 2 2 2 1 1 1 2 1 2 1 2 1 1 1 2 1 2 1 1 1 2 2 2 1 2 2 2 2 2 1 2 1 1 2 2 1 1 2 2 2 2 2 1 2 2 1 2 1 2
output:
1
result:
ok single line: '1'
Test #44:
score: 0
Accepted
time: 2ms
memory: 3464kb
input:
63 1 1 1 1 1 2 1 1 1 1 2 2 1 1 2 2 2 2 1 2 2 2 1 1 1 1 2 2 1 2 1 2 1 1 1 2 1 1 2 2 2 2 1 1 1 2 1 2 1 2 2 1 1 2 1 1 0 1 2 2 1 1 1 1
output:
1
result:
ok single line: '1'
Test #45:
score: 0
Accepted
time: 0ms
memory: 3388kb
input:
64 1 2 1 2 1 2 1 1 1 1 2 2 1 2 2 2 1 2 1 1 1 2 1 2 1 2 2 2 2 1 1 1 2 2 1 2 0 1 1 2 2 2 2 2 2 2 2 1 2 2 1 1 2 2 2 1 2 2 2 2 1 1 1 1 2
output:
2
result:
ok single line: '2'
Test #46:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
8 8 2 1 1 2 1 1 2 2 1 1 1 1 1 1 2 1 1 2 2 1 2 2 2 1 1 2 1 1 1 2 2 0 1 1 1 1 2 1 1 1 2 1 2 2 2 2 1 1 1 2 2 1 1 2 1 1 1 2 1 2 2 1 2 2
output:
1
result:
ok single line: '1'
Test #47:
score: 0
Accepted
time: 3ms
memory: 3556kb
input:
2 32 2 1 1 2 0 2 2 2 1 1 2 1 2 2 1 1 2 1 2 2 2 1 1 2 2 1 1 1 2 2 2 1 1 1 1 2 2 2 2 2 1 2 2 1 1 2 1 2 2 2 1 1 2 1 2 2 2 1 2 1 2 1 2 2
output:
1
result:
ok single line: '1'
Test #48:
score: 0
Accepted
time: 0ms
memory: 3424kb
input:
32 2 2 2 1 1 2 1 1 1 2 1 1 2 1 1 1 1 1 2 2 2 1 1 2 1 1 1 2 1 1 1 1 1 2 1 1 2 1 2 1 1 1 2 1 0 1 2 1 1 1 1 2 1 2 1 2 1 1 2 2 2 1 2 2 2
output:
1
result:
ok single line: '1'
Test #49:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
3 4 1 2 1 1 2 2 1 2 1 2 2 2
output:
8
result:
ok single line: '8'
Test #50:
score: 0
Accepted
time: 2ms
memory: 3440kb
input:
2 3 0 1 2 0 1 2
output:
0
result:
ok single line: '0'
Test #51:
score: 0
Accepted
time: 2ms
memory: 3356kb
input:
1 3 2 0 2
output:
2
result:
ok single line: '2'