oj.uz

답안 #732933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732933 2023-04-29T16:25:01 Z vjudge1 Trener (COCI20_trener) C++17
22 / 110
 6 ms 468 KB 
#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

const int x=29;

int p[1505];

int add(int x,int y){
	return ((x+y)%MOD+MOD)%MOD;
}

int mul(int x,int y){
	return (x*y)%MOD;
}

int fp(int a,int b){
	if(b==0)return 1;
	int t=fp(a,b/2);
	t=(t*t)%MOD;
	if(b%2)return (t*a)%MOD;
	return t;
}

int32_t main(){
	fast;
	p[0]=1;
	for(int i=1;i<=1500;i++)p[i]=mul(p[i-1],x);
	int n,m;
	cin>>n>>m;
	map<int,int>mp;
	for(int i=0;i<n;i++){
		map<int,int>mp2;
		for(int j=0;j<m;j++){
			string s;
			cin>>s;
			int a=0;
			for(int k=0;k<s.size()-1;k++){
				a=add(a,mul(s[k]-'a'+1,p[k]));
			}
			if(i==0){
				mp2[add(a,mul(s.back()-'a'+1,p[(int)s.size()-1]))]++;
				continue;
			}
			mp2[add(a,mul(s.back()-'a'+1,p[(int)s.size()-1]))]+=mp[a]+mp[add(mul(s.back()-'a'+1,p[(int)s.size()-2]),mul(fp(x,MOD-2),add(a,-(s[0]-'a'+1))))];
			if(a==add(mul(s.back()-'a'+1,p[(int)s.size()-2]),mul(fp(x,MOD-2),add(a,-(s[0]-'a'+1))))){
				mp2[add(a,mul(s.back()-'a'+1,p[(int)s.size()-1]))]-=mp[a];
			}
		}
		mp.clear();
		mp=mp2;
	}
	int ans=0;
	for(auto i:mp)ans+=i.ss;
	cout<<ans<<endl;
}

Compilation message

trener.cpp: In function 'int32_t main()':
trener.cpp:45:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |    for(int k=0;k<s.size()-1;k++){
      |                ~^~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 5 ms 468 KB Output is correct
4 Incorrect 3 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Incorrect 3 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -