oj.uz

답안 #578972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578972 2022-06-18T09:00:28 Z web Palindromic Partitions (CEOI17_palindromic) C++17
60 / 100
 10000 ms 8888 KB 
#include <iostream>
#include <vector>

using namespace std;

bool equalStr(string& s, int p1, int p2, int ctr)
{
    if(s[p1] != s[p2] || s[p1+ctr] != s[p2+ctr] )
        return false;
    return s.substr(p1, ctr+1) == s.substr(p2, ctr+1);
}
int main()
{
    int t; cin>>t;

    while(t--)
    {
        string s; cin>>s;
        int ptr1 = 0, ptr2= s.length() -1;
        long long res = 0;
        int ctr = 0;
        while(ptr1 <= ptr2)
        {
            
            if(s[ptr1] == s[ptr2])
            {
                if(equalStr(s, ptr1, ptr2, ctr))
                {
                    res++;
                    if(ptr1 != ptr2)
                        res++;
                    ptr1 += ctr+1;
                    ptr2--;
                    ctr =0;
                }
                else
                {
                    ptr2--;
                    ctr++;
                }
            }
            else
            {
                ptr2--;
                ctr++;
            }
        }   
        cout<<res<<endl;    
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 3 ms 212 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 294 ms 8888 KB Output is correct
15 Execution timed out 10086 ms 6252 KB Time limit exceeded
16 Halted 0 ms 0 KB -