답안 #803206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803206 2023-08-03T01:01:53 Z PixelCat Lamps (JOI19_lamps) C++14
4 / 100
5 ms 4188 KB
/*     code by PixelCat     */
/*         meow owo         */

#include <bits/stdc++.h>
#define int LL  //__int128
#define double long double
using namespace std;
using LL = long long;
// using i128 = __int128_t;
using ull = unsigned long long;
using pii = pair<int, int>;

#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second

#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair

#define MOD (int)(998244353)
// #define MOD (int)((LL)1'000'000'007)
#define EPS (1e-6)

namespace {

#ifdef NYAOWO
#include "/home/pixelcat/yodayo/meow/library/debug.hpp"
inline void USACO(const string &s) {
    cerr << "USACO: " << s << "\n";
}

#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

#endif

inline void NYA() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}
inline int gcd(int a, int b) {
    return __gcd(a, b);
}
inline int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}
inline int fpow(int b, int p, const int &mod = MOD) {
    if(p < 0) return fpow(fpow(b, -p, mod), mod - 2, mod);
    b %= mod;
    int ans = 1;
    for (; p; p >>= 1, b = b * b % mod)
        if (p & 1) ans = ans * b % mod;
    return ans;
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
    if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
    if (_a < _b) _a = _b;
}
mt19937_64 rng(
    chrono::steady_clock::now().time_since_epoch().count());

} // namespace PixelCat

const int MAXN = 1'000'000;

char a[MAXN + 10], b[MAXN + 10];

int32_t main() {
    NYA();
    // nyaacho >/////<
    int n; cin >> n;
    cin >> (a + 1);
    cin >> (b + 1);
    int ans = 0;
    For(i, 1, n) {
        if(b[i] == '1' && (i == 1 || b[i - 1] == '0')) ans++;
    }
    cout << ans << "\n";
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 4 ms 4180 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 5 ms 4132 KB Output is correct
10 Correct 4 ms 4136 KB Output is correct
11 Correct 4 ms 4180 KB Output is correct
12 Correct 4 ms 4180 KB Output is correct
13 Correct 5 ms 4180 KB Output is correct
14 Correct 5 ms 4188 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -