oj.uz

답안 #58834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58834 2018-07-19T15:44:36 Z gs18115 구간 성분 (KOI15_interval) C++14
0 / 100
 18 ms 656 KB 
#include<iostream>
#include<set>
using namespace std;
typedef long long LL;
set<LL>S;
char A[9999],B[9999];
LL Al,Bl,i,j,k;
LL H[30]={2,
7,
11,
47,
263,
701,
2017,
5333,
9059,
16339,
28183,
46811,
66449,
79139,
99023,
3434983,
32758927,
273598275,
783265898,
2147483647,
8590123453LL,
36072100141LL,
928635896239LL,
2839728935982LL,
273956289356923LL,
237589237958623293LL};
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>A>>B;
    for(Al=0;A[Al];Al++);
    for(Bl=0;B[Bl];Bl++);
    for(i=min(Al,Bl);i>0;i--)
    {
        S.clear();
        k=0;
        for(j=0;j<i;j++)
            k+=H[A[j]-97];
        S.insert(k);
        for(j=0;j<Al-i;j++)
        {
            k+=H[A[j+i]-97]-H[A[j]-97];
            S.insert(k);
        }
        k=0;
        for(j=0;j<i;j++)
            k+=H[B[j]-97];
        if(S.find(k)!=S.end())
        {
            cout<<i<<endl;
            return 0;
        }
        for(j=0;j<Bl-i;j++)
        {
            k+=H[B[j+i]-97]-H[B[j]-97];
            if(S.find(k)!=S.end())
            {
                cout<<i<<endl;
                return 0;
            }
        }
    }
    cout<<0<<endl;
    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 3 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Incorrect 4 ms 568 KB Output isn't correct

Subtask #2
0 / 23.0

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

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 656 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 656 KB Output isn't correct
2 Halted 0 ms 0 KB -