oj.uz

Submission #18416

# Submission time Handle Problem Language Result Execution time Memory
18416 2016-02-01T05:08:21 Z suhgyuho_william 구간 성분 (KOI15_interval) C++
61 / 100
 521 ms 131072 KB 
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>

using namespace std;

int N,M;
int a[1510],b[1510],tmp[1510];
char s[1510];
struct data{
	int a[26];

	bool operator<(const data x)const{
		int i;

		for(i=0; i<26; i++){
			if(x.a[i] != a[i]) return a[i] < x.a[i];
		}
		return false;
	}
}cnt1[1510],cnt2[1510];
data t;
map<data,bool> Map;

int main(){
	int i,j,k;
	int ans;
	//freopen("input.txt","r",stdin);

	scanf("%s",s);
	N = strlen(s);
	for(i=1; i<=N; i++) a[i] = s[i-1]-'a';
	scanf("%s",s);
	M = strlen(s);
	for(i=1; i<=M; i++) b[i] = s[i-1]-'a';
	if(N < M){
		for(i=1; i<=N; i++) tmp[i] = a[i];
		for(i=1; i<=M; i++) a[i] = b[i];
		for(i=1; i<=N; i++) b[i] = tmp[i];
		swap(N,M);
	}

	for(i=1; i<=N; i++){
		for(j=0; j<26; j++) cnt1[i].a[j] = cnt1[i-1].a[j];
		cnt1[i].a[a[i]]++;
	}
	for(i=1; i<=M; i++){
		for(j=0; j<26; j++) cnt2[i].a[j] = cnt2[i-1].a[j];
		cnt2[i].a[b[i]]++;
	}
	for(i=1; i<=M; i++){
		for(j=i; j<=M; j++){
			for(k=0; k<26; k++) t.a[k] = (cnt2[j].a[k]-cnt2[i-1].a[k]);
			Map[t] = true;
		}
	}
	ans = 0;
	for(i=N-1; i>=0; i--){
		for(j=1; j+i<=N; j++){
			for(k=0; k<26; k++) t.a[k] = (cnt1[j+i].a[k]-cnt1[j-1].a[k]);
			if(Map.find(t) != Map.end()){
				ans = i+1;
				break;
			}
		}
		if(ans != 0) break;
	}

	printf("%d\n",ans);

	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1544 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct
4 Correct 4 ms 2204 KB Output is correct
5 Correct 3 ms 2204 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 13424 KB Output is correct
2 Correct 69 ms 11048 KB Output is correct
3 Correct 35 ms 2732 KB Output is correct
4 Correct 24 ms 1544 KB Output is correct
5 Correct 115 ms 19100 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 73220 KB Output is correct
2 Correct 484 ms 75860 KB Output is correct
3 Correct 474 ms 75068 KB Output is correct
4 Correct 456 ms 73220 KB Output is correct
5 Correct 474 ms 75728 KB Output is correct
6 Correct 471 ms 73748 KB Output is correct
7 Correct 478 ms 75728 KB Output is correct
8 Correct 474 ms 75860 KB Output is correct
9 Correct 454 ms 75860 KB Output is correct
10 Correct 492 ms 75464 KB Output is correct

Subtask #4
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 27944 KB Output is correct
2 Memory limit exceeded 521 ms 131072 KB Memory limit exceeded
3 Halted 0 ms 0 KB -