제출 #163344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163344		alishahali1382	Plus Minus (BOI17_plusminus)	C++14	100 / 100	161 ms	8056 KiB

plusminus

#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
int X[MAXN], Y[MAXN];
map<int, int> mp;
bool typ[MAXN];
char ch;

ll powmod(ll a, ll b){
	if (!b) return 1;
	if (b&1) return a*powmod(a*a%mod, b>>1)%mod;
	return powmod(a*a%mod, b>>1);
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int mark[2];
	mark[0]=mark[1]=1;
	
	cin>>n>>m>>k;
	for (int i=1; i<=k; i++){
		cin>>ch>>X[i]>>Y[i];
		typ[i]=(ch=='+');
		mark[(X[i]+Y[i]+typ[i])%2]=0;
	}
	ans-=mark[0]+mark[1];
	
	bool shit=1;
	for (int i=1; i<=k; i++){
		if (!mp.count(X[i])) mp[X[i]]=(Y[i]+typ[i])%2;
		else if (mp[X[i]]!=(Y[i]+typ[i])%2) shit=0;
	}
	if (shit) ans+=powmod(2, n-mp.size());
	
	mp.clear();
	shit=1;
	for (int i=1; i<=k; i++){
		if (!mp.count(Y[i])) mp[Y[i]]=(X[i]+typ[i])%2;
		else if (mp[Y[i]]!=(X[i]+typ[i])%2) shit=0;
	}
	if (shit) ans+=powmod(2, m-mp.size());
	
	ans+=mod;
	ans%=mod;
	cout<<ans<<'\n';
	
	return 0;
}

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