# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
71108 | 2018-08-24T06:59:37 Z | khohko | 구간 성분 (KOI15_interval) | C++17 | 1000 ms | 65152 KB |
#include <bits/stdc++.h> #pragma GCC optimize("O3") using namespace std; #define ll long long #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)(233)) #define MOD ((ll)(1e9+7)) #define EP ((double)(1e-9)) #define LG 21 #define mul(a,b) a=((a)*(b))%MOD using namespace std; string s,t; ll pw[ARRS]; unordered_map<ll,ll> mp; int main(){ #ifdef KHOKHO freopen("in.in","r",stdin); freopen("out.out","w",stdout); #endif cin>>s>>t; pw[0]=1; for(int i=1; i<500; i++)pw[i]=(pw[i-1]*HS)%MOD; ll pas=0; for(int i=0; i<s.size(); i++){ ll hs=0; for(int j=i; j<s.size(); j++){ hs+=pw[s[j]-'a'+1]; if(hs>MOD) hs-=MOD; mp[hs]=j-i+1; } } for(int i=0; i<t.size(); i++){ ll hs=0; for(int j=i; j<t.size(); j++){ hs+=pw[t[j]-'a'+1]; if(hs>MOD) hs-=MOD; pas=max(pas,mp[hs]); } } cout<<pas; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 356 KB | Output is correct |
3 | Correct | 2 ms | 392 KB | Output is correct |
4 | Correct | 5 ms | 852 KB | Output is correct |
5 | Correct | 5 ms | 852 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 91 ms | 8216 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 811 ms | 50148 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 243 ms | 50148 KB | Output is correct |
2 | Execution timed out | 1098 ms | 65152 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |