QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#96344	#2921. Land Equality	Deadplayer^#	WA	2ms	3668kb	C++14	1.7kb	2023-04-13 19:57:58	2023-04-13 19:57:59

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-13 19:57:59]
评测

测评结果：WA
用时：2ms
内存：3668kb

查看

[2023-04-13 19:57:58]
提交

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;
    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            int x;
            cin >> x;
            cnt[x]++;
        }
    }
    if(cnt[0] >= 2 || (cnt[1] && !cnt[2] && !cnt[0]) || (!cnt[1] && cnt[2]%2 == 0 && !cnt[0])){
        cout << 0 << endl;
    }
    else if(cnt[0] == 1){
        if(cnt[1] && !cnt[2]){
            cout << 1 << endl;
        }
        else if(!cnt[1] && cnt[2]){
            cout << 2 << endl;
        }
        else if(cnt[1] && cnt[2]){
            cout << 1 << endl;
        }
    }
    else{
        if(cnt[2]%2 == 0){
            cout << 0 << endl;
        }
        else if(cnt[2]%2 == 1){
            ll B = pow(2LL, (cnt[2] / 2));
            cout << B << endl;
        }
    }
}
int32_t main(){
    FastIO
    int tc = 1;
    //cin >> tc;
    while(tc--){
        doWork();
    }
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3344kb

input:

1 2
0 1

output:

result:

ok single line: '1'

Test #2:

score: 0

Accepted

time: 1ms

memory: 3440kb

input:

1 2
0 2

output:

result:

ok single line: '2'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3524kb

input:

1 2
1 2

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3524kb

input:

2 1
1
1

output:

result:

ok single line: '0'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3356kb

input:

2 1
0
0

output:

result:

ok single line: '0'

Test #6:

score: 0

Accepted

time: 1ms

memory: 3396kb

input:

output:

result:

ok single line: '0'

Test #7:

score: 0

Accepted

time: 2ms

memory: 3668kb

input:

output:

result:

ok single line: '512'

Test #8:

score: 0

Accepted

time: 2ms

memory: 3352kb

input:

2 3
0 1 2
1 1 2

output:

result:

ok single line: '1'

Test #9:

score: 0

Accepted

time: 2ms

memory: 3336kb

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: 3376kb

input:

output:

result:

ok single line: '1'

Test #11:

score: -100

Wrong Answer

time: 2ms

memory: 3520kb

input:

1 3
0 1 2

output:

result:

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