結果

問題 No.2035 Tunnel
ユーザー miscalc
提出日時 2022-08-12 22:06:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 10 ms / 2,000 ms
コード長 3,267 bytes
コンパイル時間 4,179 ms
コンパイル使用メモリ 252,044 KB
最終ジャッジ日時 2025-01-30 21:08:50
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} 
    return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << 
    '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/
ll slow(ll N, string S)
{
  ll ans = 0;
  while (S != string(N, '.'))
  {
    string T(N, '.');
    for (ll i = 0; i < N - 1; i++)
    {
      if (S.at(i) == '#')
      {
        if (S.at(i + 1) == '#')
          T.at(i) = '#';
        else
          T.at(i) = '.', T.at(i + 1) = '#';
      }
    }
    S = T;
    ans++;
  }
  return ans;
}
ll solve(ll N, string S)
{
  ll tmp = 0, cnt = 1, idx = -1;
  for (ll i = N - 1; i >= 0; i--)
  {
    if (S.at(i) == '#')
    {
      idx = i;
      tmp -= cnt - 1;
      chmax(tmp, 0LL);
      cnt = 0;
    }
    else
      cnt++;
  }
  return tmp + (N - idx);
}
int main()
{
  /*
  srand((unsigned)time(NULL));
  for (ll t = 0; t < 500; t++)
  {
    ll N = 1 + rand() % 10;
    string S(N, '.');
    for (ll i = 0; i < N; i++)
    {
      if (rand() % 2 == 0)
        S.at(i) = '#';
    }
    if (S == string(N, '.'))
      continue;
    ll ans = slow(N, S), ans2 = solve(N, S);
    if (ans != ans2)
    {
      cout << N << endl;
      cout << S << endl;
      cout << ans << " " << ans2 << endl;
      return 0;
    }
    cerr << t << endl;
  }
  //*/
  //*
  ll N;
  cin >> N;
  string S;
  cin >> S;
  cout << solve(N, S) << endl;
  //*/
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0