# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
321009 | 2020-11-10T15:52:09 Z | tjdgus4384 | 구간 성분 (KOI15_interval) | C++14 | 421 ms | 131076 KB |
#include<bits/stdc++.h> using namespace std; string s1, s2; vector<int> v(30, 0), t(30, 0); set<vector<int> > s; int main(){ cin >> s1 >> s2; for(int i = 1;i <= s1.size();i++){ for(int j = 0;j < i;j++){ v[s1[j]-'a']++; } s.insert(v); for(int j = i;j < s1.size();j++){ v[s1[j-i]-'a']--; v[s1[j]-'a']++; s.insert(v); } for(int j = 0;j < 30;j++) v[j] = 0; } for(int i = s2.size();i > 0;i--){ for(int j = 0;j < i;j++){ t[s2[j]-'a']++; } if(s.count(t)){ printf("%d", i); return 0; } for(int j = i;j < s2.size();j++){ t[s2[j-i]-'a']--; t[s2[j]-'a']++; if(s.count(t)){ printf("%d", i); return 0; } } for(int j = 0;j < 30;j++) t[j] = 0; } printf("0"); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 3 ms | 1132 KB | Output is correct |
5 | Correct | 3 ms | 1132 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 63 ms | 14692 KB | Output is correct |
2 | Correct | 66 ms | 18404 KB | Output is correct |
3 | Correct | 19 ms | 1132 KB | Output is correct |
4 | Correct | 16 ms | 364 KB | Output is correct |
5 | Correct | 86 ms | 21476 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 393 ms | 86756 KB | Output is correct |
2 | Correct | 402 ms | 89956 KB | Output is correct |
3 | Correct | 400 ms | 88692 KB | Output is correct |
4 | Correct | 370 ms | 86756 KB | Output is correct |
5 | Correct | 392 ms | 89700 KB | Output is correct |
6 | Correct | 367 ms | 87140 KB | Output is correct |
7 | Correct | 409 ms | 89572 KB | Output is correct |
8 | Correct | 392 ms | 89720 KB | Output is correct |
9 | Correct | 392 ms | 89832 KB | Output is correct |
10 | Correct | 387 ms | 89316 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 219 ms | 34532 KB | Output is correct |
2 | Runtime error | 421 ms | 131076 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |