oj.uz

답안 #1025506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025506 2024-07-17T05:42:39 Z caterpillow Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 13 ms 10932 KB 
#include <bits/stdc++.h>

using namespace std;

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

template<typename Tuple, size_t... Is>
void print_tuple(const Tuple& t, index_sequence<Is...>) {
    ((cerr << (Is == 0 ? "{" : ", ") << get<Is>(t)), ...);
    cerr << "}";
}

template<typename... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    print_tuple(t, index_sequence_for<Args...>{});
    return os;
}

ostream& operator<<(ostream& os, string& s) {
    for (char c : s) os << c; 
    return os;
}

template<template<typename> class Container, typename T>
ostream& operator<<(ostream& os, Container<T> o) {
    os << "{"; 
    int g = size(o); 
    for (auto i : o) os << i << ((--g) == 0 ? "" : ", "); 
    os << "}";
    return os;
}

template<typename T, typename V>
ostream& operator<<(ostream& os, const pair<T, V> p) {
    os << "{" << p.f << ", " << p.s << "}";
    return os;
}

template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail) {
    int i = 0;
    while (names[i] != '\0' && names[i] != ',') i++;
    constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
    if constexpr (is_str) cerr << head; // ignore directly passed strings
    else cerr.write(names, i) << " = " << head; 
    if constexpr (sizeof...(tail)) cerr << (is_str ? "" : ","), printer(names + i + 1, tail...);
    else cerr << endl;
}

#ifdef LOCAL
#define dbg(...) std::cerr << __LINE__ << ": ", printer(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif

int rs, cs, d, k;

main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> rs >> cs >> d >> k;
    vt<vt<int>> grid(rs, vt<int>(cs));
    vt<pi> cows;
    F0R (r, rs) {
        F0R (c, cs) {
            char ch; cin >> ch;
            if (ch == '.') continue;
            if (ch == 'M') {
                cows.pb({r, c});
                continue;
            }
            int r1 = max(0, r - d);
            int c1 = max(0, c - d);
            int r2 = min(rs - 1, r + d) + 1;
            int c2 = min(cs - 1, c + d) + 1;
            grid[r1][c1]++;
            if (r2 < rs) grid[r2][c1]--;
            if (c2 < cs) grid[r1][c2]--;
            if (r2 < rs && c2 < cs) grid[r2][c2]++;
        }
    }
    F0R (r, rs) F0R (c, cs - 1) grid[r][c + 1] += grid[r][c];
    F0R (r, rs - 1) F0R (c, cs) grid[r + 1][c] += grid[r][c];
    
    int ans = 0;
    for (auto [x, y] : cows) ans += grid[x][y] >= k;
    cout << ans << endl;
}

Compilation message

mushrooms.cpp:74:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1372 KB Output is correct
2 Correct 3 ms 1372 KB Output is correct
3 Correct 3 ms 1628 KB Output is correct
4 Correct 4 ms 1484 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 6072 KB Output is correct
2 Correct 12 ms 10168 KB Output is correct
3 Correct 11 ms 10932 KB Output is correct
4 Correct 11 ms 6328 KB Output is correct
5 Correct 11 ms 10168 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 4 ms 1484 KB Output is correct
20 Correct 3 ms 1368 KB Output is correct
21 Correct 11 ms 6072 KB Output is correct
22 Correct 12 ms 10168 KB Output is correct
23 Correct 11 ms 10932 KB Output is correct
24 Correct 11 ms 6328 KB Output is correct
25 Correct 11 ms 10168 KB Output is correct
26 Correct 10 ms 4820 KB Output is correct
27 Correct 11 ms 4960 KB Output is correct
28 Correct 9 ms 3796 KB Output is correct
29 Correct 9 ms 4052 KB Output is correct
30 Correct 13 ms 5660 KB Output is correct