oj.uz

답안 #1066585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066585 2024-08-20T02:45:31 Z 12345678 Plus Minus (BOI17_plusminus) C++17
100 / 100
 87 ms 16720 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5, mod=1e9+7;

ll n, m, k, x[nx], y[nx], szn, szm, res;
char c[nx];
map<ll, ll> mpx, mpy;
set<ll> s;

ll binpow(ll a, ll b)
{
    if (b==0) return 1;
    ll tmp=binpow(a, b/2);
    if (b%2) return (((tmp*tmp)%mod)*a)%mod;
    else return (tmp*tmp)%mod;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k;
    for (int i=1; i<=k; i++)
    {
        cin>>c[i]>>x[i]>>y[i];
        if (c[i]=='+') s.insert((x[i]+y[i])%2);
        else s.insert((x[i]+y[i]+1)%2);
        if (c[i]=='+') mpx[x[i]]|=(1<<(y[i]%2));
        else mpx[x[i]]|=(1<<((y[i]+1)%2));
        if (c[i]=='+') mpy[y[i]]|=(1<<(x[i]%2));
        else mpy[y[i]]|=(1<<((x[i]+1)%2));
    }
    szn=n-mpx.size();
    for (auto [_, t]:mpx) if (t==3) szn=-1;
    if (szn!=-1) res=(res+binpow(2, szn));
    szm=m-mpy.size();
    for (auto [_, t]:mpy) if (t==3) szm=-1;
    if (szm!=-1) res=(res+binpow(2, szm));
    res=(res-(2-s.size())+mod)%mod;
    cout<<res;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 344 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 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 344 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 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 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 23 ms 3092 KB Output is correct
17 Correct 25 ms 3164 KB Output is correct
18 Correct 23 ms 3156 KB Output is correct
19 Correct 24 ms 3152 KB Output is correct
20 Correct 23 ms 3168 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 344 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 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 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 23 ms 3092 KB Output is correct
17 Correct 25 ms 3164 KB Output is correct
18 Correct 23 ms 3156 KB Output is correct
19 Correct 24 ms 3152 KB Output is correct
20 Correct 23 ms 3168 KB Output is correct
21 Correct 64 ms 10832 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 66 ms 10836 KB Output is correct
24 Correct 69 ms 10832 KB Output is correct
25 Correct 67 ms 10836 KB Output is correct
26 Correct 70 ms 13904 KB Output is correct
27 Correct 70 ms 13972 KB Output is correct
28 Correct 69 ms 14040 KB Output is correct
29 Correct 69 ms 14040 KB Output is correct
30 Correct 87 ms 16720 KB Output is correct