QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#96264	#2921. Land Equality	Abdelrahman_K^#	AC ✓	3ms	3436kb	C++14	2.1kb	2023-04-13 18:14:40	2023-04-13 18:14:42

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 18:14:42]
评测

测评结果：AC
用时：3ms
内存：3436kb

查看

[2023-04-13 18:14:40]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
const int N = 2e7 + 2;

int main() {
//    int x, y;
//    cin >> x >> y;
//    if (x > y) swap(x, y);
//    string s;
//    cin >> s;
//    int a[4];
//    memset(a, -1, sizeof a);
//    for (int i = 0; i < 4; i++) {
//        if (s[i] == 'A') {
//            if (x)
//                a[i] = x, x = 0;
//            else
//                a[i] = y;
//        }
//    }
//    if (s[1] == 'B' && s[2] == 'B') {
//        if (a[3] - a[0] == 3)
//            a[1] = a[0] + 1, a[2] = a[0] + 2;
//    }
//    else if (s[0] == 'B') {
//        if (s[1] == 'B' && a[2] == 3 && a[3] == 4)
//            a[0] = 1, a[1] = 2;
//        else if (s[2] == 'B' && a[1] == 2 && a[3] == 4)
//            a[0] = 1, a[2] = 3;
//    }
//    else if (s[3] == 'B') {
//        if (s[2] == 'B' && a[0] == 6 && a[1] == 7)
//            a[2] = 8, a[3] = 9;
//        else if (s[1] == 'B' && a[0] == 6 && a[2] == 8)
//            a[1] = 7, a[3] = 9;
//    }
//    sort(a,a + 4);
//    for (int i = 1; i < 4; i++) {
//        if (a[i] - a[i - 1] != 1)
//            return cout << -1, 0;
//    }
//    for (int i = 0; i < 4; i++) {
//        if (s[i] == 'B')
//            cout << a[i] << ' ';
//    }

    int n, m;
    cin>>n>>m;
    int arr[3] = {};
    vector<int> vec;
    for(int i = 0; i < n * m; i++){
        int a; cin>>a;
        arr[a]++;
        vec.push_back(a);
    }
    if(n == 1 || m == 1){
        ll ans = 1e18;
        for(int i = 0; i < vec.size() - 1; i++){
            ll x = 1, y = 1;
            for(int j = 0; j <= i; j++)
                x *= vec[j];
            for(int j = i + 1; j < vec.size(); j++)
                y *= vec[j];
            ans = min(ans, abs(x - y));
        }
        return cout<<ans, 0;
    }
    if(arr[0] >= 2)
        cout<<0;
    else if(arr[0] == 1){
        if(arr[1] > 0)
            cout<<1;
        else
            cout<<2;
    }
    else if(arr[2] % 2 == 0){
        cout<<0;
    }
    else
        cout<< (1ll << (arr[2] / 2));
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 3336kb

input:

1 2
0 1

output:

result:

ok single line: '1'

Test #2:

score: 0

Accepted

time: 2ms

memory: 3292kb

input:

1 2
0 2

output:

result:

ok single line: '2'

Test #3:

score: 0

Accepted

time: 2ms

memory: 3408kb

input:

1 2
1 2

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 2ms

memory: 3404kb

input:

2 1
1
1

output:

result:

ok single line: '0'

Test #5:

score: 0

Accepted

time: 3ms

memory: 3316kb

input:

2 1
0
0

output:

result:

ok single line: '0'

Test #6:

score: 0

Accepted

time: 2ms

memory: 3360kb

input:

output:

result:

ok single line: '0'

Test #7:

score: 0

Accepted

time: 1ms

memory: 3408kb

input:

output:

result:

ok single line: '512'

Test #8:

score: 0

Accepted

time: 2ms

memory: 3416kb

input:

2 3
0 1 2
1 1 2

output:

result:

ok single line: '1'

Test #9:

score: 0

Accepted

time: 1ms

memory: 3348kb

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: 1ms

memory: 3328kb

input:

output:

result:

ok single line: '1'

Test #11:

score: 0

Accepted

time: 2ms

memory: 3356kb

input:

1 3
0 1 2

output:

result:

ok single line: '2'

Test #12:

score: 0

Accepted

time: 2ms

memory: 3360kb

input:

1 6
2 1 2 0 1 2

output:

result:

ok single line: '2'

Test #13:

score: 0

Accepted

time: 2ms

memory: 3400kb

input:

output:

result:

ok single line: '2'

Test #14:

score: 0

Accepted

time: 2ms

memory: 3372kb

input:

1 5
0 1 1 1 2

output:

result:

ok single line: '2'

Test #15:

score: 0

Accepted

time: 3ms

memory: 3384kb

input:

1 6
2 1 2 0 2 1

output:

result:

ok single line: '1'

Test #16:

score: 0

Accepted

time: 0ms

memory: 3352kb

input:

1 6
1 1 2 0 1 2

output:

result:

ok single line: '1'

Test #17:

score: 0

Accepted

time: 2ms

memory: 3352kb

input:

output:

result:

ok single line: '1'

Test #18:

score: 0

Accepted

time: 2ms

memory: 3340kb

input:

1 10
2 1 1 1 0 0 1 1 1 2

output:

result:

ok single line: '0'

Test #19:

score: 0

Accepted

time: 0ms

memory: 3360kb

input:

1 10
1 2 0 2 2 2 2 0 2 1

output:

result:

ok single line: '0'

Test #20:

score: 0

Accepted

time: 0ms

memory: 3324kb

input:

1 10
0 1 1 1 2 2 1 1 1 0

output:

result:

ok single line: '0'

Test #21:

score: 0

Accepted

time: 0ms

memory: 3296kb

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: 3ms

memory: 3420kb

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:

result:

ok single line: '0'

Test #23:

score: 0

Accepted

time: 2ms

memory: 3320kb

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:

result:

ok single line: '0'

Test #24:

score: 0

Accepted

time: 1ms

memory: 3344kb

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:

result:

ok single line: '0'

Test #25:

score: 0

Accepted

time: 2ms

memory: 3360kb

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: 1ms

memory: 3356kb

input:

output:

result:

ok single line: '0'

Test #27:

score: 0

Accepted

time: 0ms

memory: 3432kb

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: 3ms

memory: 3268kb

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:

result:

ok single line: '0'

Test #29:

score: 0

Accepted

time: 1ms

memory: 3340kb

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:

result:

ok single line: '0'

Test #30:

score: 0

Accepted

time: 2ms

memory: 3364kb

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:

result:

ok single line: '0'

Test #31:

score: 0

Accepted

time: 0ms

memory: 3416kb

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:

result:

ok single line: '0'

Test #32:

score: 0

Accepted

time: 1ms

memory: 3428kb

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:

result:

ok single line: '8192'

Test #33:

score: 0

Accepted

time: 3ms

memory: 3272kb

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:

result:

ok single line: '65536'

Test #34:

score: 0

Accepted

time: 1ms

memory: 3340kb

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:

result:

ok single line: '65536'

Test #35:

score: 0

Accepted

time: 2ms

memory: 3336kb

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:

result:

ok single line: '0'

Test #36:

score: 0

Accepted

time: 3ms

memory: 3436kb

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:

result:

ok single line: '0'

Test #37:

score: 0

Accepted

time: 2ms

memory: 3276kb

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:

result:

ok single line: '0'

Test #38:

score: 0

Accepted

time: 2ms

memory: 3360kb

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:

result:

ok single line: '0'

Test #39:

score: 0

Accepted

time: 0ms

memory: 3360kb

input:

output:

result:

ok single line: '0'

Test #40:

score: 0

Accepted

time: 2ms

memory: 3332kb

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:

result:

ok single line: '0'

Test #41:

score: 0

Accepted

time: 2ms

memory: 3296kb

input:

output:

result:

ok single line: '0'

Test #42:

score: 0

Accepted

time: 0ms

memory: 3360kb

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:

result:

ok single line: '1'

Test #43:

score: 0

Accepted

time: 1ms

memory: 3332kb

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:

result:

ok single line: '1'

Test #44:

score: 0

Accepted

time: 2ms

memory: 3380kb

input:

output:

result:

ok single line: '1'

Test #45:

score: 0

Accepted

time: 2ms

memory: 3296kb

input:

output:

result:

ok single line: '2'

Test #46:

score: 0

Accepted

time: 2ms

memory: 3388kb

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:

result:

ok single line: '1'

Test #47:

score: 0

Accepted

time: 2ms

memory: 3436kb

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:

result:

ok single line: '1'

Test #48:

score: 0

Accepted

time: 2ms

memory: 3320kb

input:

output:

result:

ok single line: '1'

Test #49:

score: 0

Accepted

time: 2ms

memory: 3380kb

input:

output:

result:

ok single line: '8'

Test #50:

score: 0

Accepted

time: 2ms

memory: 3316kb

input:

2 3
0 1 2
0 1 2

output:

result:

ok single line: '0'

Test #51:

score: 0

Accepted

time: 2ms

memory: 3388kb

input:

1 3
2 0 2

output:

result:

ok single line: '2'