oj.uz

Submission #729373

# Submission time Handle Problem Language Result Execution time Memory
729373 2023-04-24T01:56:41 Z pcc Dango Maker (JOI18_dango_maker) C++14
33 / 100
 741 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
#define _all(a) a.begin(),a.end()
#define pii pair<int,int>

const int mxn = 3030;

struct Edge{
	int to;
	int cap;
	Edge(){}
	Edge(int tt,int cc){
		to = tt,cap = cc;
	}
};

vector<Edge> edges;
vector<vector<int>> paths;
vector<int> level;
string s[mxn];
int st,ed;

void addedge(int a,int b){
	paths[a].push_back(edges.size());
	edges.push_back(Edge(b,1));
	paths[b].push_back(edges.size());
	edges.push_back(Edge(a,0));
}

bool bfs(){
	queue<int> q;
	fill(level.begin(),level.end(),-1);
	level[0] = 0;
	q.push(0);
	while(!q.empty()){
		auto now = q.front();
		q.pop();
		for(auto &id:paths[now]){
			if(!edges[id].cap)continue;
			auto nxt = edges[id].to;
			if(level[nxt] == -1){
				level[nxt] = level[now]+1;
				q.push(nxt);
			}
		}
	}
	return level[ed] != -1;
}

int dfs(int now,int lim){
	if(now == ed)return lim;
	int ans = 0;
	for(auto &id:paths[now]){
		if(!edges[id].cap)continue;
		if(!lim)break;
		auto nxt = edges[id].to;
		if(level[nxt] != level[now]+1)continue;
		auto re = dfs(nxt,min(edges[id].cap,lim));
		if(re == 0)continue;
		edges[id].cap -= re;
		edges[id^1].cap += re;
		ans += re;
		lim -= re;
	}
	return ans;
}

void solve(){
	int n,m;
	cin>>n>>m;
	for(int i =0 ;i<n;i++)cin>>s[i];
	vector<pii> right,down;
	for(int i = 0;i<n-2;i++){
		for(int j = 0;j<m;j++){
			if(s[i][j] == 'R'&&s[i+1][j] == 'G'&&s[i+2][j] == 'W')down.push_back({i,j});
		}
	}
	for(int i = 0;i<n;i++){
		for(int j = 0;j<m-2;j++){
			if(s[i].substr(j,3)=="RGW")right.push_back({i,j});
		}
	}
	sort(right.begin(),right.end());
	sort(down.begin(),down.end());
	paths = vector<vector<int>>(right.size()+down.size()+2);
	for(int i = 0;i<right.size();i++){
		auto p1 = lower_bound(_all(down),make_pair(right[i].fs-1,right[i].sc+1))-down.begin();
		if(p1 != down.size()&&down[p1].fs == right[i].fs-1&&down[p1].sc == right[i].sc+1)
			addedge(i+1,p1+right.size()+1);
		p1 = lower_bound(_all(down),make_pair(right[i].fs-2,right[i].sc+2))-down.begin();
		if(p1 != down.size()&&down[p1].fs == right[i].fs-2&&down[p1].sc == right[i].sc+2)
			addedge(i+1,p1+right.size()+1);
		p1 = lower_bound(_all(down),right[i])-down.begin();
		if(p1 != down.size()&&down[p1].fs == right[i].fs&&down[p1].sc == right[i].sc)
			addedge(i+1,p1+right.size()+1);
	}
	for(int i = 1;i<=right.size();i++)addedge(0,i);
	for(int i = right.size()+1;i<paths.size();i++)addedge(i,paths.size()-1);
	/*
	for(auto &i:down)cout<<i.fs<<' '<<i.sc<<',';cout<<endl;
	for(auto &i:right)cout<<i.fs<<' '<<i.sc<<',';cout<<endl;
	for(int i = 1;i<=right.size();i++){
		for(auto &id:paths[i]){
			if(edges[id].to == 0)continue;
			cout<<i<<','<<edges[id].to<<endl;
		}
	}

   */
	level = vector<int>(paths.size());
	int ans = 0;
	st = 0,ed = paths.size()-1;
	while(bfs()){
		int re;
		while(re = dfs(0,mxn*mxn))ans+= re;
	}
	cout<<right.size()+down.size()-ans;
	return;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	solve();
}

Compilation message

dango_maker.cpp: In function 'void solve()':
dango_maker.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |  for(int i = 0;i<right.size();i++){
      |                ~^~~~~~~~~~~~~
dango_maker.cpp:93:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   if(p1 != down.size()&&down[p1].fs == right[i].fs-1&&down[p1].sc == right[i].sc+1)
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:96:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |   if(p1 != down.size()&&down[p1].fs == right[i].fs-2&&down[p1].sc == right[i].sc+2)
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:99:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |   if(p1 != down.size()&&down[p1].fs == right[i].fs&&down[p1].sc == right[i].sc)
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:102:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |  for(int i = 1;i<=right.size();i++)addedge(0,i);
      |                ~^~~~~~~~~~~~~~
dango_maker.cpp:103:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |  for(int i = right.size()+1;i<paths.size();i++)addedge(i,paths.size()-1);
      |                             ~^~~~~~~~~~~~~
dango_maker.cpp:120:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  120 |   while(re = dfs(0,mxn*mxn))ans+= re;
      |         ~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 416 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 412 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 420 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 416 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 412 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 416 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 412 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 420 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 416 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 412 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 416 KB Output is correct
55 Correct 1 ms 416 KB Output is correct
56 Correct 2 ms 724 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 53 ms 9836 KB Output is correct
59 Correct 482 ms 80312 KB Output is correct
60 Correct 484 ms 80496 KB Output is correct
61 Correct 452 ms 80032 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 449 ms 77584 KB Output is correct
64 Runtime error 741 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -