oj.uz

답안 #47239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47239 2018-04-29T13:00:07 Z marvenlee 회문 (APIO14_palindrome) C++14
8 / 100
 1000 ms 1432 KB 
#include <iostream>
#include <string>
using namespace std;

int main()
{
    int maxans=0;
    int subans=0;
    string s;
    cin >> s;
    for(int i=0;i<s.length();i++)
    {
        for(int j=s.length()-1;j>=i;j--)
        {
            subans=0;
            int start=i,last=j,state=0;
            while(start<=last)
            {
                if(s[start]!=s[last])
                {
                    state=1;
                    break;
                }
                start++;last--;
            }
            if(state == 0)
            {
                string s2= s.substr(i,j-i+1);
                subans =s2.length();
                int finaloccur = s.rfind(s2);
                int countoccur=1;
                int found=-1;
                while(s.find(s2,found+1)!=finaloccur)
                {
                    countoccur+=1;
                    found =s.find(s2,found+1);
                }
                subans*=countoccur;
                if(subans>maxans)maxans=subans;
            }
        }
    }
    cout << maxans;
    return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:11:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.length();i++)
                 ~^~~~~~~~~~~
palindrome.cpp:33:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(s.find(s2,found+1)!=finaloccur)
                       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 540 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 576 KB Output is correct
12 Correct 2 ms 576 KB Output is correct
13 Correct 2 ms 576 KB Output is correct
14 Correct 2 ms 576 KB Output is correct
15 Correct 3 ms 576 KB Output is correct
16 Correct 2 ms 576 KB Output is correct
17 Correct 2 ms 576 KB Output is correct
18 Correct 2 ms 576 KB Output is correct
19 Correct 4 ms 576 KB Output is correct
20 Correct 5 ms 576 KB Output is correct
21 Correct 2 ms 576 KB Output is correct
22 Correct 2 ms 576 KB Output is correct
23 Correct 12 ms 600 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 12 ms 628 KB Output is correct
26 Correct 2 ms 628 KB Output is correct
27 Correct 2 ms 628 KB Output is correct
28 Correct 4 ms 628 KB Output is correct
29 Correct 2 ms 628 KB Output is correct
30 Correct 2 ms 628 KB Output is correct
31 Correct 2 ms 628 KB Output is correct
32 Correct 2 ms 628 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1055 ms 1432 KB Time limit exceeded
2 Halted 0 ms 0 KB -