oj.uz

답안 #922595

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922595 2024-02-05T18:27:40 Z vjudge1 Palindromic Partitions (CEOI17_palindromic) C++11
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

class GFG {

public:
	// Check whether the string is palindrom or not.
	bool checkPalindrome(string& s)
	{
		int n = s.size();
		int i = 0, j = n - 1;
		while (i < j) {
			if (s[i] != s[j])
				return false;
			i++;
			j--;
		}
		return true;
	}
	// Recursive function which takes starting index idx
	// and generates all substrings starting at idx.
	// If substring generated is palindrome it adds to
	// current list and makes a recursive call for
	// remaining string.
	void Partition(vector<vector<string> >& res, string& s,
				int idx, vector<string>& curr)
	{
		// If we reach the end of string at the current list
		// to the result.
		if (idx == s.size()) {
			res.push_back(curr);
			return;
		}
		// Stores the current substring.
		string t;
		for (int i = idx; i < s.size(); i++) {
			t.push_back(s[i]);

			// Check whether the string is palindrome is
			// not.
			if (checkPalindrome(t)) {

				// Adds the string to current list
				curr.push_back(t);

				// Recursive call for the remaining string
				Partition(res, s, i + 1, curr);

				// Remove the string from the current
				// string.
				curr.pop_back();
			}
		}
	}
};
// Driver code
int main()
{
    int a = 0;
	GFG ob;
	// Stores all the partition
	vector<vector<string> > res;
	string s = "geeks";

	// Starting index of string
	int idx = 0;

	// Current list
	vector<string> curr;
	ob.Partition(res, s, idx, curr);
	for (auto& v : res) {
		for (auto& it : v) {
			a++;
		}
	}

    cout<<a;
	return 0;
}

Compilation message

palindromic.cpp: In member function 'void GFG::Partition(std::vector<std::vector<std::__cxx11::basic_string<char> > >&, std::string&, int, std::vector<std::__cxx11::basic_string<char> >&)':
palindromic.cpp:30:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   if (idx == s.size()) {
      |       ~~~~^~~~~~~~~~~
palindromic.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for (int i = idx; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
palindromic.cpp: In function 'int main()':
palindromic.cpp:72:14: warning: unused variable 'it' [-Wunused-variable]
   72 |   for (auto& it : v) {
      |              ^~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -