oj.uz

Submission #164509

# Submission time Handle Problem Language Result Execution time Memory
164509 2019-11-21T07:55:46 Z balbit Dango Maker (JOI18_dango_maker) C++14
13 / 100
 155 ms 165440 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*maxn/3],my[maxn*maxn/3];
bool vy[maxn*maxn/3];
vector<int> edge[maxn*maxn/3];
vector<int>id; 
clock_t stT;

int N, M;
int greedy_matching()
{
    int c = 0;
    for (int x=0; x<N; ++x) {
    	int at = id[x];
        if (mx[at] == -1) {
            for (auto y : edge[at]) {
                if (my[y] == -1) {
                        mx[at] = y; my[y] = at;
                        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));
 	REP(i,N) id.pb(i); random_shuffle (ALL(id));
    int c = greedy_matching();
 
    for (int x=0; x<N; ++x){
    	if (mx[id[x]] == -1)  
        {
            fill(vy, vy+M, 0);
            if (DFS(x)) c++;
            if(clock()- stT >= CLOCKS_PER_SEC * 1.9) return c; 
        }
	}
        
    return c;
}

char grd[maxn][maxn];

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


signed main(){
	IOS();
	srand(time(0));
	stT = clock();
	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;
	
}

Compilation message

dango_maker.cpp: In function 'int bipartite_matching()':
dango_maker.cpp:7:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i,a,b) for (int i = a; i<b; i++)
                    ^
dango_maker.cpp:8:18: note: in expansion of macro 'FOR'
 #define REP(i,n) FOR(i,0,n)
                  ^~~
dango_maker.cpp:73:3: note: in expansion of macro 'REP'
   REP(i,N) id.pb(i); random_shuffle (ALL(id));
   ^~~
dango_maker.cpp:73:22: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   REP(i,N) id.pb(i); random_shuffle (ALL(id));
                      ^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 165240 KB Output is correct
2 Correct 152 ms 165384 KB Output is correct
3 Correct 153 ms 165296 KB Output is correct
4 Correct 153 ms 165368 KB Output is correct
5 Correct 152 ms 165304 KB Output is correct
6 Correct 150 ms 165320 KB Output is correct
7 Correct 152 ms 165292 KB Output is correct
8 Correct 155 ms 165320 KB Output is correct
9 Correct 152 ms 165348 KB Output is correct
10 Correct 153 ms 165356 KB Output is correct
11 Correct 152 ms 165440 KB Output is correct
12 Correct 152 ms 165340 KB Output is correct
13 Correct 153 ms 165368 KB Output is correct
14 Correct 151 ms 165340 KB Output is correct
15 Correct 152 ms 165304 KB Output is correct
16 Correct 153 ms 165368 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 165240 KB Output is correct
2 Correct 152 ms 165384 KB Output is correct
3 Correct 153 ms 165296 KB Output is correct
4 Correct 153 ms 165368 KB Output is correct
5 Correct 152 ms 165304 KB Output is correct
6 Correct 150 ms 165320 KB Output is correct
7 Correct 152 ms 165292 KB Output is correct
8 Correct 155 ms 165320 KB Output is correct
9 Correct 152 ms 165348 KB Output is correct
10 Correct 153 ms 165356 KB Output is correct
11 Correct 152 ms 165440 KB Output is correct
12 Correct 152 ms 165340 KB Output is correct
13 Correct 153 ms 165368 KB Output is correct
14 Correct 151 ms 165340 KB Output is correct
15 Correct 152 ms 165304 KB Output is correct
16 Correct 153 ms 165368 KB Output is correct
17 Correct 151 ms 165336 KB Output is correct
18 Correct 150 ms 165380 KB Output is correct
19 Correct 154 ms 165380 KB Output is correct
20 Incorrect 151 ms 165352 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 165240 KB Output is correct
2 Correct 152 ms 165384 KB Output is correct
3 Correct 153 ms 165296 KB Output is correct
4 Correct 153 ms 165368 KB Output is correct
5 Correct 152 ms 165304 KB Output is correct
6 Correct 150 ms 165320 KB Output is correct
7 Correct 152 ms 165292 KB Output is correct
8 Correct 155 ms 165320 KB Output is correct
9 Correct 152 ms 165348 KB Output is correct
10 Correct 153 ms 165356 KB Output is correct
11 Correct 152 ms 165440 KB Output is correct
12 Correct 152 ms 165340 KB Output is correct
13 Correct 153 ms 165368 KB Output is correct
14 Correct 151 ms 165340 KB Output is correct
15 Correct 152 ms 165304 KB Output is correct
16 Correct 153 ms 165368 KB Output is correct
17 Correct 151 ms 165336 KB Output is correct
18 Correct 150 ms 165380 KB Output is correct
19 Correct 154 ms 165380 KB Output is correct
20 Incorrect 151 ms 165352 KB Output isn't correct
21 Halted 0 ms 0 KB -