QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #190155 | #6851. Cyclically Isomorphic | masterhuang | WA | 8ms | 38352kb | C++20 | 1.1kb | 2023-09-28 13:52:59 | 2023-09-28 13:52:59 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
#define P pair<int,int>
#define fi first
#define se second
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
inline string rds()
{
string x="";char ch=getchar();
while(ch<'a'||ch>'z') ch=getchar();
while(ch>='a'&&ch<='z') x+=ch,ch=getchar();
return x;
}
inline int rd()
{
int x=0;char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=1e6+5,mod=998244353;
int n,m,q,pw[N],a[N];
string c[N];
inline int md(int x){return x>=mod?x-mod:x;}
int main()
{
n=rd(),m=rd();for(int i=1;i<=n;i++) c[i]=rds();q=rd();
for(int i=pw[0]=1;i<=m;i++) pw[i]=28ll*pw[i-1]%mod;
for(int i=1;i<=n;i++)
{
int S=0;
for(int j=0;j<m;j++) S=(S+1ll*pw[m-1-j]*(c[i][j]-'a'+1))%mod;
a[i]=S;
for(int j=0;j<m-1;j++)
{
S=(S-1ll*pw[m-1]*(c[i][j]-'a'+1))%mod;S=md(S+mod);
S=(28ll*S+(c[i][j]-'a'+1))%mod;a[i]=min(a[i],S);
}
}
while(q--) puts((a[rd()]==a[rd()])?"Yes":"No");
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 38352kb
input:
5 10 10000 afcadffafeeebdfedfdafecfdbeecbcadfedcffaedecbacffedeccacfcbfbbdbcefbdefefebcbeacfbaafddbabcbfaeddaaefebbddafaaaaaedcbbdaafaffcbeeebfbbeedebabfbdbaceabfcccfedbdeafccbaffdeadbefbfeadbbedeeabbaafebaceeaeedbaddfecdefaabdbcfadadaebbdeedcfeeabbbdbcefdadbeecafcabbddddbcacadbbcddeddbbeecbdadefbaa...
output:
No No No Yes Yes No No No Yes No No Yes No No No No No No No Yes Yes Yes Yes Yes Yes No Yes No Yes No No No No Yes Yes No No Yes No No No No Yes No Yes No Yes No Yes Yes No No No No Yes No Yes Yes No No No No No Yes Yes No No Yes Yes No Yes Yes No No No No No No No Yes Yes Yes No Yes No Yes No No No...
result:
wrong answer 12th lines differ - expected: 'No', found: 'Yes'