# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71147 | 2018-08-24T07:21:13 Z | khohko | 구간 성분 (KOI15_interval) | C++17 | 1000 ms | 43512 KB |
#include <bits/stdc++.h> #pragma GCC optimize("O3") using namespace std; #define ll int #define pb push_back #define fr first #define sc second #define MAX ((ll)(1e12+100)) #define MX ((ll)(1e6+100)) #define ARRS ((ll)(2e6+100)) #define HS ((ll)(1049)) #define MOD ((ll)(1000000861)) #define EP ((double)(1e-9)) #define LG 21 #define mul(a,b) a=((a)*(b))%MOD using namespace std; string s,t; ll pw[50][2000]; unordered_set<int> mp[2000]; ll ct[50]; int main(){ #ifdef KHOKHO freopen("in.in","r",stdin); freopen("out.out","w",stdout); #endif cin>>s>>t; for(int i=0; i<40; i++) for(int j=0; j<1600; j++) pw[i][j]=(((ll)rand()<<48ll)+((ll)rand()<<32ll)+((ll)rand()<<16ll)+(ll)rand()); int pas=0; for(int i=0; i<s.size(); i++){ ll hs=0; for(int i=0; i<40; i++)ct[i]=0; for(int j=i; j<s.size(); j++){ hs^=pw[s[j]-'a'][ct[s[j]-'a']++]; mp[j-i].insert(hs); // mp[hs]=j-i+1; } } for(int i=0; i<t.size(); i++){ ll hs=0; for(int i=0; i<40; i++)ct[i]=0; for(int j=i; j<t.size(); j++){ hs^=pw[t[j]-'a'][ct[t[j]-'a']++]; if(mp[j-i].find(hs)!=mp[j-i].end()) pas=max(pas,j-i+1); } } cout<<pas; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 760 KB | Output is correct |
2 | Correct | 6 ms | 868 KB | Output is correct |
3 | Correct | 7 ms | 948 KB | Output is correct |
4 | Correct | 7 ms | 1020 KB | Output is correct |
5 | Correct | 7 ms | 1032 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 63 ms | 4256 KB | Output is correct |
2 | Correct | 94 ms | 5032 KB | Output is correct |
3 | Correct | 14 ms | 5032 KB | Output is correct |
4 | Correct | 9 ms | 5032 KB | Output is correct |
5 | Correct | 74 ms | 5872 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 369 ms | 20924 KB | Output is correct |
2 | Correct | 370 ms | 21764 KB | Output is correct |
3 | Incorrect | 460 ms | 21764 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 203 ms | 21764 KB | Output is correct |
2 | Execution timed out | 1076 ms | 43512 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |