oj.uz

답안 #542102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542102 2022-03-25T11:47:40 Z browntoad Dango Maker (JOI18_dango_maker) C++14
13 / 100
 135 ms 235196 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
// #define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=3005;
//const ll sqmaxn=9000005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}

struct Dinic{
    static const int sqmaxn=6000010;
    struct Edge{
        int to, cap, rev;
        Edge(){}
        Edge(int _to, int _cap, int _rev): to(_to), cap(_cap), rev(_rev){}
    };
    vector<Edge> G[sqmaxn];
    void insert(int from, int to, int cap){
        G[from].pb(Edge(to, cap, SZ(G[to])));
        G[to].pb(Edge(from, 0, SZ(G[from])-1));
    }
    int n,s,t;
    void init(){
        REP(i,sqmaxn) G[i].clear();
    }
    int lev[sqmaxn], cur[sqmaxn];
    void bfs(){
        fill(lev, lev+sqmaxn, -1);
        lev[s]=0;
        queue<int> qu; qu.push(s);
        while(!qu.empty()){
            int tmp=qu.front();
            qu.pop();
            for (Edge e:G[tmp]){
                if (e.cap>0&&lev[e.to]==-1){
                    lev[e.to]=lev[tmp]+1;
                    qu.push(e.to);
                }
            }
        }
    }
    int dfs(int now, int flow){
        if (now==t||flow==0){
            return flow;
        }
        int fl=0;
        for (int &i=cur[now];i<SZ(G[now]);i++){
            Edge &e=G[now][i];
            if (lev[e.to]!=lev[now]+1||e.cap<=0) continue;
            int ret=dfs(e.to, min(flow, e.cap));
            if (ret>0){
                e.cap-=ret;
                G[e.to][e.rev].cap+=ret;
                fl+=ret;
                flow-=ret;
                if (flow==0) break; 
            }
            
        }
        return fl;
    }
    int flow(int _s, int _t){
        s=_s; t=_t;
        int fl=0;
        while(1){
            bfs();
            if (lev[t]==-1) break;
            fill(cur, cur+sqmaxn, 0);
            int tmp;
            while((tmp=dfs(s,iinf))>0){
                fl+=tmp;
            }
        }
        return fl;
    }
}ok;
char arr[maxn][maxn];
int val[maxn][maxn];
signed main(){
    IOS();
    int n,m; cin>>n>>m;
    REP1(i,n){
        REP1(j,m) {
            cin>>arr[i][j];
        }
    }
    int tot=0;
    int cval=3;
    REP1(i,n){
        REP1(j,m){
            if (arr[i][j-1]=='R'&&arr[i][j]=='G'&&arr[i][j+1]=='W'){
                val[i][j]=cval;
                ok.insert(1, cval, 1);
                bug(cval);
                cval++;
                tot++;
            }
        }
    }
    REP1(i,n){
        REP1(j,m){
            if (arr[i-1][j]!='R'||arr[i][j]!='G'||arr[i+1][j]!='W'){
                continue;
            }
            ok.insert(cval, 2, 1);
            if (val[i-1][j+1]!=0){ 
                ok.insert(val[i-1][j+1], cval, 1);
                bug(cval);
            }
            if (val[i+1][j-1]!=0){
                ok.insert(val[i+1][j-1], cval, 1);
                bug(cval);
            }
            bug(cval);
            cval++;
            tot++;
        }
    }
    int okans=ok.flow(1, 2);
    cout<<tot-okans<<endl;
}
/*
9 3
RGW
GGG
WGG
RGW
GGG
WGG
RGW
GGG
WGG
*/

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 188108 KB Output is correct
2 Correct 88 ms 188244 KB Output is correct
3 Correct 85 ms 188148 KB Output is correct
4 Correct 85 ms 188096 KB Output is correct
5 Correct 83 ms 188128 KB Output is correct
6 Correct 114 ms 235144 KB Output is correct
7 Correct 107 ms 235072 KB Output is correct
8 Correct 110 ms 235196 KB Output is correct
9 Correct 104 ms 235120 KB Output is correct
10 Correct 89 ms 188164 KB Output is correct
11 Correct 135 ms 235172 KB Output is correct
12 Correct 107 ms 235108 KB Output is correct
13 Correct 107 ms 235160 KB Output is correct
14 Correct 89 ms 188180 KB Output is correct
15 Correct 86 ms 188112 KB Output is correct
16 Correct 94 ms 188176 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 188108 KB Output is correct
2 Correct 88 ms 188244 KB Output is correct
3 Correct 85 ms 188148 KB Output is correct
4 Correct 85 ms 188096 KB Output is correct
5 Correct 83 ms 188128 KB Output is correct
6 Correct 114 ms 235144 KB Output is correct
7 Correct 107 ms 235072 KB Output is correct
8 Correct 110 ms 235196 KB Output is correct
9 Correct 104 ms 235120 KB Output is correct
10 Correct 89 ms 188164 KB Output is correct
11 Correct 135 ms 235172 KB Output is correct
12 Correct 107 ms 235108 KB Output is correct
13 Correct 107 ms 235160 KB Output is correct
14 Correct 89 ms 188180 KB Output is correct
15 Correct 86 ms 188112 KB Output is correct
16 Correct 94 ms 188176 KB Output is correct
17 Incorrect 84 ms 188104 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 188108 KB Output is correct
2 Correct 88 ms 188244 KB Output is correct
3 Correct 85 ms 188148 KB Output is correct
4 Correct 85 ms 188096 KB Output is correct
5 Correct 83 ms 188128 KB Output is correct
6 Correct 114 ms 235144 KB Output is correct
7 Correct 107 ms 235072 KB Output is correct
8 Correct 110 ms 235196 KB Output is correct
9 Correct 104 ms 235120 KB Output is correct
10 Correct 89 ms 188164 KB Output is correct
11 Correct 135 ms 235172 KB Output is correct
12 Correct 107 ms 235108 KB Output is correct
13 Correct 107 ms 235160 KB Output is correct
14 Correct 89 ms 188180 KB Output is correct
15 Correct 86 ms 188112 KB Output is correct
16 Correct 94 ms 188176 KB Output is correct
17 Incorrect 84 ms 188104 KB Output isn't correct
18 Halted 0 ms 0 KB -