oj.uz

Submission #879196

# Submission time Handle Problem Language Result Execution time Memory
879196 2023-11-26T18:20:39 Z StefanSebez Plus Minus (BOI17_plusminus) C++14
100 / 100
 98 ms 6228 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
const int mod=1e9+7;
map<int,int>mapa;
ll Plus(ll a,ll b)
{
    a%=mod,b%=mod;
    ll x=a+b;x%=mod;return x;
}
ll Puta(ll a,ll b)
{
    a%=mod,b%=mod;
    ll x=a*b;x%=mod;return x;
}
ll Pow(ll a,ll b)
{
    if(b==0) return 1;
    ll x=Pow(a,b/2);
    if(b%2==0) return Puta(x,x);
    else return Puta(Puta(x,x),a);
}
int main()
{
    int n,m,k;scanf("%i%i%i",&n,&m,&k);
    pair<pair<int,int>,int>a[k+10];
    bool bul1=true,bul2=true;
    for(int i=1;i<=k;i++)
    {
        char c;cin>>c;
        int t=1;if(c=='+') t=2;
        scanf("%i%i",&a[i].fi.fi,&a[i].fi.se);
        if((a[i].fi.fi+a[i].fi.se+t-1)%2==0) bul1=false;
        else bul2=false;
        a[i].se=t;
    }
    ll res=0;
    sort(a+1,a+k+1);
    bool bul=true;
    int ct=n;
    for(int i=1;i<=k;i++)
    {
        int t=((a[i].fi.se-1)%2+a[i].se-1)%2+1;
        if((mapa[a[i].fi.fi]==1 && t==2) || (mapa[a[i].fi.fi]==2 && t==1)) bul=false;
        if(mapa[a[i].fi.fi]==0) ct--;
        mapa[a[i].fi.fi]=t;
    }
    //ll e=1;
    //for(int i=1;i<=ct;i++) e=Puta(e,2);
    if(bul) res=Plus(res,Pow(2,ct));
    for(int i=1;i<=k;i++)
    {
        swap(a[i].fi.fi,a[i].fi.se);
    }
    mapa.clear();
    sort(a+1,a+k+1);
    bul=true;
    ct=m;
    for(int i=1;i<=k;i++)
    {
        int t=((a[i].fi.se-1)%2+a[i].se-1)%2+1;
        if((mapa[a[i].fi.fi]==1 && t==2) || (mapa[a[i].fi.fi]==2 && t==1)) bul=false;
        if(mapa[a[i].fi.fi]==0) ct--;
        mapa[a[i].fi.fi]=t;
    }
    //printf("%i\n",ct);
    //e=1;
    //for(int i=1;i<=ct;i++) e=Puta(e,2);
    if(bul) res=Plus(res,Pow(2,ct));
    if(bul1==true) res--;
    if(bul2==true) res--;
    if(res<0) res+=mod;
    printf("%lld\n",res);
    return 0;
}

Compilation message

plusminus.cpp: In function 'int main()':
plusminus.cpp:27:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     int n,m,k;scanf("%i%i%i",&n,&m,&k);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~
plusminus.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         scanf("%i%i",&a[i].fi.fi,&a[i].fi.se);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 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 43 ms 1608 KB Output is correct
17 Correct 45 ms 1612 KB Output is correct
18 Correct 44 ms 1620 KB Output is correct
19 Correct 46 ms 1628 KB Output is correct
20 Correct 44 ms 1616 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 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 43 ms 1608 KB Output is correct
17 Correct 45 ms 1612 KB Output is correct
18 Correct 44 ms 1620 KB Output is correct
19 Correct 46 ms 1628 KB Output is correct
20 Correct 44 ms 1616 KB Output is correct
21 Correct 88 ms 4176 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 86 ms 4396 KB Output is correct
24 Correct 91 ms 4388 KB Output is correct
25 Correct 86 ms 4388 KB Output is correct
26 Correct 80 ms 5316 KB Output is correct
27 Correct 81 ms 5204 KB Output is correct
28 Correct 80 ms 5276 KB Output is correct
29 Correct 80 ms 5312 KB Output is correct
30 Correct 98 ms 6228 KB Output is correct