oj.uz

Submission #237785

# Submission time Handle Problem Language Result Execution time Memory
237785 2020-06-08T18:31:51 Z akat Skandi (COCI20_skandi) C++14
18 / 110
 6 ms 512 KB 
#include<bits/stdc++.h>
using namespace std;
template<class T>
struct MaxFlow 
{
	vector<T>cap;
	vector<int>to,prev,clast,last,level;
	int s,t;
	T INF;
	MaxFlow(int ss,int tt,int n)
	{
		s = ss;
		t = tt;
		INF = 0;
		clast = last = level = vector<int>(n+1,-1);
	}
	void add_edge(int a,int b,T c)
	{
		to.emplace_back(b);
		cap.emplace_back(c);
		prev.emplace_back(last[a]);
		clast[a] = last[a] = to.size() - 1;
		INF = max(INF, c);
	}
	bool bfs()
	{
		static int cnt = 0;
		cnt++;
		int i,x;
		fill(level.begin(), level.end(), 0);
		level[t]=1;
		queue<int>q;
		q.push(t);
		while(q.size())
		{
			x=q.front();
			q.pop();
			for(i=clast[x];i>-1;i=prev[i])
				if(!level[to[i]] && cap[i^1])
				{
					level[to[i]]=level[x]+1;
					q.push(to[i]);
				}
		}
		return level[s]!=0;
	}
	T dfs(int x,T cflow)
	{
		if(x==t)return cflow;
		int i;
		T flow;
		for(i=clast[x];i>-1;i=clast[x]=prev[i])
		{
			if(cap[i] && level[x]==level[to[i]]+1)
			{
				flow=dfs(to[i],min(cflow,cap[i]));
				if(flow)
				{
					cap[i]-=flow;
					cap[i^1]+=flow;
					return flow;
				}
			}
		}
		return 0;
	}
	T maxflow()
	{
		T ans=0,cans;
		while(bfs())
		{
			while((cans=dfs(s,INF)))
				ans+=cans;
			clast = last;
		}
		return ans;
	}
	vector<int> min_vertex_cover()
	{
		vector<int>type(last.size(),2);
		int i, x;
		queue<int>q;
		for(i = last[s]; i > -1; i = prev[i])
		{
			type[to[i]] = 0;
			if(cap[i] == 0) type[to[i]] = 3;
			else q.push(to[i]);
		}
		type[s] = type[t] = 0;
		while(q.size())
		{
			x = q.front();
			q.pop();
			for(i = last[x]; i > -1; i = prev[i])
				if(type[to[i]] > 1)
				{
					if(type[to[i]] == 2)
					{
						type[to[i]] = 1;
						q.push(to[i]);
					}
					else if(cap[i] == 1)
					{
						type[to[i]] = 0;
						q.push(to[i]);
					}
				}
		}
		vector<int>ans;
		for( i = 0; i < (int)last.size(); i++)
			if(type[i] % 2 == 1) ans.emplace_back(i);
		return ans;
	}
};
const int N = 10;
int main()
{
	int n, m, i, j, vert[N][N], horz[N][N], cntv = 0, cnth = 0;
	char c[N][N];
	vector<pair<int,int>> v, h;
	cin>>n>>m;
	for(i = 0 ; i < n; i++)
		for(j = 0; j < m; j++)
		{
			cin>>c[i][j];
			if(c[i][j] == '1')continue;
			if(i != 0)
			{
				if(c[i-1][j] == '1')
				{
					vert[i][j] = cntv++;
					v.push_back({i,j+1});
				}
				else vert[i][j] = vert[i-1][j];
			}
			if(j != 0)
			{
				if(c[i][j-1] == '1')
				{
					horz[i][j] = cnth++;
					h.push_back({i+1,j});
				}
				else horz[i][j] = horz[i][j-1];
			}
		}
	MaxFlow<int>F(0, 1, cntv + cnth + 1);
	for(i = 0 ; i < n; i++)
		for(j = 0; j < m; j++)
			if(c[i][j] == '0') 
			{
				F.add_edge(vert[i][j] + 2, horz[i][j] + cntv + 2, 1);
				F.add_edge(horz[i][j] + cntv + 2, vert[i][j] + 2, 0);
			}
	for(i = 0; i < cntv; i++)
	{
		F.add_edge(0, i + 2, 1);
		F.add_edge(i + 2, 0, 0);
	}
	for(i = 0; i < cnth; i++)
	{
		F.add_edge(i + 2 + cntv, 1, 1);
		F.add_edge(1, i + 2 + cntv, 0);
	}
	cout<<F.maxflow()<<"\n";
	vector<int>cover = F.min_vertex_cover();
	pair<int,int>x;
	for(i = 0; i < (int)cover.size(); i++)
	{
		if(cover[i] >= cntv + 2)
		{
			x = h[cover[i] - 2 - cntv];
			cout<<x.first<<" "<<x.second<<" DESNO\n";
		}
		else
		{
			x = v[cover[i] - 2];
			cout<<x.first<<" "<<x.second<<" DOLJE\n";
		}
	}
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Correct.
2 Correct 5 ms 256 KB Correct.
3 Correct 5 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 5 ms 256 KB Correct.
6 Correct 4 ms 256 KB Correct.
7 Correct 5 ms 384 KB Correct.
8 Correct 5 ms 256 KB Correct.
9 Correct 4 ms 256 KB Correct.
10 Correct 5 ms 256 KB Correct.
11 Correct 5 ms 432 KB Correct.
12 Correct 5 ms 512 KB Correct.
13 Correct 4 ms 256 KB Correct.
14 Correct 5 ms 256 KB Correct.
15 Correct 4 ms 384 KB Correct.
16 Correct 5 ms 256 KB Correct.
17 Correct 4 ms 256 KB Correct.
18 Correct 6 ms 384 KB Correct.
19 Correct 5 ms 256 KB Correct.
20 Correct 5 ms 256 KB Correct.
21 Correct 5 ms 256 KB Correct.
22 Correct 5 ms 256 KB Correct.
23 Correct 5 ms 256 KB Correct.

Subtask #2
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Correct.
2 Correct 5 ms 256 KB Correct.
3 Correct 5 ms 384 KB Correct.
4 Correct 5 ms 384 KB Correct.
5 Correct 5 ms 256 KB Correct.
6 Correct 4 ms 256 KB Correct.
7 Correct 5 ms 384 KB Correct.
8 Correct 5 ms 256 KB Correct.
9 Correct 4 ms 256 KB Correct.
10 Correct 5 ms 256 KB Correct.
11 Correct 5 ms 432 KB Correct.
12 Correct 5 ms 512 KB Correct.
13 Correct 4 ms 256 KB Correct.
14 Correct 5 ms 256 KB Correct.
15 Correct 4 ms 384 KB Correct.
16 Correct 5 ms 256 KB Correct.
17 Correct 4 ms 256 KB Correct.
18 Correct 6 ms 384 KB Correct.
19 Correct 5 ms 256 KB Correct.
20 Correct 5 ms 256 KB Correct.
21 Correct 5 ms 256 KB Correct.
22 Correct 5 ms 256 KB Correct.
23 Correct 5 ms 256 KB Correct.
24 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -