oj.uz

Submission #164514

# Submission time Handle Problem Language Result Execution time Memory
164514 2019-11-21T08:25:52 Z balbit Dango Maker (JOI18_dango_maker) C++14
33 / 100
 593 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define f first
#define s second
#define FOR(i,a,b) for (int i = a; i<b; i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i = n-1; i>=0; i--)
#define SZ(x) (int)(x.size())
#define ALL(x) x.begin(),x.end()
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define pb push_back
#ifdef BALBIT
#define IOS()
#define bug(x) cerr<<__LINE__<<' '<<#x<<": "<<x<<endl
#else
#define IOS() ios::sync_with_stdio(0),cin.tie(0)
#define endl '\n'
#define bug(x)
#endif

const ll mod = 1e9+7;
const int maxn = 3e3+5;
//const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iinf = 0x3f3f3f3f;


#define MAX 1000001
#define NIL 0
#define INF (1<<28)

vector< int > G[MAX];
int N, M, match[MAX], dist[MAX];
// n: number of nodes on left side, nodes are numbered 1 to n
// m: number of nodes on right side, nodes are numbered n+1 to n+m
// G = NIL[0] ∪ G1[G[1---n]] ∪ G2[G[n+1---n+m]]

bool bfs() {
    int i, u, v, len;
    queue< int > Q;
    for(i=1; i<=N; i++) {
        if(match[i]==NIL) {
            dist[i] = 0;
            Q.push(i);
        }
        else dist[i] = INF;
    }
    dist[NIL] = INF;
    while(!Q.empty()) {
        u = Q.front(); Q.pop();
        if(u!=NIL) {
            len = G[u].size();
            for(i=0; i<len; i++) {
                v = G[u][i];
                if(dist[match[v]]==INF) {
                    dist[match[v]] = dist[u] + 1;
                    Q.push(match[v]);
                }
            }
        }
    }
    return (dist[NIL]!=INF);
}

bool dfs(int u) {
    int i, v, len;
    if(u!=NIL) {
        len = G[u].size();
        for(i=0; i<len; i++) {
            v = G[u][i];
            if(dist[match[v]]==dist[u]+1) {
                if(dfs(match[v])) {
                    match[v] = u;
                    match[u] = v;
                    return true;
                }
            }
        }
        dist[u] = INF;
        return false;
    }
    return true;
}

int hopcroft_karp() {
    int matching = 0, i;
    // match[] is assumed NIL for all vertex in G
    while(bfs())
        for(i=1; i<=N; i++)
            if(match[i]==NIL && dfs(i))
                matching++;
    return matching;
}
	


char grd[maxn][maxn];

int idup[maxn][maxn];
int idrt[maxn][maxn];

void add(int a, int b, int c){
//	return;
	G[a+1].pb(b+1);
}

signed main(){
	IOS();
	int n, m; cin>>n>>m;
	
	REP(i,n) REP(j,m) cin>>grd[i][j];
	int nup = 0, nrt = 0;
	memset(idup, -1, sizeof(idup));
	memset(idrt, -1, sizeof(idrt));
	REP(i,n)REP(j,m){

		if(grd[i][j]=='G'){
			if (i && i!=n-1 && grd[i-1][j] == 'R' && grd[i+1][j]=='W' ) {
				idup[i][j] = nup++;
			}
			if (j && j!=m-1 && grd[i][j-1] == 'R' && grd[i][j+1]=='W' ) {
				idrt[i][j] = nrt ++;
			}
		}
	}

	N = nup; M = nrt;
//	g.resize(N); ptr.resize(N); level.resize(N);
	REP(i,n) REP(j,m){
		if(idup[i][j]!=-1){
//			cout<<i<<' '<<j<<' '<<idup[i][j]<<endl;

			if(idrt[i][j] != -1) {
				add(idup[i][j], idrt[i][j] + nup, iinf);
			}
			if(i && idrt[i-1][j+1]!=-1){
				add(idup[i][j], idrt[i-1][j+1] + nup, iinf);
			}
			if(j && idrt[i+1][j-1]!=-1){
				add(idup[i][j], idrt[i+1][j-1] + nup, iinf);
			}
		}

	}
	cout<<nup + nrt - hopcroft_karp() << endl;
	
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 94584 KB Output is correct
2 Correct 94 ms 94456 KB Output is correct
3 Correct 88 ms 94504 KB Output is correct
4 Correct 86 ms 94456 KB Output is correct
5 Correct 87 ms 94584 KB Output is correct
6 Correct 87 ms 94524 KB Output is correct
7 Correct 86 ms 94584 KB Output is correct
8 Correct 88 ms 94480 KB Output is correct
9 Correct 88 ms 94556 KB Output is correct
10 Correct 87 ms 94532 KB Output is correct
11 Correct 87 ms 94456 KB Output is correct
12 Correct 88 ms 94512 KB Output is correct
13 Correct 87 ms 94576 KB Output is correct
14 Correct 87 ms 94456 KB Output is correct
15 Correct 88 ms 94580 KB Output is correct
16 Correct 92 ms 94556 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 94584 KB Output is correct
2 Correct 94 ms 94456 KB Output is correct
3 Correct 88 ms 94504 KB Output is correct
4 Correct 86 ms 94456 KB Output is correct
5 Correct 87 ms 94584 KB Output is correct
6 Correct 87 ms 94524 KB Output is correct
7 Correct 86 ms 94584 KB Output is correct
8 Correct 88 ms 94480 KB Output is correct
9 Correct 88 ms 94556 KB Output is correct
10 Correct 87 ms 94532 KB Output is correct
11 Correct 87 ms 94456 KB Output is correct
12 Correct 88 ms 94512 KB Output is correct
13 Correct 87 ms 94576 KB Output is correct
14 Correct 87 ms 94456 KB Output is correct
15 Correct 88 ms 94580 KB Output is correct
16 Correct 92 ms 94556 KB Output is correct
17 Correct 85 ms 94544 KB Output is correct
18 Correct 86 ms 94584 KB Output is correct
19 Correct 88 ms 94540 KB Output is correct
20 Correct 87 ms 94584 KB Output is correct
21 Correct 86 ms 94712 KB Output is correct
22 Correct 86 ms 94584 KB Output is correct
23 Correct 86 ms 94584 KB Output is correct
24 Correct 86 ms 94584 KB Output is correct
25 Correct 86 ms 94584 KB Output is correct
26 Correct 86 ms 94456 KB Output is correct
27 Correct 87 ms 94712 KB Output is correct
28 Correct 86 ms 94496 KB Output is correct
29 Correct 87 ms 94584 KB Output is correct
30 Correct 100 ms 94584 KB Output is correct
31 Correct 86 ms 94584 KB Output is correct
32 Correct 87 ms 94584 KB Output is correct
33 Correct 88 ms 94584 KB Output is correct
34 Correct 86 ms 94584 KB Output is correct
35 Correct 87 ms 94688 KB Output is correct
36 Correct 86 ms 94584 KB Output is correct
37 Correct 91 ms 94556 KB Output is correct
38 Correct 87 ms 94584 KB Output is correct
39 Correct 90 ms 94584 KB Output is correct
40 Correct 92 ms 94792 KB Output is correct
41 Correct 87 ms 94484 KB Output is correct
42 Correct 88 ms 94584 KB Output is correct
43 Correct 87 ms 94556 KB Output is correct
44 Correct 88 ms 94712 KB Output is correct
45 Correct 107 ms 94560 KB Output is correct
46 Correct 91 ms 94780 KB Output is correct
47 Correct 87 ms 94556 KB Output is correct
48 Correct 86 ms 94584 KB Output is correct
49 Correct 86 ms 94584 KB Output is correct
50 Correct 86 ms 94584 KB Output is correct
51 Correct 86 ms 94536 KB Output is correct
52 Correct 87 ms 94712 KB Output is correct
53 Correct 86 ms 94588 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 94584 KB Output is correct
2 Correct 94 ms 94456 KB Output is correct
3 Correct 88 ms 94504 KB Output is correct
4 Correct 86 ms 94456 KB Output is correct
5 Correct 87 ms 94584 KB Output is correct
6 Correct 87 ms 94524 KB Output is correct
7 Correct 86 ms 94584 KB Output is correct
8 Correct 88 ms 94480 KB Output is correct
9 Correct 88 ms 94556 KB Output is correct
10 Correct 87 ms 94532 KB Output is correct
11 Correct 87 ms 94456 KB Output is correct
12 Correct 88 ms 94512 KB Output is correct
13 Correct 87 ms 94576 KB Output is correct
14 Correct 87 ms 94456 KB Output is correct
15 Correct 88 ms 94580 KB Output is correct
16 Correct 92 ms 94556 KB Output is correct
17 Correct 85 ms 94544 KB Output is correct
18 Correct 86 ms 94584 KB Output is correct
19 Correct 88 ms 94540 KB Output is correct
20 Correct 87 ms 94584 KB Output is correct
21 Correct 86 ms 94712 KB Output is correct
22 Correct 86 ms 94584 KB Output is correct
23 Correct 86 ms 94584 KB Output is correct
24 Correct 86 ms 94584 KB Output is correct
25 Correct 86 ms 94584 KB Output is correct
26 Correct 86 ms 94456 KB Output is correct
27 Correct 87 ms 94712 KB Output is correct
28 Correct 86 ms 94496 KB Output is correct
29 Correct 87 ms 94584 KB Output is correct
30 Correct 100 ms 94584 KB Output is correct
31 Correct 86 ms 94584 KB Output is correct
32 Correct 87 ms 94584 KB Output is correct
33 Correct 88 ms 94584 KB Output is correct
34 Correct 86 ms 94584 KB Output is correct
35 Correct 87 ms 94688 KB Output is correct
36 Correct 86 ms 94584 KB Output is correct
37 Correct 91 ms 94556 KB Output is correct
38 Correct 87 ms 94584 KB Output is correct
39 Correct 90 ms 94584 KB Output is correct
40 Correct 92 ms 94792 KB Output is correct
41 Correct 87 ms 94484 KB Output is correct
42 Correct 88 ms 94584 KB Output is correct
43 Correct 87 ms 94556 KB Output is correct
44 Correct 88 ms 94712 KB Output is correct
45 Correct 107 ms 94560 KB Output is correct
46 Correct 91 ms 94780 KB Output is correct
47 Correct 87 ms 94556 KB Output is correct
48 Correct 86 ms 94584 KB Output is correct
49 Correct 86 ms 94584 KB Output is correct
50 Correct 86 ms 94584 KB Output is correct
51 Correct 86 ms 94536 KB Output is correct
52 Correct 87 ms 94712 KB Output is correct
53 Correct 86 ms 94588 KB Output is correct
54 Correct 87 ms 94556 KB Output is correct
55 Correct 93 ms 103288 KB Output is correct
56 Correct 88 ms 94588 KB Output is correct
57 Correct 93 ms 100600 KB Output is correct
58 Correct 121 ms 99408 KB Output is correct
59 Correct 370 ms 112568 KB Output is correct
60 Correct 412 ms 112560 KB Output is correct
61 Correct 367 ms 112524 KB Output is correct
62 Correct 88 ms 94584 KB Output is correct
63 Correct 380 ms 112204 KB Output is correct
64 Runtime error 593 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
65 Halted 0 ms 0 KB -