oj.uz

답안 #71149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71149 2018-08-24T07:21:39 Z khohko 구간 성분 (KOI15_interval) C++17
61 / 100
 1000 ms 45664 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define MAX ((ll)(1e12+100))
#define MX ((ll)(1e6+100))
#define ARRS ((ll)(2e6+100))
#define HS ((ll)(1049))
#define MOD ((ll)(1000000861))
#define EP ((double)(1e-9))
#define LG 21
#define mul(a,b) a=((a)*(b))%MOD
using namespace std;

string s,t;

ll pw[50][2000];
set<ll> mp[2000];
ll ct[50];

int main(){
	#ifdef KHOKHO
		freopen("in.in","r",stdin);
		freopen("out.out","w",stdout);
	#endif
	cin>>s>>t;
	for(int i=0; i<40; i++)
		for(int j=0; j<1600; j++)
			pw[i][j]=(((ll)rand()<<48ll)+((ll)rand()<<32ll)+((ll)rand()<<16ll)+(ll)rand());
	int pas=0;
	for(int i=0; i<s.size(); i++){
		ll hs=0;
		for(int i=0; i<40; i++)ct[i]=0;
		for(int j=i; j<s.size(); j++){
			hs^=pw[s[j]-'a'][ct[s[j]-'a']++];
			mp[j-i].insert(hs);
		//	mp[hs]=j-i+1;
		}
	}

	for(int i=0; i<t.size(); i++){
		ll hs=0;
		for(int i=0; i<40; i++)ct[i]=0;
		for(int j=i; j<t.size(); j++){
			hs^=pw[t[j]-'a'][ct[t[j]-'a']++];
			if(mp[j-i].find(hs)!=mp[j-i].end())
				pas=max(pas,j-i+1);
		}
	}

	cout<<pas;


}

Compilation message

interval.cpp: In function 'int main()':
interval.cpp:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<s.size(); i++){
               ~^~~~~~~~~
interval.cpp:37:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=i; j<s.size(); j++){
                ~^~~~~~~~~
interval.cpp:44:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<t.size(); i++){
               ~^~~~~~~~~
interval.cpp:47:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=i; j<t.size(); j++){
                ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1016 KB Output is correct
2 Correct 6 ms 1160 KB Output is correct
3 Correct 9 ms 1180 KB Output is correct
4 Correct 8 ms 1340 KB Output is correct
5 Correct 7 ms 1388 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 4844 KB Output is correct
2 Correct 74 ms 5764 KB Output is correct
3 Correct 17 ms 5764 KB Output is correct
4 Correct 8 ms 5764 KB Output is correct
5 Correct 132 ms 6552 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 836 ms 22824 KB Output is correct
2 Correct 725 ms 23724 KB Output is correct
3 Correct 941 ms 23724 KB Output is correct
4 Correct 867 ms 23724 KB Output is correct
5 Correct 818 ms 23724 KB Output is correct
6 Correct 953 ms 23724 KB Output is correct
7 Correct 857 ms 23724 KB Output is correct
8 Correct 797 ms 23724 KB Output is correct
9 Correct 844 ms 23744 KB Output is correct
10 Correct 826 ms 23744 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 379 ms 23744 KB Output is correct
2 Execution timed out 1066 ms 45664 KB Time limit exceeded
3 Halted 0 ms 0 KB -