oj.uz

Submission #729394

# Submission time Handle Problem Language Result Execution time Memory
729394 2023-04-24T02:26:03 Z pcc Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 420 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<short,short>

const int mxn = 3030;

struct Edge{
	int to;
	short 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,(short)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<int> 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*n+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*n+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++){
		int tar = (right[i]/n-1)*n+(right[i]%n+1);
		if(!right[i]/n||right[i]%n+1>=m)tar = -1;
		auto p1 = lower_bound(_all(down),tar)-down.begin();
		if(p1 != down.size()&&down[p1]==tar)
			addedge(i+1,p1+right.size()+1);
		tar = (right[i]/n-2)*n+right[i]%n+2;
		if((right[i]/n-2)<0||right[i]%n+2>=m)tar = -1;
		p1 = lower_bound(_all(down),tar)-down.begin();
		if(p1 != down.size()&&down[p1] == tar)
			addedge(i+1,p1+right.size()+1);
		p1 = lower_bound(_all(down),right[i])-down.begin();
		if(p1 != down.size()&&down[p1] == right[i])
			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<<',';cout<<endl;
	for(auto &i:right)cout<<i<<',';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;
		}
	}

   */
	int sz = right.size()+down.size();
	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<<sz-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<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |  for(int i = 0;i<right.size();i++){
      |                ~^~~~~~~~~~~~~
dango_maker.cpp:95:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |   if(p1 != down.size()&&down[p1]==tar)
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:100:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |   if(p1 != down.size()&&down[p1] == tar)
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:103:9: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |   if(p1 != down.size()&&down[p1] == right[i])
      |      ~~~^~~~~~~~~~~~~~
dango_maker.cpp:106:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |  for(int i = 1;i<=right.size();i++)addedge(0,i);
      |                ~^~~~~~~~~~~~~~
dango_maker.cpp:107:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |  for(int i = right.size()+1;i<paths.size();i++)addedge(i,paths.size()-1);
      |                             ~^~~~~~~~~~~~~
dango_maker.cpp:125:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  125 |   while(re = dfs(0,mxn*mxn))ans+= re;
      |         ~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 420 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 Incorrect 1 ms 340 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 420 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 Incorrect 1 ms 340 KB Output isn't correct
20 Halted 0 ms 0 KB -