結果
| 問題 | No.1292 パタパタ三角形 |
| ユーザー |
 Sooh317
|
| 提出日時 | 2020-11-20 22:12:46 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,560 bytes |
| コンパイル時間 | 2,021 ms |
| コンパイル使用メモリ | 178,128 KB |
| 実行使用メモリ | 12,928 KB |
| 最終ジャッジ日時 | 2024-07-23 13:09:31 |
| 合計ジャッジ時間 | 2,835 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,812 KB |
| testcase_01 | AC | 2 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,940 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | AC | 100 ms
12,928 KB |
| testcase_14 | AC | 4 ms
6,940 KB |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
ソースコード
#include<bits/stdc++.h>
using namespace std;
/*#pragma region atcoder
#include <atcoder/modint>
//#include <atcoder/fenwicktree>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;*/
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, n) for(int i = n - 1; i >= 0; i--)
#define RREP(i, a, b) for(int i = b - 1; i >= a; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#pragma endregion
#pragma region debug for var, v, vv
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){cout << endl;int cnt = 0;for(const auto& v : vv){cout << cnt << "th : "; view(v); cnt++;} cout << endl;}
#pragma endregion
/*#pragma region int128
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
#pragma endregion*/
const ll mod = 998244353;
const int inf = 1001001001;
const ll INF = 1001001001001001001;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
template<class T>bool chmax(T &a, const T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T b) { if (b<a) { a=b; return 1; } return 0; }
ll rudiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // 20 / 3 == 7
ll rddiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // -20 / 3 == -7
ll power(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a;} a = a * a; p >>= 1;} return ret;}
ll modpow(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a % mod;} a = a * a % mod; p >>= 1;} return ret;}
/*--------------------------------------------------------------------------------------------------------------------------------*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
//cout << fixed << setprecision(15);
string s; cin >> s;
set<pii> st;
int ans = 1;
int h = 0, l = 1, r = 2;
st.insert({0, 0});
int x = 0, y = 0;
rep(i,sz(s)){
int k = s[i] - 'a';
if(i & 1){
if(k == 0){
if(h == 0){
y--;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 0){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 0){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
if(k == 1){
if(h == 1){
y--;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 1){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 1){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
if(k == 2){
if(h == 2){
y--;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 2){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 2){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
}
else{
if(k == 0){
if(h == 0){
y++;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 0){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 0){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
if(k == 1){
if(h == 1){
y++;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 1){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 1){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
if(k == 2){
if(h == 2){
y++;
if(!st.count({x, y})) ans++, st.insert({x, y});
continue;
}
if(r == 2){
x++;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, l);
}
if(l == 2){
x--;
if(!st.count({x, y})) ans++, st.insert({x, y});
swap(h, r);
}
}
}
}
cout << ans << endl;
}
/*
* review you code when you get WA (typo? index?)
* int overflow, array bounds
* special cases (n=1?)
*/