結果
問題 | No.8061 uxs hxixtya pyuyn ixc hyixa kxuyn |
ユーザー | Ebishu |
提出日時 | 2020-03-11 22:35:14 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,397 bytes |
コンパイル時間 | 1,647 ms |
コンパイル使用メモリ | 176,132 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-16 04:22:23 |
合計ジャッジ時間 | 2,615 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | WA | - |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | WA | - |
testcase_15 | AC | 2 ms
6,816 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 2 ms
6,820 KB |
testcase_20 | AC | 2 ms
6,816 KB |
testcase_21 | AC | 2 ms
6,820 KB |
testcase_22 | AC | 2 ms
6,816 KB |
testcase_23 | AC | 2 ms
6,816 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; using lint = long long; #define low lower_bound #define upp upper_bound #define rep(i, n) for (lint (i) = 0; (i) < (n); ++(i)) #define Rep(i, n) for (lint (i) = (n); (i) >= 0; --(i)) #define all(vec) (vec).begin(), (vec).end() #define cend printf("\n"); #define prique(T) priority_queue<T, vector<T>, greater<T>> #define prique2(T) priority_queue<T> struct edge { lint to; lint cost; }; using P = pair<lint, lint>; using D = pair<double, double>; using mll = map<lint, lint>; //const lint mod = 998244353LL; const lint mod = 1000000007LL; const lint inf = 3LL * mod * mod; const double Pi = acos(-1.0); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } lint modpow(lint x, lint n, lint m) { lint ans = 1; while (n > 0) { if (n & 1) { ans *= x; if (m <= ans) ans %= m; } x *= x; if (m <= x) x %= m; n >>= 1; } return ans; } lint fact[3000000]; void f_init(lint n) { if (3000000 <= n) return; fact[0] = fact[1] = 1; for (lint i = 2; i <= n; ++i) { fact[i] = i * fact[i - 1]; if (mod <= fact[i]) fact[i] %= mod; } return; } lint comb(lint n, lint r) { if (n < r) return 0; if (n == r) return 1; lint ans = fact[n] * modpow(fact[n - r], mod - 2, mod) % mod * modpow(fact[r], mod - 2, mod) % mod; if (ans < 0) return ans + mod; return ans; } lint nck[1010][1010]; void comb(lint n) { rep(i, n + 1) { rep(j, i + 1) { if (j == 0 || i == j) nck[i][j] = 1; else nck[i][j] = nck[i - 1][j - 1] + nck[i - 1][j]; } } } lint gcd(lint a, lint b) { if (b == 0) return a; return gcd(b, a % b); } lint lcm(lint a, lint b) { return a / gcd(a, b) * b; } bool pri(lint p) { for (lint i = 2; i * i <= p; i == 2 ? ++i : i += 2) if (p % i == 0) return false; return p > 1; } mll factring(lint n) { mll ans; for (lint i = 2; i * i <= n; ++i) { while (n % i == 0) { n /= i; ++ans[i]; } } if (n != 1) ++ans[n]; return ans; } lint xor128() { static lint x = 123456789, y = 362436069, z = 521288629, w = 88675123; lint t = (x xor (x << 11)); x = y; y = z; z = w; return (w = (w xor (w >> 19)) xor (t xor (t >> 8))); } double dis(D a, D b) { double x = a.first - b.first, y = a.second - b.second; return sqrt(x * x + y * y); } bool kousa(double ax, double ay, double bx, double by, double cx, double cy, double dx, double dy) { double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax); double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx); double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx); double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx); return tc * td < 0 && ta * tb < 0; } class unionfind { private: int par[2 * 100010], ranks[2 * 100010], sizeth[2 * 100010]; public: void init(int n) { for (int i = 0; i < n; ++i) { par[i] = i; ranks[i] = 0; sizeth[i] = 1; } } int root(int x) { if (par[x] == x) return x; return par[x] = root(par[x]); } int size(int x) { return sizeth[x]; } bool same(int x, int y) { return root(x) == root(y); } void unite(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (ranks[x] < ranks[y]) { par[x] = y; sizeth[y] += sizeth[x]; } else { par[y] = x; if (ranks[x] == ranks[y]) ++ranks[x]; sizeth[x] += sizeth[y]; } } }; class BIT { private: int n; int bit[500010]; public: void init(int m) { n = m; } void add(int a, int w) { for (int x = a; x <= n; x += (x & -x)) bit[x] += w; } int sum(int a) { int ret = 0; for (int x = a; x > 0; x -= (x & -x)) ret += bit[x]; return ret; } }; int n; string s; bool cnt[30]; int main() { getline(cin, s); n = s.size(); if (n == 1) printf("NO\n"); else { rep(i, n - 1) { for (int j = i + 2; j < n; ++j) { bool can = true; rep(k, n) { cnt[i] = false; } for (int k = i + 1; k < j; k += 2) { if (s[k]!=' ') { cnt[s[k] - 'a'] = true; } } rep(k, n) { if (i <= k && k < j) { if ((k - i) ^ 1) { if (s[k] == ' ' || cnt[s[k] - 'a']) { can = false; break; } } } else { if (cnt[s[k] - 'a']) { can = false; break; } } } if (can) { printf("Yes\n"); return 0; } } } printf("NO\n"); } }