이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
#define int li
int power(int a, int n)
{
li c=1;
while (n)
{
if (n&1) (c*=a)%=mod;
a=(li)a*a%mod,n>>=1;
}
return c;
}
bool nemozerow=false;
bool nemozecol=false;
map<int,bool> row;
map<int,bool> col;
main()
{
FAST;
int n,m,k; cin>>n>>m>>k;
while (k--)
{
char signe;
int y,x; cin>>signe>>y>>x;
bool booligne=(signe=='+')^(y&1)^(x&1);
if (row.count(y) && booligne!=row[y]) nemozerow=true;
if (col.count(x) && booligne!=col[x]) nemozecol=true;
row[y]=booligne,col[x]=booligne;
}
if (nemozerow && nemozecol) return cout<<0,0;
int ans=0;
if (!nemozerow)
{
(ans+=power(2,n-(int)row.size()))%=mod;
bool isparan=false,isneparan=false;
for (auto it : row) if (it.yy) isparan=true; else isneparan=true;
if (!isparan || !isneparan) ans--;
}
if (!nemozecol)
{
(ans+=power(2,m-(int)col.size()))%-mod;
}
cout<<ans<<"\n";
}
//Note to self: Check for overflow
/*
2 2 4
+ 1 1
+ 2 2
- 1 2
- 2 1
*/
컴파일 시 표준 에러 (stderr) 메시지
plusminus.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
55 | main()
| ^~~~
plusminus.cpp: In function 'int main()':
plusminus.cpp:82:42: warning: value computed is not used [-Wunused-value]
82 | (ans+=power(2,m-(int)col.size()))%-mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |