Submission #18112

# Submission time Handle Problem Language Result Execution time Memory
18112 2016-01-21T06:02:15 Z chan492811 구간 성분 (KOI15_interval) C++
61 / 100
1000 ms 2116 KB
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int n,m,res;
char arr1[1510],arr2[1510];
vector<int> vt(26);
map <vector <int> ,bool> mp;
void vector_init(){
    int i;
    for(i=0;i<26;i++) vt[i]=0;
}
void init(int a){
    int i;
    for(i=0;i<a;i++) vt[arr1[i]-'a']++; mp[vt]=1;
    for(;i<n;i++){
        vt[arr1[i]-'a']++; vt[arr1[i-a]-'a']--; mp[vt]=1;
    }
}
void iscan(int a){
    int i;
    for(i=0;i<a;i++) vt[arr2[i]-'a']++; if(mp[vt]==1){ res=a; return; }
    for(;i<m;i++){
        vt[arr2[i]-'a']++; vt[arr2[i-a]-'a']--;
        if(mp[vt]==1){ res=a; return; }
    }
}
int main(){
    int i,j;
    scanf("%s %s",arr1,arr2); n=strlen(arr1); m=strlen(arr2);
    for(i=1;i<=min(n,m);i++){
        init(i); vector_init();
        iscan(i); vector_init();
        mp.clear();
    }
    printf("%d",res);
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1588 KB Output is correct
2 Correct 0 ms 1588 KB Output is correct
3 Correct 0 ms 1588 KB Output is correct
4 Correct 5 ms 1588 KB Output is correct
5 Correct 4 ms 1588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 93 ms 1720 KB Output is correct
2 Correct 65 ms 1588 KB Output is correct
3 Correct 15 ms 1588 KB Output is correct
4 Correct 8 ms 1588 KB Output is correct
5 Correct 104 ms 1720 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 453 ms 1852 KB Output is correct
2 Correct 488 ms 1852 KB Output is correct
3 Correct 480 ms 1852 KB Output is correct
4 Correct 454 ms 1852 KB Output is correct
5 Correct 474 ms 1852 KB Output is correct
6 Correct 462 ms 1852 KB Output is correct
7 Correct 488 ms 1852 KB Output is correct
8 Correct 481 ms 1852 KB Output is correct
9 Correct 487 ms 1852 KB Output is correct
10 Correct 484 ms 1852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 176 ms 1588 KB Output is correct
2 Correct 971 ms 1984 KB Output is correct
3 Correct 925 ms 1984 KB Output is correct
4 Correct 251 ms 1588 KB Output is correct
5 Execution timed out 1000 ms 2116 KB Program timed out