結果
問題 | No.2063 ±2^k operations (easy) |
ユーザー |
|
提出日時 | 2022-09-02 21:29:47 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,133 bytes |
コンパイル時間 | 1,891 ms |
コンパイル使用メモリ | 175,284 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-16 02:21:44 |
合計ジャッジ時間 | 2,309 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define double long doubleusing ll = long long;using VB = vector<bool>;using VVB = vector<VB>;using VVVB = vector<VVB>;using VC = vector<char>;using VI = vector<int>;using VVI = vector<VI>;using VVVI = vector<VVI>;using VL = vector<ll>;using VVL = vector<VL>;using VVVL = vector<VVL>;using VVVVL = vector<VVVL>;using VD = vector<double>;using VVD = vector<VD>;using VVVD = vector<VVD>;using PI = pair<int, int>;#define REP(i, n) for (int i = 0; i < (int)(n); i++)#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)#define ALL(a) (a).begin(),(a).end()constexpr int INF = 1001001001;constexpr ll LINF = 1001001001001001001ll;constexpr int DX[] = {1, 0, -1, 0};constexpr int DY[] = {0, 1, 0, -1};template< typename T1, typename T2>inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }template< typename T1, typename T2>inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }const ll MOD = 1000000007;ll mod_pow(ll x, ll n, ll mod) {ll res = 1;while (n > 0) {if (n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}ll gcd(ll x, ll y) {if (y == 0) return x;return gcd(y, x % y);}const int MAX_N = 200010;int par[MAX_N];int rnk[MAX_N];int siz[MAX_N];void init(int n) {REP(i,n) {par[i] = i;rnk[i] = 0;siz[i] = 1;}}int find(int x) {if (par[x] == x) {return x;} else {return par[x] = find(par[x]);}}void unite(int x, int y) {x = find(x);y = find(y);if (x == y) return;int s = siz[x] + siz[y];if (rnk[x] < rnk[y]) {par[x] = y;} else {par[y] = x;if (rnk[x] == rnk[y]) rnk[x]++;}siz[find(x)] = s;}bool same(int x, int y) {return find(x) == find(y);}int size(int x) {return siz[find(x)];}typedef pair<ll, int> P0;struct edge { int to; ll cost; };const int MAX_V =400;int V;vector<edge> G[MAX_V];ll d[MAX_V];void dijkstra(ll s) {// greater<P>を指定することでfirstが小さい順に取り出せるようにするpriority_queue<P0, vector<P0>, greater<P0> > que;fill(d, d + V, LINF);d[s] = 0;que.push(P0(0, s));while (!que.empty()) {P0 p = que.top(); que.pop();int v = p.second;if (d[v] < p.first) continue;REP(i,G[v].size()) {edge e = G[v][i];if (d[e.to] > d[v] + e.cost) {d[e.to] = d[v] + e.cost;que.push(P0(d[e.to], e.to));}}}}int main() {ios::sync_with_stdio(false);std::cin.tie(nullptr);string N;cin >> N;int L = N.size(), A = 0, B = 0, C = 0;REP(i, L) A += N[i] - '0';if (A < 2) {cout << "No\n";return 0;}if (A == 2) {cout << "Yes\n";return 0;}REP(i, L - 1) {if (N[i] == '0' && N[i + 1] == '1') B++;if (N[i] == '1' && N[i + 1] == '0') C++;}if (B > 0 && C > 0) cout << "No\n";else cout << "Yes\n";}