Submission #5869926
Source Code Expand
#include <algorithm> #include <bits/stdc++.h> #include <climits> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> using namespace std; #define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X)) #define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(X)) #define all(X) (X).begin(), (X).end() #define pb push_back #define mp make_pair #define fi first #define sc second #define print(x) cout << x << endl typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vl; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const string YES = "YES"; const string NO = "NO"; char charElse(char c1, char c2) { set<char> chars; chars.insert('a'); chars.insert('b'); chars.insert('c'); chars.erase(c1); chars.erase(c2); return *chars.begin(); } bool solve_(char c1, char c2, map<char, ll> cnt) { char c3 = charElse(c1, c2); while (true) { if (cnt[c1] == 0) { break; } cnt[c1]--; if (cnt[c2] == 0) { break; } cnt[c2]--; if (cnt[c3] == 0) { break; } cnt[c3]--; } if (cnt[c1] == 0 && cnt[c2] == 0 && cnt[c3] == 0) { return true; } return false; } void solve(std::string S) { map<char, ll> cnt; rep(i, S.size()) { cnt[S[i]]++; } bool ans = false; for (char c1 = 'a'; c1 <= 'c'; c1++) { for (char c2 = 'a'; c2 <= 'c'; c2++) { if (c1 == c2) { continue; } ans = ans || solve_(c1, c2, cnt); } } if (ans) { print(YES); } else { print(NO); } } int main() { std::string S; std::cin >> S; solve(S); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Palindrome-phobia |
User | righttoleft1134 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1839 Byte |
Status | AC |
Exec Time | 10 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 | 2 ms | 256 KB |
01-11.txt | AC | 2 ms | 256 KB |
01-12.txt | AC | 3 ms | 256 KB |
01-13.txt | AC | 8 ms | 512 KB |
01-14.txt | AC | 6 ms | 512 KB |
01-15.txt | AC | 9 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 | 2 ms | 256 KB |
01-26.txt | AC | 2 ms | 256 KB |
01-27.txt | AC | 9 ms | 512 KB |
01-28.txt | AC | 9 ms | 512 KB |
01-29.txt | AC | 10 ms | 512 KB |
01-30.txt | AC | 5 ms | 512 KB |
01-31.txt | AC | 5 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 |