結果

問題 No.1292 パタパタ三角形
ユーザー stoqstoq
提出日時 2020-11-28 09:44:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 3,433 bytes
コンパイル時間 2,161 ms
コンパイル使用メモリ 212,112 KB
実行使用メモリ 12,928 KB
最終ジャッジ日時 2024-09-12 22:11:27
合計ジャッジ時間 3,651 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 26 ms
6,944 KB
testcase_08 AC 26 ms
6,944 KB
testcase_09 AC 44 ms
12,416 KB
testcase_10 AC 48 ms
12,416 KB
testcase_11 AC 47 ms
12,288 KB
testcase_12 AC 59 ms
12,800 KB
testcase_13 AC 52 ms
12,928 KB
testcase_14 AC 5 ms
6,940 KB
testcase_15 AC 6 ms
6,944 KB
testcase_16 AC 7 ms
6,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In member function 'pii triangle::Move(char)',
    inlined from 'void solve()' at main.cpp:157:29:
main.cpp:124:31: warning: 't' may be used uninitialized [-Wmaybe-uninitialized]
  124 |       rotate(edge, edge + 3 - t, edge + 3);
      |                               ^
main.cpp: In function 'void solve()':
main.cpp:112:9: note: 't' was declared here
  112 |     int t;
      |         ^

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

struct triangle
{
  bool inv;
  char edge[3];
  triangle()
  {
    inv = false;
    iota(edge, edge + 3, 'a');
  }
  pii Move(char c)
  {
    int t;
    rep(i, 3)
    {
      if (c == edge[i])
      {
        t = i;
        break;
      }
    }
    int di, dj;
    if (!inv)
    {
      rotate(edge, edge + 3 - t, edge + 3);
      if (t == 0)
        di = 1, dj = 0;
      else if (t == 1)
        di = 0, dj = -1;
      else if (t == 2)
        di = 0, dj = 1;
      inv = true;
    }
    else
    {
      rotate(edge, edge + 3 - t, edge + 3);
      if (t == 0)
        di = -1, dj = 0;
      else if (t == 1)
        di = 0, dj = -1;
      else if (t == 2)
        di = 0, dj = 1;
      inv = false;
    }
    return {di, dj};
  }
};

void solve()
{
  triangle tri;
  string s;
  cin >> s;
  int ci = 0, cj = 0;
  set<pii> st = {{0, 0}};
  for (auto c : s)
  {
    auto [di, dj] = tri.Move(c);
    ci += di, cj += dj;
    st.insert({ci, cj});
  }
  cout << st.size() << "\n";
}

int main()
{
  solve();
}
0