QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#414532	#2921. Land Equality	TheSleepyDevil^#	WA	1ms	3780kb	C++14	2.2kb	2024-05-19 07:30:24	2024-05-19 07:30:25

Judging History

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

[2024-05-19 07:30:25]
评测

测评结果：WA
用时：1ms
内存：3780kb

查看

[2024-05-19 07:30:24]
提交

answer

    /*
     Hell, 'til I reach Hell, I ain't scared
     Mama checkin' in my bedroom, I ain't there
                                                */
    #include<bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    using namespace std;

    #define Major  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define TxtIO   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    #define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
    #define write(a) for(auto x : a) cout<<x<<" ";
    #define int long long
    #define pb push_back
    #define all(a)  a.begin(),a.end()
    #define el "\n"

    typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

    const int inf=4e18;

    int dx[]={1,0,-1,0,1,1,-1,-1};
    int dy[]={0,1,0,-1,1,-1,1,-1};

    const int mod=1e9+7;
    const int MAX =1e6+7;

   // ---------------------------Function----------------------------------//

    void TestCake(){
        int n,m;
        cin>>n>>m;
        set<int>st;
        int arr[n+1][m+1];
        map<int,int>mp;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cin>>arr[i][j];
                mp[arr[i][j]]++;
                st.insert(arr[i][j]);
            }
        }
        if(mp[0]>1){
            cout<<0<<el;
        }
        else if(mp[0]&&mp[1]){
            cout<<1;
        }
        else if(mp[0]&&mp[2]){
            cout<<2;
        }
        else if(mp[2]==1){
            cout<<1<<el;
        }
        else if(mp[2]){
            int left=mp[2]/2;
            int right=(mp[2]+1)/2;
            int first=(1LL<<left);
            int second=(1LL<<right);
            cout<<(second-first);
        }
        else{
            cout<<0;
        }
    }
    //------------------------------Main---------------------------//
    signed main(){
        Major
        int T = 1;
//        cin >> T;
        while(T--){
            TestCake();
        //       cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
        }
        return 0;
    }

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3780kb

input:

1 2
0 1

output:

result:

ok single line: '1'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

1 2
0 2

output:

result:

ok single line: '2'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3580kb

input:

1 2
1 2

output:

result:

ok single line: '1'

Test #4:

score: 0

Accepted

time: 1ms

memory: 3576kb

input:

2 1
1
1

output:

result:

ok single line: '0'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3660kb

input:

2 1
0
0

output:

result:

ok single line: '0'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3528kb

input:

output:

result:

ok single line: '0'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3460kb

input:

output:

result:

ok single line: '512'

Test #8:

score: 0

Accepted

time: 1ms

memory: 3464kb

input:

2 3
0 1 2
1 1 2

output:

result:

ok single line: '1'

Test #9:

score: 0

Accepted

time: 1ms

memory: 3508kb

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

input:

output:

result:

ok single line: '1'

Test #11:

score: -100

Wrong Answer

time: 1ms

memory: 3532kb

input:

1 3
0 1 2

output:

result:

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