oj.uz

Submission #164505

# Submission time Handle Problem Language Result Execution time Memory
164505 2019-11-21T07:44:45 Z balbit Dango Maker (JOI18_dango_maker) C++14
33 / 100
 218 ms 149916 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;

int mx[maxn],my[maxn];
bool vy[maxn];
vector<int> edge[maxn];

int N, M;
int greedy_matching()
{
    int c = 0;
    for (int x=0; x<N; ++x) {
        if (mx[x] == -1) {
            for (auto y : edge[x]) {
                if (my[y] == -1) {
                        mx[x] = y; my[y] = x;
                        c++;
                        break;
                }
            }
        }
    }
    return c;
}
 
bool DFS(int x)
{
    for (auto y : edge[x]) {
        if (!vy[y]) {
            vy[y] = true;
            if (my[y] == -1 || DFS(my[y]))
            {
                mx[x] = y; my[y] = x;
                return true;
            }
        }
    }
    return false;
}

int bipartite_matching()
{
    memset(mx, -1, sizeof(mx));
    memset(my, -1, sizeof(my));
 
    int c = greedy_matching();
 
    for (int x=0; x<N; ++x)
        if (mx[x] == -1)  
        {
            memset(vy, false, sizeof(vy));
            if (DFS(x)) c++;
        }
    return c;
}

char grd[maxn][maxn];

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


signed main(){
	IOS();
	int n, m; cin>>n>>m;
	assert(n!=3000 || m!=3000);
	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;
//	Dinic dd (N,S,T);
	REP(i,n) REP(j,m){
		if(idup[i][j]!=-1){
//			cout<<i<<' '<<j<<' '<<idup[i][j]<<endl;

			if(idrt[i][j] != -1) {
				edge[idup[i][j]].pb(idrt[i][j]);
			}
			if(i && idrt[i-1][j+1]!=-1){
				edge[idup[i][j]].pb(idrt[i-1][j+1]);
			}
			if(j && idrt[i+1][j-1]!=-1){
				edge[idup[i][j]].pb(idrt[i+1][j-1]);
			}
		}

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 71160 KB Output is correct
2 Correct 62 ms 71160 KB Output is correct
3 Correct 64 ms 71160 KB Output is correct
4 Correct 64 ms 71188 KB Output is correct
5 Correct 63 ms 71160 KB Output is correct
6 Correct 64 ms 71176 KB Output is correct
7 Correct 63 ms 71160 KB Output is correct
8 Correct 63 ms 71088 KB Output is correct
9 Correct 64 ms 71228 KB Output is correct
10 Correct 64 ms 71160 KB Output is correct
11 Correct 64 ms 71164 KB Output is correct
12 Correct 64 ms 71160 KB Output is correct
13 Correct 64 ms 71160 KB Output is correct
14 Correct 65 ms 71160 KB Output is correct
15 Correct 63 ms 71064 KB Output is correct
16 Correct 64 ms 71160 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 71160 KB Output is correct
2 Correct 62 ms 71160 KB Output is correct
3 Correct 64 ms 71160 KB Output is correct
4 Correct 64 ms 71188 KB Output is correct
5 Correct 63 ms 71160 KB Output is correct
6 Correct 64 ms 71176 KB Output is correct
7 Correct 63 ms 71160 KB Output is correct
8 Correct 63 ms 71088 KB Output is correct
9 Correct 64 ms 71228 KB Output is correct
10 Correct 64 ms 71160 KB Output is correct
11 Correct 64 ms 71164 KB Output is correct
12 Correct 64 ms 71160 KB Output is correct
13 Correct 64 ms 71160 KB Output is correct
14 Correct 65 ms 71160 KB Output is correct
15 Correct 63 ms 71064 KB Output is correct
16 Correct 64 ms 71160 KB Output is correct
17 Correct 63 ms 71096 KB Output is correct
18 Correct 63 ms 71160 KB Output is correct
19 Correct 65 ms 71128 KB Output is correct
20 Correct 63 ms 71160 KB Output is correct
21 Correct 65 ms 71160 KB Output is correct
22 Correct 77 ms 71288 KB Output is correct
23 Correct 66 ms 71160 KB Output is correct
24 Correct 66 ms 71132 KB Output is correct
25 Correct 65 ms 71144 KB Output is correct
26 Correct 65 ms 71160 KB Output is correct
27 Correct 63 ms 71160 KB Output is correct
28 Correct 65 ms 71116 KB Output is correct
29 Correct 66 ms 71160 KB Output is correct
30 Correct 66 ms 71160 KB Output is correct
31 Correct 64 ms 71160 KB Output is correct
32 Correct 65 ms 71192 KB Output is correct
33 Correct 64 ms 71160 KB Output is correct
34 Correct 64 ms 71160 KB Output is correct
35 Correct 65 ms 71236 KB Output is correct
36 Correct 63 ms 71164 KB Output is correct
37 Correct 64 ms 71160 KB Output is correct
38 Correct 68 ms 71160 KB Output is correct
39 Correct 72 ms 71184 KB Output is correct
40 Correct 64 ms 71160 KB Output is correct
41 Correct 63 ms 71160 KB Output is correct
42 Correct 64 ms 71164 KB Output is correct
43 Correct 65 ms 71160 KB Output is correct
44 Correct 63 ms 71160 KB Output is correct
45 Correct 64 ms 71160 KB Output is correct
46 Correct 68 ms 71160 KB Output is correct
47 Correct 63 ms 71160 KB Output is correct
48 Correct 70 ms 71160 KB Output is correct
49 Correct 70 ms 71204 KB Output is correct
50 Correct 67 ms 71160 KB Output is correct
51 Correct 63 ms 71188 KB Output is correct
52 Correct 64 ms 71184 KB Output is correct
53 Correct 73 ms 71160 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 71160 KB Output is correct
2 Correct 62 ms 71160 KB Output is correct
3 Correct 64 ms 71160 KB Output is correct
4 Correct 64 ms 71188 KB Output is correct
5 Correct 63 ms 71160 KB Output is correct
6 Correct 64 ms 71176 KB Output is correct
7 Correct 63 ms 71160 KB Output is correct
8 Correct 63 ms 71088 KB Output is correct
9 Correct 64 ms 71228 KB Output is correct
10 Correct 64 ms 71160 KB Output is correct
11 Correct 64 ms 71164 KB Output is correct
12 Correct 64 ms 71160 KB Output is correct
13 Correct 64 ms 71160 KB Output is correct
14 Correct 65 ms 71160 KB Output is correct
15 Correct 63 ms 71064 KB Output is correct
16 Correct 64 ms 71160 KB Output is correct
17 Correct 63 ms 71096 KB Output is correct
18 Correct 63 ms 71160 KB Output is correct
19 Correct 65 ms 71128 KB Output is correct
20 Correct 63 ms 71160 KB Output is correct
21 Correct 65 ms 71160 KB Output is correct
22 Correct 77 ms 71288 KB Output is correct
23 Correct 66 ms 71160 KB Output is correct
24 Correct 66 ms 71132 KB Output is correct
25 Correct 65 ms 71144 KB Output is correct
26 Correct 65 ms 71160 KB Output is correct
27 Correct 63 ms 71160 KB Output is correct
28 Correct 65 ms 71116 KB Output is correct
29 Correct 66 ms 71160 KB Output is correct
30 Correct 66 ms 71160 KB Output is correct
31 Correct 64 ms 71160 KB Output is correct
32 Correct 65 ms 71192 KB Output is correct
33 Correct 64 ms 71160 KB Output is correct
34 Correct 64 ms 71160 KB Output is correct
35 Correct 65 ms 71236 KB Output is correct
36 Correct 63 ms 71164 KB Output is correct
37 Correct 64 ms 71160 KB Output is correct
38 Correct 68 ms 71160 KB Output is correct
39 Correct 72 ms 71184 KB Output is correct
40 Correct 64 ms 71160 KB Output is correct
41 Correct 63 ms 71160 KB Output is correct
42 Correct 64 ms 71164 KB Output is correct
43 Correct 65 ms 71160 KB Output is correct
44 Correct 63 ms 71160 KB Output is correct
45 Correct 64 ms 71160 KB Output is correct
46 Correct 68 ms 71160 KB Output is correct
47 Correct 63 ms 71160 KB Output is correct
48 Correct 70 ms 71160 KB Output is correct
49 Correct 70 ms 71204 KB Output is correct
50 Correct 67 ms 71160 KB Output is correct
51 Correct 63 ms 71188 KB Output is correct
52 Correct 64 ms 71184 KB Output is correct
53 Correct 73 ms 71160 KB Output is correct
54 Correct 63 ms 71096 KB Output is correct
55 Correct 71 ms 79980 KB Output is correct
56 Correct 65 ms 71160 KB Output is correct
57 Correct 69 ms 77048 KB Output is correct
58 Runtime error 218 ms 149916 KB Execution killed with signal 11 (could be triggered by violating memory limits)
59 Halted 0 ms 0 KB -