Submission #2125225
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; /* <url:https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_b> 問題文============================================================ 問題文 すぬけ君は a、b、c の 3 種類の文字のみからなる文字列 S を持っています。 回文恐怖症のすぬけ君は S の文字を自由に並び替えて、 2 文字以上の回文を部分文字列として含まないようにしようと思いました。 これが可能かどうかを判定して下さい。 制約 1≤|S|≤10^5 S は a、b、c 以外の文字を含まない。 ================================================================= 解説============================================================= ================================================================ */ int main(void) { cin.tie(0); ios::sync_with_stdio(false); string S; cin >> S; int abc[3] = {}; for(int i = 0; i < S.length();i++){ abc[S[i]-'a']++; } int Min = min({abc[0],abc[1],abc[2]}); abc[0] -= Min; abc[1] -= Min; abc[2] -= Min; if(abc[0] >= 2 || abc[1] >= 2 || abc[2] >= 2) cout << "NO" << endl; else cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Palindrome-phobia |
User | vjudge4 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1325 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 512 KB |
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
01-11.txt | AC | 1 ms | 256 KB |
01-12.txt | AC | 1 ms | 256 KB |
01-13.txt | AC | 2 ms | 512 KB |
01-14.txt | AC | 2 ms | 512 KB |
01-15.txt | AC | 2 ms | 512 KB |
01-16.txt | AC | 1 ms | 256 KB |
01-17.txt | AC | 1 ms | 256 KB |
01-18.txt | AC | 1 ms | 256 KB |
01-19.txt | AC | 1 ms | 256 KB |
01-20.txt | AC | 1 ms | 256 KB |
01-21.txt | AC | 1 ms | 256 KB |
01-22.txt | AC | 1 ms | 256 KB |
01-23.txt | AC | 1 ms | 256 KB |
01-24.txt | AC | 1 ms | 256 KB |
01-25.txt | AC | 1 ms | 256 KB |
01-26.txt | AC | 1 ms | 256 KB |
01-27.txt | AC | 2 ms | 512 KB |
01-28.txt | AC | 2 ms | 512 KB |
01-29.txt | AC | 2 ms | 512 KB |
01-30.txt | AC | 2 ms | 512 KB |
01-31.txt | AC | 2 ms | 512 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |