結果
問題 | No.1292 パタパタ三角形 |
ユーザー |
![]() |
提出日時 | 2020-11-20 21:31:42 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 3,491 bytes |
コンパイル時間 | 1,700 ms |
コンパイル使用メモリ | 178,076 KB |
実行使用メモリ | 16,128 KB |
最終ジャッジ日時 | 2024-07-23 12:41:16 |
合計ジャッジ時間 | 2,692 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
ソースコード
#include <bits/stdc++.h>using namespace std;// using mint = long double;// using mint = modint998244353;// using mint = modint1000000007;typedef long long ll;typedef pair<ll, ll> P;typedef pair<P, ll> T;typedef pair<ll, vector<ll>> Pd;const ll INF = 1e18;const ll fact_table = 3200008;priority_queue <ll> pql;priority_queue <P> pqp;//big priority queuepriority_queue <ll, vector<ll>, greater<ll> > pqls;priority_queue <P, vector<P>, greater<P> > pqps;//small priority queue//top popll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};//↓,→,↑,←/*#define endl "\n"#ifdef ENJAPMA#undef endl#endif*/#define p(x) cout<<x<<endl;#define el cout<<endl;#define pe(x) cout<<x<<" ";#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;#define pu(x) cout<<(x);#define pb push_back#define lb lower_bound#define ub upper_bound#define pc(x) cout << x << ",";#define rep(i, n) for (ll i = 0; i < (n); i ++)#define rep2(i, a, b) for (ll i = a; i <= (b); i++)#define rep3(i, a, b) for (ll i = a; i >= (b); i--)typedef vector<ll> vec;typedef vector<vector<ll>> mat;const ll mod = 998244353ll;// const ll mod = 1000000007ll;ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}void line() { p("--------------------"); return;}/*ll fact[fact_table + 5], rfact[fact_table + 5];void c3_init() {fact[0] = rfact[0] = 1;for (ll i = 1; i <= fact_table; i++) {fact[i] = (fact[i - 1] * i) % mod;}rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);for (ll i = fact_table; i >= 1; i--) {rfact[i - 1] = rfact[i] * i;rfact[i - 1] %= mod;}return;}ll c3(ll n, ll r) {return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;}*/bool icpc = false;bool multicase = false;ll n, m, k;ll q;ll w[100005];set<P> st;bool solve() {string s;cin >> s;n = s.size();char s1 = 'a', s2 = 'b', s3 = 'c';char t1 = 'a', t2 = 'b', t3 = 'c';ll a = 0, b = 0;st.insert(P(a, b));for (int i = 0; i < n; i++) {if (i % 2 == 0) {if (s1 == s[i]) {t3 = s1, t2 = s2, t1 = s3;a++;} else if (s2 == s[i]) {t1 = s2, t2 = s1, t3 = s3;b++;} else {t2 = s3, t1 = s1, t3 = s2;a--; b--;}} else {if (t1 == s[i]) {s2 = t1, s1 = t2, s3 = t3;b--;} else if (t2 == s[i]) {s3 = t2, s1 = t1, s2 = t3;a++; b++;} else {s1 = t3, s2 = t2, s3 = t1;a--;}}st.insert(P(a, b));}p(st.size());return true;}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);if (icpc) {while (solve());return 0;}ll q, testcase = 1;if (multicase) {cin >> q;} else {q = 1;}while (q--) {// pu("Case ");pu("#");pu(testcase);pu(": ");solve();testcase++;}// solve();return 0;}