oj.uz

Submission #935245

# Submission time Handle Problem Language Result Execution time Memory
935245 2024-02-29T01:04:18 Z irmuun Plus Minus (BOI17_plusminus) C++17
100 / 100
 40 ms 7248 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

const ll mod=1e9+7;

ll binpow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1){
            res=res*a%mod;
        }
        a=a*a%mod;
        b=b>>1;
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,k;
    cin>>n>>m>>k;
    vector<array<ll,3>>a(k),b(k);
    for(ll i=0;i<k;i++){
        char c;
        ll x,y;
        cin>>c>>x>>y;
        ll u=(c=='+');
        a[i]={x,y,u};
        b[i]={y,x,u};
    }
    sort(all(a));
    sort(all(b));
    ll ans=0;
    ll r=0,leftR=n,leftC=m;
    ll c[2][2];
    bool ok=true;
    for(ll i=0;i<k;){
        memset(c,0,sizeof c);
        c[a[i][2]][a[i][1]%2]++;
        r=i;
        while(r<k-1&&a[r+1][0]==a[r][0]){
            r++;
            c[a[r][2]][a[r][1]%2]++;
        }
        if(c[0][0]+c[1][1]==0){
            leftR--;
        }
        else if(c[1][0]+c[0][1]==0){
            leftR--;
        }
        else{
            ok=false;
        }
        i=r+1;
    }
    if(ok) ans=binpow(2,leftR);
    ok=true;
    for(ll i=0;i<k;){
        memset(c,0,sizeof c);
        c[b[i][2]][b[i][1]%2]++;
        r=i;
        while(r<k-1&&b[r+1][0]==b[r][0]){
            r++;
            c[b[r][2]][b[r][1]%2]++;
        }
        if(c[0][0]+c[1][1]==0){
            leftC--;
        }
        else if(c[1][0]+c[0][1]==0){
            leftC--;
        }
        else{
            ok=false;
        }
        i=r+1;
    }
    if(ok) ans=(ans+binpow(2,leftC))%mod;
    memset(c,0,sizeof c);
    for(ll i=0;i<k;i++){
        c[a[i][2]][(a[i][0]+a[i][1])%2]++;
    }
    if(c[0][0]+c[1][1]==0){
        ans--;
    }
    if(c[0][1]+c[1][0]==0){
        ans--;
    }
    if(ans<0) ans+=mod;
    cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 34 ms 5980 KB Output is correct
17 Correct 34 ms 6120 KB Output is correct
18 Correct 34 ms 5980 KB Output is correct
19 Correct 36 ms 6092 KB Output is correct
20 Correct 40 ms 6096 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 34 ms 5980 KB Output is correct
17 Correct 34 ms 6120 KB Output is correct
18 Correct 34 ms 5980 KB Output is correct
19 Correct 36 ms 6092 KB Output is correct
20 Correct 40 ms 6096 KB Output is correct
21 Correct 34 ms 6380 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 34 ms 6288 KB Output is correct
24 Correct 34 ms 6236 KB Output is correct
25 Correct 34 ms 6232 KB Output is correct
26 Correct 31 ms 6040 KB Output is correct
27 Correct 31 ms 5980 KB Output is correct
28 Correct 33 ms 5976 KB Output is correct
29 Correct 31 ms 5976 KB Output is correct
30 Correct 37 ms 7248 KB Output is correct