QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#666888 | #7900. Gifts from Knowledge | dyfhpu | Compile Error | / | / | C++17 | 1.0kb | 2024-10-22 20:19:34 | 2024-10-22 20:19:45 |
Judging History
This is the latest submission verdict.
- [2024-10-22 20:19:45]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2024-10-22 20:19:34]
- Submitted
answer
#include <iostream>
using namespace std;
typedef pair<int, int> PII;
const int mod=1e9+7;
const int N = 1000010;
int p[N];
long long power(int a, int b){
long long res = 1;
while (b){
if (b & 1) res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
void solve()
{
int r,c,ans=0,a[N],b[N];
cin>>r>>c;
string s;
for(int i=1;i<=r;i++) p[i]=i,a[i]=0,b[i]=0;
for(int i=1;i<=r;i++) {
cin>>s;
s=" "+s;
for(int j=1;j<=c;j++) {
if(s[j]=='1') {
a[j]++;a[c-j+1]++;
if(a[j]>2||a[c-j+1]>2) {
cout<<0<<endl;
return ;
}
if(b[j]==0&&b[c-j+1]==0) {
b[j]=i;
b[c-j+1]=i;
}
else {
p[y]=x;
}
}
}
}
for(int i=1;i<=r;i++) {
if(p[i]==i) ans++;
p[i]=0;
}
cout<<power(2,ans)<<endl;
}
int main()
{
int t = 1;
cin >> t;
std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
while (t--)
solve();
return 0;
}
Details
answer.code: In function ‘void solve()’: answer.code:46:43: error: ‘y’ was not declared in this scope 46 | p[y]=x; | ^ answer.code:46:46: error: ‘x’ was not declared in this scope 46 | p[y]=x; | ^