1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

void solve() {
    string s;
    cin >> s;
    int n = sz(s);
    bool flag = true;
    rep(i, 0, n - 2) {
        if (s[i] == s[i + 1]) {
            flag = false;
            break;
        }
    }
    if (flag) {
        cout << "YES" << endl;
        return;
    }
    int ans = 0;
    rep(i, 0, n - 2) {
        if (s[i] == s[i + 1]) ans++;
    }
    if (ans > 2)
        cout << "NO" << endl;
    else
        cout << "YES" << endl;
    return;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

void solve() {
    ll n;
    cin >> n;
    vector<vector<char>> ma(2, vector<char>(n));
    rep(i, 0, 1) { rep(j, 0, n - 1) cin >> ma[i][j]; }
    vector<int> dp(n);
    if (ma[0][0] == ma[1][0])
        dp[0] = 0;
    else
        dp[0] = 1;
    if (n == 1) {
        cout << dp[0] << endl;
        return;
    }
    dp[1] = min(dp[0] + (ma[0][1] != ma[1][1]), (ma[0][0] != ma[0][1]) + (ma[1][0] != ma[1][1]));
    rep(i, 2, n - 1) {
        dp[i] = min(dp[i - 1] + (ma[0][i] != ma[1][i]), dp[i - 2] + (ma[0][i - 1] != ma[0][i]) + (ma[1][i - 1] != ma[1][i]));
    }
    cout << dp[n - 1] << endl;
    return;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

const ll MOD = 998244353;
void solve() {
    ll n, x;
    cin >> n >> x;
    ll tem = (1 + x / 4) % MOD;
    ll tem2 = (x + 2) / 4 % MOD;
    ll tem3 = (1 + (n + 1) / 4 - tem + MOD) % MOD;
    ll tem4 = ((n + 3) / 4 - tem2 + MOD) % MOD;
    cout << (tem * tem3 % MOD + tem2 * tem4 % MOD) % MOD << endl;
    return;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve() {
    ll n, r;
    cin >> n >> r;
    vector<pll> ma(n);
    rep(i, 0, n - 1) cin >> ma[i].first >> ma[i].second;
    ll bias = 1e5;
    ll tem = 0;
    while (tem * tem < 3 * r * r) tem++;
    while (true) {
        ll dx = rng() % (2 * r);
        ll dy = rng() % tem;
        int cnt = 0;
        set<pii> res;
        for (auto& [x, y] : ma) {
            ll tx = x + bias;
            ll ty = y + bias;
            ll cntx = tx / (2 * r);
            ll cnty = ty / tem;
            bool flag = false;
            rep(i, cntx - 2, cntx + 2) {
                if (flag) break;
                rep(j, cnty - 2, cnty + 2) {
                    ll tx2 = i * 2 * r + (j % 2 == 0 ? r : 0) + dx;
                    ll ty2 = j * tem + dy;
                    ll dis = (tx2 - tx) * (tx2 - tx) + (ty2 - ty) * (ty2 - ty);
                    if (dis <= r * r) {
                        flag = true;
                        res.insert({tx2 - bias, ty2 - bias});
                    }
                }
            }
            if (flag) cnt++;
        }
        if (cnt * 100 >= 89 * n) {
            cout << sz(res) << endl;
            for (auto& [x, y] : res) cout << x << ' ' << y << endl;
            return;
        }
    }
    return;
}