Submission #1460479
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
//#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
signed main() {
INIT;
VAR(int, n);
VAR(std::string, s);
int cnt = 0;
REP(i, n - 1) {
if (s.substr(i, 2) == ".X") ++cnt;
}
OUT(cnt)BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 雨上がり |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4749 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 50 |
Status |
|
Set Name |
Test Cases |
All |
case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt |
Case Name |
Status |
Exec Time |
Memory |
case_000.txt |
AC |
1 ms |
256 KB |
case_001.txt |
AC |
1 ms |
256 KB |
case_002.txt |
AC |
1 ms |
256 KB |
case_003.txt |
AC |
1 ms |
256 KB |
case_004.txt |
WA |
1 ms |
256 KB |
case_005.txt |
WA |
1 ms |
256 KB |
case_006.txt |
AC |
1 ms |
256 KB |
case_007.txt |
AC |
1 ms |
256 KB |
case_008.txt |
WA |
1 ms |
256 KB |
case_009.txt |
AC |
1 ms |
256 KB |
case_010.txt |
WA |
1 ms |
256 KB |
case_011.txt |
AC |
1 ms |
256 KB |
case_012.txt |
AC |
1 ms |
256 KB |
case_013.txt |
WA |
1 ms |
256 KB |
case_014.txt |
WA |
1 ms |
256 KB |
case_015.txt |
WA |
1 ms |
256 KB |
case_016.txt |
WA |
1 ms |
256 KB |
case_017.txt |
WA |
1 ms |
256 KB |
case_018.txt |
WA |
1 ms |
256 KB |
case_019.txt |
WA |
1 ms |
256 KB |
case_020.txt |
WA |
1 ms |
256 KB |
case_021.txt |
WA |
1 ms |
256 KB |
case_022.txt |
WA |
1 ms |
256 KB |
case_023.txt |
WA |
1 ms |
256 KB |
case_024.txt |
WA |
1 ms |
256 KB |
case_025.txt |
WA |
1 ms |
256 KB |
case_026.txt |
WA |
1 ms |
256 KB |
case_027.txt |
WA |
1 ms |
256 KB |
case_028.txt |
WA |
1 ms |
256 KB |
case_029.txt |
WA |
1 ms |
256 KB |
case_030.txt |
WA |
1 ms |
256 KB |
case_031.txt |
WA |
1 ms |
256 KB |
case_032.txt |
WA |
1 ms |
256 KB |
case_033.txt |
WA |
1 ms |
256 KB |
case_034.txt |
WA |
1 ms |
256 KB |
case_035.txt |
WA |
1 ms |
256 KB |
case_036.txt |
WA |
1 ms |
256 KB |
case_037.txt |
WA |
1 ms |
256 KB |
case_038.txt |
WA |
1 ms |
256 KB |
case_039.txt |
WA |
1 ms |
256 KB |
case_040.txt |
WA |
1 ms |
256 KB |
case_041.txt |
WA |
1 ms |
256 KB |
case_042.txt |
WA |
1 ms |
256 KB |