Submission #309864

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
309864	2020-10-04T18:54:19 Z	peuch	Palindromic Partitions (CEOI17_palindromic)	C++17	60 / 100	709 ms	131076 KB

palindromic

#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1e6 + 10;

int t;
int n;
string st1;
int cnt;

map<string, int> marc;

int main(){
	scanf("%d", &t);
	while(t--){
		cin >> st1;
		n = st1.size();
		string aux1 = "";
		string aux2 = "";
		int ans = 0;
		for(int i = 0; i < n / 2; i++){
			aux1 += st1[i];
			aux2 = st1[n - i - 1] + aux2;
			if(marc[aux1] == 0) marc[aux1] = ++cnt;
			if(marc[aux2] == 0) marc[aux2] = ++cnt;
			if(marc[aux1] == marc[aux2]) {
				ans += 2;
				aux1 = "";
				aux2 = "";
			}
		}
		if(n % 2 == 1) ans++;
		else if(aux1.size() != 0) ans++;
		printf("%d\n", ans);
	}
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |  scanf("%d", &t);
      |  ~~~~~^~~~~~~~~~

Subtask #1

15.0 / 15.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	223 ms	38928 KB	Output is correct
11	Correct	231 ms	73976 KB	Output is correct
12	Correct	42 ms	384 KB	Output is correct
13	Correct	9 ms	384 KB	Output is correct

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	223 ms	38928 KB	Output is correct
11	Correct	231 ms	73976 KB	Output is correct
12	Correct	42 ms	384 KB	Output is correct
13	Correct	9 ms	384 KB	Output is correct
14	Runtime error	709 ms	131076 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-