oj.uz

답안 #447494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447494 2021-07-26T15:01:51 Z Khizri Palindromic Partitions (CEOI17_palindromic) C++17
60 / 100
 10000 ms 4080 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=n;
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
int t=1,ans;
void solve(){
	char s[mxn];
	scanf("%s",&s);
	int l=0,r=strlen(s)-1;
	string a="",b="";
	ans=0;
	while(l<r){
		map<string,int>mp;
		a+=s[l];
		b=s[r]+b;
		mp[a]++;
		mp[b]++;
		if(mp[a]==2){
			ans+=2;
			a="";
			b="";
		}
		l++,r--;
	}
	if(a.size()||b.size()||l==r){
		ans++;
	}
	printf("%d\n",ans);
}
int main(){
	//IOS;
	scanf("%d",&t);
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

palindromic.cpp: In function 'void solve()':
palindromic.cpp:46:10: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[1000005]' [-Wformat=]
   46 |  scanf("%s",&s);
      |         ~^  ~~
      |          |  |
      |          |  char (*)[1000005]
      |          char*
palindromic.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  scanf("%s",&s);
      |  ~~~~~^~~~~~~~~
palindromic.cpp: In function 'int main()':
palindromic.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |  scanf("%d",&t);
      |  ~~~~~^~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1228 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 1 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1228 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 1 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 21 ms 1396 KB Output is correct
11 Correct 17 ms 1412 KB Output is correct
12 Correct 13 ms 1264 KB Output is correct
13 Correct 8 ms 1228 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1228 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 1 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 21 ms 1396 KB Output is correct
11 Correct 17 ms 1412 KB Output is correct
12 Correct 13 ms 1264 KB Output is correct
13 Correct 8 ms 1228 KB Output is correct
14 Execution timed out 10082 ms 4080 KB Time limit exceeded
15 Halted 0 ms 0 KB -