제출 #208541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
208541		eriksuenderhauf	Plus Minus (BOI17_plusminus)	C++11	100 / 100	66 ms	3576 KiB

plusminus

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e5 + 5;
const double eps = 1e-9;
pair<pii,int> a[MAXN];
ll n, m;
int fl = 0, k;

ll pw(ll a, ll b) {
    ll ret = 1;
    while (b > 0) {
        if (b & 1)
            ret = (ret * a) % MOD, b--;
        else
            a = (a * a) % MOD, b /= 2ll;
    }
    return ret;
}

ll solve() {
    sort(a, a + k);
    ll cnt = 0;
    for (int i = 0; i < k; i++) {
        int j = i;
        while (j < k && a[i].fi.fi == a[j].fi.fi)
            j++;
        for (int l = i + 1; l < j; l++) {
            if ((a[l].fi.se + a[l].se) % 2 == (a[i].fi.se + a[i].se) % 2)
                continue;
            fl = 1;
            return 0;
        }
        cnt++;
        i = j - 1;
    }
    return pw(2, n - cnt);
}

int main() {
    scanf("%I64d %I64d %d", &n, &m, &k);
    for (int i = 0; i < k; i++) {
        char c;
        scanf(" %c %d %d", &c, &a[i].fi, &a[i].fi.se);
        if (c == '-')
            a[i].se = 1;
        else
            a[i].se = 0;
    }
    ll ans = solve();
    swap(n, m);
    for (int i = 0; i < k; i++)
        swap(a[i].fi.fi, a[i].fi.se);
    ans = (ans + solve()) % MOD;
    if (!fl) {
        if (k)
            ans = (ans - 1 + MOD) % MOD;
        else
            ans = (ans - 2 + MOD) % MOD;
    }
    printf("%I64d\n", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

plusminus.cpp: In function 'int main()':
plusminus.cpp:70:39: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
     scanf("%I64d %I64d %d", &n, &m, &k);
                             ~~        ^
plusminus.cpp:70:39: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll* {aka long long int*}' [-Wformat=]
plusminus.cpp:73:53: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'std::pair<int, int>*' [-Wformat=]
         scanf(" %c %d %d", &c, &a[i].fi, &a[i].fi.se);
                                                     ^
plusminus.cpp:90:26: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
     printf("%I64d\n", ans);
                          ^
plusminus.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%I64d %I64d %d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plusminus.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c %d %d", &c, &a[i].fi, &a[i].fi.se);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 42 / 42
• Subtask 3: 46 / 46