Submission #58670580


Source Code Expand

#pragma region おまじないα ver1 .08
// #define _CRT_SECURE_NO_WARNINGS
// #pragma warning(disable : 4996)
//  using mint = modint1000000007;
//  using mint = modint998244353;
#pragma region 変化しないおまじない
#include "bits/stdc++.h"
#if __has_include("atcoder/all")
#include <atcoder/all>
using namespace atcoder;
#endif
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#pragma GCC target(                                                            \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()   // sortなどの引数を省略
#define max3(x, y, z) max(x, max(y, z)) // 3変数max
#define min3(x, y, z) min(x, min(y, z)) // 3変数min
#define chmin(m, v) m = min((m), (v))   // 最小値を更新
#define chmax(m, v) m = max((m), (v))   // 最大値を更新
#define rep(i, n) repi(i, 0, n)         // 0-N rep
#define reps(i, n) repi(i, 1, n + 1)    // 1-N
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); i++) // a-b
#define prif(x)                                                                \
  if (x) {                                                                     \
    cout << "Yes";                                                             \
  } else {                                                                     \
    cout << "No";                                                              \
  }
#define P pair<ll, ll> // typedefだと予測が効かないっぽい?
#ifdef _MSC_FULL_VER   // 手元なら
#define dout cout
#else
#define dout                                                                   \
  if (false)                                                                   \
  cout
#endif
double dist(double x1, double y1, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
ll idist(ll x1, ll y1, ll x2, ll y2) {
  return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
ll digitsum(ll N) {
  while (N >= 10) {
    int tmp = 0;
    while (N > 0) {
      tmp += (N % 10);
      N /= 10;
    }
    N = tmp;
  }
  return N;
}
struct qwqw {
  qwqw() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
} aaaaaaa;
#pragma endregion
#pragma endregion
int main() {
  ll N;
  string S;
  cin >> N >> S;
  ll ans = 0;
  rep(i, N - 2) {
    if (S[i] == '#' && S[i + 1] == '.' && S[i + 2] == '#') {
      ans++;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task A - Seats
User ramdos
Language C++ 20 (gcc 12.2)
Score 100
Code Size 2590 Byte
Status AC
Exec Time 2 ms
Memory 3676 KiB

Compile Error

Main.cpp:1: warning: ignoring ‘#pragma region \U0000304a\U0000307e\U00003058\U0000306a\U00003044\U000003b1’ [-Wunknown-pragmas]
    1 | #pragma region おまじないα ver1 .08
      | 
Main.cpp:6: warning: ignoring ‘#pragma region \U00005909\U00005316\U00003057\U0000306a\U00003044\U0000304a\U0000307e\U00003058\U0000306a\U00003044’ [-Wunknown-pragmas]
    6 | #pragma region 変化しないおまじない
      | 
Main.cpp:66: warning: ignoring ‘#pragma endregion ’ [-Wunknown-pragmas]
   66 | #pragma endregion
      | 
Main.cpp:67: warning: ignoring ‘#pragma endregion ’ [-Wunknown-pragmas]
   67 | #pragma endregion
      | 

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3452 KiB
sample01.txt AC 1 ms 3480 KiB
sample02.txt AC 1 ms 3464 KiB
testcase00.txt AC 1 ms 3444 KiB
testcase01.txt AC 1 ms 3448 KiB
testcase02.txt AC 1 ms 3420 KiB
testcase03.txt AC 1 ms 3492 KiB
testcase04.txt AC 1 ms 3492 KiB
testcase05.txt AC 1 ms 3420 KiB
testcase06.txt AC 1 ms 3448 KiB
testcase07.txt AC 1 ms 3448 KiB
testcase08.txt AC 1 ms 3540 KiB
testcase09.txt AC 1 ms 3560 KiB
testcase10.txt AC 1 ms 3604 KiB
testcase11.txt AC 2 ms 3676 KiB
testcase12.txt AC 1 ms 3588 KiB
testcase13.txt AC 2 ms 3604 KiB
testcase14.txt AC 2 ms 3672 KiB
testcase15.txt AC 2 ms 3600 KiB
testcase16.txt AC 2 ms 3572 KiB
testcase17.txt AC 2 ms 3540 KiB
testcase18.txt AC 2 ms 3604 KiB
testcase19.txt AC 2 ms 3608 KiB