oj.uz

Submission #447363

# Submission time Handle Problem Language Result Execution time Memory
447363 2021-07-26T07:24:02 Z fuad27 Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 3868 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main () {
	int t;
	cin >> t;
	while(t--) {
		string s;
		cin >> s;
		int ans = 0, n = s.length();
		string l = "", r = "";
		for(int i = 0;i<n/2;i++) {
			l += s[i];
			r = s[n-i-1] + r;
			if(l == r){
				l = "";
				r = "";
				ans+=2;
			}
		}
		if(l.size() > 0 or n%2 == 1)ans++;
		cout<<ans<<endl;
	}
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 8 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 6 ms 304 KB Output is correct
13 Correct 4 ms 332 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 8 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 6 ms 304 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Execution timed out 10076 ms 3868 KB Time limit exceeded
15 Halted 0 ms 0 KB -