oj.uz

답안 #330169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330169 2020-11-24T05:28:37 Z 2qbingxuan Dango Maker (JOI18_dango_maker) C++14
33 / 100
 333 ms 262148 KB 
//   __________________
//  | ________________ |
//  ||          ____  ||
//  ||   /\    |      ||
//  ||  /__\   |      ||
//  || /    \  |____  ||
//  ||________________||
//  |__________________|
//  \###################\
//   \###################\
//    \        ____       \
//     \_______\___\_______\
// An AC a day keeps the doctor away.
 
#ifdef local
#include <bits/extc++.h>
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(args...) qqbx(#args, args)
using ost = std::ostream;
#define DESTL(STL, BEG, END, OUT) \
    template <typename ...T> ost& operator<<(ost &O, std::STL<T...> v) { int f=0; for(auto x: v) O << (f++ ? ", " : BEG) << OUT; return O << END; }
DESTL(deque, "[", "]", x); DESTL(vector, "[", "]", x);
DESTL(set, "{", "}", x); DESTL(multiset, "{", "}", x); DESTL(unordered_set, "{", "}", x);
DESTL(map , "{", "}", x.first << ":" << x.second); DESTL(unordered_map , "{", "}", x.first << ":" << x.second);
template <typename U, typename V> ost& operator<<(ost &O, std::pair<U,V> p) { return O << '(' << p.first << ',' << p.second << ')'; }
template <typename T, size_t N> ost& operator<<(ost &O, std::array<T,N> a) { int f=0; for(T x: a) O << (f++ ? ", " : "[") << x; return O << "]"; }
template <typename T, size_t ...I> ost& prtuple(ost &O, T t, std::index_sequence<I...>) { return (..., (O << (I ? ", " : "(") << std::get<I>(t))), O << ")"; }
template <typename ...T> ost& operator<<(ost &O, std::tuple<T...> t) { return prtuple(O, t, std::make_index_sequence<sizeof...(T)>()); }
template <typename ...T> void qqbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    (std::cerr << "\033[1;32m(" << s << ") = (" , ... , (std::cerr << args << (--cnt ? ", " : ")\033[0m\n")));
}
#else
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define get_pos(v,x) int(lower_bound(begin(v),end(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define pb emplace_back
#define ff first
#define ss second
#define mem(v,x) memset(v,x,sizeof v)
 
using namespace std;
using namespace __gnu_pbds;
typedef int64_t ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
template <typename T> using max_heap = std::priority_queue<T,vector<T>,less<T> >;
template <typename T> using min_heap = std::priority_queue<T,vector<T>,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
constexpr ld PI = acos(-1), eps = 1e-7;
constexpr ll N = 3025, INF = 1e18, MOD = 1000000007, K = 14699, inf = 1e9;
constexpr inline ll cdiv(ll x, ll m) { return x/m + (x%m ? (x<0) ^ (m>0) : 0); } // ceiling divide
constexpr inline ll modpow(ll e,ll p,ll m=MOD) { ll r=1; for(e%=m;p;p>>=1,e=e*e%m) if(p&1) r=r*e%m; return r; }

struct BPT {
    vector<int> g[N*N];
    bool vis[N*N];
    int mx[N*N], my[N*N];
    void addEdge(int a, int b) {
        g[a].pb(b);
    }
    void init(int X, int Y) {
        for(int i = 1; i <= X; i++) g[i].clear();
        for(int i = 1; i <= X; i++) mx[i] = 0;
        for(int i = 1; i <= Y; i++) my[i] = 0;
    }
    bool dfs(int i) {
        if(vis[i]) return false;
        vis[i] = true;
        for(int j: g[i]) if(!my[j] || dfs(my[j])) {
            my[j] = i;
            mx[i] = j;
            return true;
        }
        return false;
    }
    int solve(int n) {
        int ans = 0;
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) vis[j] = false;
            if(dfs(i)) ++ans;
        }
        return ans;
    }
} g;
int hori[N][N], vert[N][N];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<string> v(n);
    for(int i = 0; i < n; i++) cin >> v[i];
    int idx = 0, idy = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j+3 <= m; j++) {
            if(v[i].substr(j, 3) == "RGW") {
                hori[i][j] = ++idx;
            }
        }
    }
    for(int j = 0; j < m; j++) {
        for(int i = 0; i+3 <= n; i++) {
            string pat = v[i].substr(j, 1) + v[i+1].substr(j, 1) + v[i+2].substr(j, 1);
            if(pat == "RGW") {
                vert[i][j] = ++idy;
            }
        }
    }
    g.init(idx, idy);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(hori[i][j]) {
                for(int c: {0, 1, 2}) {
                    if(i-c >= 0 && j+c < m && vert[i-c][j+c])
                        g.addEdge(hori[i][j], vert[i-c][j+c]);
                }
            }
        }
    }
    cout << idx+idy - g.solve(idx) << '\n';
}

Compilation message

dango_maker.cpp:9:1: warning: multi-line comment [-Wcomment]
    9 | //  \###################\
      | ^
dango_maker.cpp:35: warning: ignoring #pragma loop_opt  [-Wunknown-pragmas]
   35 | #pragma loop_opt(on)
      |

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 215276 KB Output is correct
2 Correct 130 ms 215372 KB Output is correct
3 Correct 131 ms 215276 KB Output is correct
4 Correct 130 ms 215276 KB Output is correct
5 Correct 132 ms 215248 KB Output is correct
6 Correct 133 ms 215276 KB Output is correct
7 Correct 134 ms 215404 KB Output is correct
8 Correct 130 ms 215276 KB Output is correct
9 Correct 132 ms 215276 KB Output is correct
10 Correct 129 ms 215276 KB Output is correct
11 Correct 129 ms 215404 KB Output is correct
12 Correct 130 ms 215276 KB Output is correct
13 Correct 128 ms 215276 KB Output is correct
14 Correct 129 ms 215276 KB Output is correct
15 Correct 131 ms 215404 KB Output is correct
16 Correct 129 ms 215208 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 215276 KB Output is correct
2 Correct 130 ms 215372 KB Output is correct
3 Correct 131 ms 215276 KB Output is correct
4 Correct 130 ms 215276 KB Output is correct
5 Correct 132 ms 215248 KB Output is correct
6 Correct 133 ms 215276 KB Output is correct
7 Correct 134 ms 215404 KB Output is correct
8 Correct 130 ms 215276 KB Output is correct
9 Correct 132 ms 215276 KB Output is correct
10 Correct 129 ms 215276 KB Output is correct
11 Correct 129 ms 215404 KB Output is correct
12 Correct 130 ms 215276 KB Output is correct
13 Correct 128 ms 215276 KB Output is correct
14 Correct 129 ms 215276 KB Output is correct
15 Correct 131 ms 215404 KB Output is correct
16 Correct 129 ms 215208 KB Output is correct
17 Correct 135 ms 215276 KB Output is correct
18 Correct 131 ms 215532 KB Output is correct
19 Correct 136 ms 215276 KB Output is correct
20 Correct 132 ms 215404 KB Output is correct
21 Correct 131 ms 215276 KB Output is correct
22 Correct 133 ms 215420 KB Output is correct
23 Correct 129 ms 215276 KB Output is correct
24 Correct 130 ms 215276 KB Output is correct
25 Correct 132 ms 215276 KB Output is correct
26 Correct 129 ms 215276 KB Output is correct
27 Correct 130 ms 215404 KB Output is correct
28 Correct 131 ms 215404 KB Output is correct
29 Correct 130 ms 215276 KB Output is correct
30 Correct 131 ms 215276 KB Output is correct
31 Correct 130 ms 215276 KB Output is correct
32 Correct 144 ms 215404 KB Output is correct
33 Correct 137 ms 215276 KB Output is correct
34 Correct 132 ms 215276 KB Output is correct
35 Correct 130 ms 215276 KB Output is correct
36 Correct 147 ms 215564 KB Output is correct
37 Correct 131 ms 215300 KB Output is correct
38 Correct 130 ms 215288 KB Output is correct
39 Correct 129 ms 215276 KB Output is correct
40 Correct 134 ms 215276 KB Output is correct
41 Correct 134 ms 215276 KB Output is correct
42 Correct 131 ms 215276 KB Output is correct
43 Correct 131 ms 215276 KB Output is correct
44 Correct 129 ms 215276 KB Output is correct
45 Correct 132 ms 215404 KB Output is correct
46 Correct 130 ms 215276 KB Output is correct
47 Correct 130 ms 215404 KB Output is correct
48 Correct 131 ms 215276 KB Output is correct
49 Correct 133 ms 215404 KB Output is correct
50 Correct 137 ms 215276 KB Output is correct
51 Correct 131 ms 215276 KB Output is correct
52 Correct 137 ms 215276 KB Output is correct
53 Correct 134 ms 215404 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 215276 KB Output is correct
2 Correct 130 ms 215372 KB Output is correct
3 Correct 131 ms 215276 KB Output is correct
4 Correct 130 ms 215276 KB Output is correct
5 Correct 132 ms 215248 KB Output is correct
6 Correct 133 ms 215276 KB Output is correct
7 Correct 134 ms 215404 KB Output is correct
8 Correct 130 ms 215276 KB Output is correct
9 Correct 132 ms 215276 KB Output is correct
10 Correct 129 ms 215276 KB Output is correct
11 Correct 129 ms 215404 KB Output is correct
12 Correct 130 ms 215276 KB Output is correct
13 Correct 128 ms 215276 KB Output is correct
14 Correct 129 ms 215276 KB Output is correct
15 Correct 131 ms 215404 KB Output is correct
16 Correct 129 ms 215208 KB Output is correct
17 Correct 135 ms 215276 KB Output is correct
18 Correct 131 ms 215532 KB Output is correct
19 Correct 136 ms 215276 KB Output is correct
20 Correct 132 ms 215404 KB Output is correct
21 Correct 131 ms 215276 KB Output is correct
22 Correct 133 ms 215420 KB Output is correct
23 Correct 129 ms 215276 KB Output is correct
24 Correct 130 ms 215276 KB Output is correct
25 Correct 132 ms 215276 KB Output is correct
26 Correct 129 ms 215276 KB Output is correct
27 Correct 130 ms 215404 KB Output is correct
28 Correct 131 ms 215404 KB Output is correct
29 Correct 130 ms 215276 KB Output is correct
30 Correct 131 ms 215276 KB Output is correct
31 Correct 130 ms 215276 KB Output is correct
32 Correct 144 ms 215404 KB Output is correct
33 Correct 137 ms 215276 KB Output is correct
34 Correct 132 ms 215276 KB Output is correct
35 Correct 130 ms 215276 KB Output is correct
36 Correct 147 ms 215564 KB Output is correct
37 Correct 131 ms 215300 KB Output is correct
38 Correct 130 ms 215288 KB Output is correct
39 Correct 129 ms 215276 KB Output is correct
40 Correct 134 ms 215276 KB Output is correct
41 Correct 134 ms 215276 KB Output is correct
42 Correct 131 ms 215276 KB Output is correct
43 Correct 131 ms 215276 KB Output is correct
44 Correct 129 ms 215276 KB Output is correct
45 Correct 132 ms 215404 KB Output is correct
46 Correct 130 ms 215276 KB Output is correct
47 Correct 130 ms 215404 KB Output is correct
48 Correct 131 ms 215276 KB Output is correct
49 Correct 133 ms 215404 KB Output is correct
50 Correct 137 ms 215276 KB Output is correct
51 Correct 131 ms 215276 KB Output is correct
52 Correct 137 ms 215276 KB Output is correct
53 Correct 134 ms 215404 KB Output is correct
54 Correct 131 ms 215276 KB Output is correct
55 Correct 141 ms 215916 KB Output is correct
56 Correct 131 ms 215404 KB Output is correct
57 Correct 143 ms 225388 KB Output is correct
58 Correct 289 ms 233580 KB Output is correct
59 Runtime error 333 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -