oj.uz

Submission #48816

# Submission time Handle Problem Language Result Execution time Memory
48816 2018-05-19T04:45:38 Z leehosu01 구간 성분 (KOI15_interval) C++17
30 / 100
 1000 ms 1592 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string A,B;
bool Sh(ll len)
{

    map<int,int>im;
    set<map<int,int> > inA;
    int i;
    for(i=0;i<len;i++)im[A[i]]++;
    inA.insert(im);
    for(i=len;i<A.size();i++)
    {
        im[A[i]]++;
        if(--im[A[i-len]]==0)
            im.erase(A[i-len]);
        inA.insert(im);
    }
    im.clear();
    for(i=0;i<len;i++)im[B[i]]++;
        if(inA.find(im)!=inA.end())return 1;
    for(i=len;i<B.size();i++)
    {
        im[B[i]]++;
        if(--im[B[i-len]]==0)
            im.erase(B[i-len]);
        if(inA.find(im)!=inA.end())return 1;
    }
    return 0;
}
int main()
{
    cin>>A>>B;
    int l=1,m,lm=0,r=min((int)A.size(),(int)B.size());
    for(m=1;m<=r;m++)
        if(Sh(m))lm=m;
  /*  while(l<r)
    {

        m=l+r>>1;
        if(Sh(m))lm=m,l=m+1;
        else r=m-1;
    }*/
    cout<<lm;
}

Compilation message

interval.cpp: In function 'bool Sh(ll)':
interval.cpp:13:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=len;i<A.size();i++)
               ~^~~~~~~~~
interval.cpp:23:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=len;i<B.size();i++)
               ~^~~~~~~~~
interval.cpp: In function 'int main()':
interval.cpp:35:9: warning: unused variable 'l' [-Wunused-variable]
     int l=1,m,lm=0,r=min((int)A.size(),(int)B.size());
         ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 480 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 11 ms 624 KB Output is correct
5 Correct 8 ms 624 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 892 KB Output is correct
2 Correct 79 ms 892 KB Output is correct
3 Correct 18 ms 892 KB Output is correct
4 Correct 8 ms 892 KB Output is correct
5 Correct 161 ms 892 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 821 ms 1256 KB Output is correct
2 Execution timed out 1083 ms 1592 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 1592 KB Output is correct
2 Execution timed out 1070 ms 1592 KB Time limit exceeded
3 Halted 0 ms 0 KB -