oj.uz

답안 #857031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857031 2023-10-05T09:14:42 Z arashMLG Plus Minus (BOI17_plusminus) C++17
100 / 100
 84 ms 10404 KB 
#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

//https://quera.org/profile/4dykhk

typedef long long     ll;
typedef long double   ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N = 1e5 + 23;
const int sq = 450;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define F           first
#define S           second
#define pb          push_back
#define ms(x,y)     memset((x) , (y) , sizeof (x))
#define done        return cout<<endl , 0;
#define kill(x)     cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define pc(x)       __builtin_popcount(x)
#define ctz(x)      __builtin_ctz(x)
#define MinHeap(x)  priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x)  priority_queue<x, vector<x>>
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define int      ll

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

int n,m,k;
pair<int,pii> a[N];
map<int,int> mp;
bool tc= true;

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m>>k;
	if(k == 0 ){
		cout<<( (pw(2,n) + pw(2,m))%mod -2 + mod) %mod;
		done;
	}
	for(int i = 0 ;i < k ; i++) {
		//debug(i);
		char c; cin>>c;
		a[i].F = (c == '+');
		cin>>a[i].S.F >> a[i].S.S;
	}
	int s1=0;
	for(int i = 0;i < k; i++) {
		//debug(i);
		auto [x,y] = a[i].S;
		int v = a[i].F;
		if(mp[x] == 0) {
			s1++;
			mp[x] = (v ^ (y&1)) + 1;
		} else if((mp[x]-1) != (v ^(y&1)) ) {
			s1 = -1;
			break;
		}
	}
	int ans1=0;
	debug(n,s1);
	if(s1 == -1) {
		tc = false;
	} else {
		ans1 = pw(2,n-s1);
	}
	mp.clear();
	
	int s2=0;
	for(int i = 0;i < k; i++) {
		//debug(i);
		auto [x,y] = a[i].S;
		int v = a[i].F;
		if(mp[y] == 0) {
			s2++;
			mp[y] = (v ^ (x&1)) + 1;
		} else if((mp[y]-1) != (v ^(x&1)) ) {
			s2 = -1;
			break;
		}
	}
	int ans2=0;
	debug(m,s2);
	if(s2 == -1) {
		tc = false;
	} else {
		ans2 = pw(2,m-s2);
	}
	debug(ans1,ans2);
	cout<<((ans1 + ans2) % mod-tc+mod) % mod;
    done;
}

Compilation message

plusminus.cpp: In function 'int32_t main()':
plusminus.cpp:5:20: warning: statement has no effect [-Wunused-value]
    5 | #define debug(...) 69
      |                    ^~
plusminus.cpp:78:2: note: in expansion of macro 'debug'
   78 |  debug(n,s1);
      |  ^~~~~
plusminus.cpp:5:20: warning: statement has no effect [-Wunused-value]
    5 | #define debug(...) 69
      |                    ^~
plusminus.cpp:100:2: note: in expansion of macro 'debug'
  100 |  debug(m,s2);
      |  ^~~~~
plusminus.cpp:5:20: warning: statement has no effect [-Wunused-value]
    5 | #define debug(...) 69
      |                    ^~
plusminus.cpp:106:2: note: in expansion of macro 'debug'
  106 |  debug(ans1,ans2);
      |  ^~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 464 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 596 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 2804 KB Output is correct
17 Correct 11 ms 2908 KB Output is correct
18 Correct 11 ms 2796 KB Output is correct
19 Correct 31 ms 2904 KB Output is correct
20 Correct 32 ms 2908 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 464 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 596 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 2804 KB Output is correct
17 Correct 11 ms 2908 KB Output is correct
18 Correct 11 ms 2796 KB Output is correct
19 Correct 31 ms 2904 KB Output is correct
20 Correct 32 ms 2908 KB Output is correct
21 Correct 69 ms 7092 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 13 ms 3156 KB Output is correct
24 Correct 13 ms 3264 KB Output is correct
25 Correct 13 ms 3164 KB Output is correct
26 Correct 40 ms 7208 KB Output is correct
27 Correct 39 ms 6736 KB Output is correct
28 Correct 58 ms 7568 KB Output is correct
29 Correct 67 ms 8628 KB Output is correct
30 Correct 84 ms 10404 KB Output is correct