oj.uz

Submission #310385

# Submission time Handle Problem Language Result Execution time Memory
310385 2020-10-06T19:33:01 Z pedroslrey Palindromic Partitions (CEOI17_palindromic) C++17
60 / 100
 10000 ms 6268 KB 
#include <bits/stdc++.h>

using namespace std;

#define debug(args...) //fprintf(stderr, args)

const int MAXN = 1e6 + 10;

char xs[MAXN];

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%s", xs);
		int n = strlen(xs);

		string s = "";
		string t = "";
		int ans = 0;

		for (int i = 0; i < n / 2; ++i) {
			s += xs[i];
			t = xs[n - i - 1] + t;

			if (s == t) {
				ans += 2;
				s.clear();
				t.clear();
			}
		}
		if (n % 2 == 1 || s.size() != 0) ans++;
		printf("%d\n", ans);

	}
}

Compilation message

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

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Execution timed out 10018 ms 6268 KB Time limit exceeded
15 Halted 0 ms 0 KB -