oj.uz

Submission #58839

# Submission time Handle Problem Language Result Execution time Memory
58839 2018-07-19T15:48:14 Z gs18115 구간 성분 (KOI15_interval) C++14
38 / 100
 200 ms 908 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]={5333,
9059,
16339,
28183,
46811,
66449,
79139,
99023,
3434983,
32758927,
273598275,
783265898,
2147483647,
8590123453LL,
36072100141LL,
928635896239LL,
2839728935982LL,
92738927398529LL,
273956289356923LL,
239875298375982LL,
3289572893758923LL,
9273487523645628LL,
37598237958232352LL,
82379562375623328LL,
237589237958623293LL,
2387429837598236234LL};
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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 4 ms 552 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 552 KB Output is correct
2 Incorrect 6 ms 564 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 704 KB Output is correct
2 Correct 101 ms 740 KB Output is correct
3 Correct 102 ms 740 KB Output is correct
4 Correct 109 ms 800 KB Output is correct
5 Correct 99 ms 800 KB Output is correct
6 Correct 82 ms 800 KB Output is correct
7 Correct 103 ms 800 KB Output is correct
8 Correct 98 ms 800 KB Output is correct
9 Correct 84 ms 864 KB Output is correct
10 Correct 90 ms 864 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 872 KB Output is correct
2 Correct 200 ms 908 KB Output is correct
3 Incorrect 41 ms 908 KB Output isn't correct
4 Halted 0 ms 0 KB -