제출 #309866

#제출 시각아이디문제언어결과실행 시간메모리
309866peuchPalindromic Partitions (CEOI17_palindromic)C++17
60 / 100
697 ms131076 KiB
#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;
		cnt = 0;
		marc.clear();
		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);
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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);
      |  ~~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...