Submission #2851325


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

template<class V> class MaxFlow_Ford {
public:
	struct edge { int to,reve;V cap;};
	static const int MV = 100000;
	vector<edge> E[MV];
	int vis[MV];
	void add_edge(int x,int y,V cap,bool undir=false) {
		E[x].push_back((edge){y,(int)E[y].size(),cap});
		E[y].push_back((edge){x,(int)E[x].size()-1,undir?cap:0});
	}
	V dfs(int from,int to,V cf) {
		V tf;
		if(from==to) return cf;
		vis[from]=1;
		FORR(e,E[from]) if(vis[e.to]==0 && e.cap>0 && (tf = dfs(e.to,to,min(cf,e.cap)))>0) {
			e.cap -= tf;
			E[e.to][e.reve].cap += tf;
			return tf;
		}
		return 0;
	}
	V maxflow(int from, int to) {
		V fl=0,tf;
		while(1) {
			ZERO(vis);
			if((tf = dfs(from,to,numeric_limits<V>::max()))==0) return fl;
			fl+=tf;
		}
	}
};
MaxFlow_Ford<int> mf;

int N;
int U[303];
int D[303];
int L[303];
int R[303];
int A[303][303];
int dx[4]={-1,1,0,0};
int dy[4]={0,0,-1,1};
int vis[303][303];
int sta[303][303];

bool dfs(int y,int x) {
	if(vis[y][x]) return false;
	if(sta[y][x]) {
		sta[y][x]=false;
		return true;
	}
	sta[y][x]=true;
	int cd=A[y][x];
	for(int i=1;i<=N;i++) {
		int ty=y+dy[cd]*i;
		int tx=x+dx[cd]*i;
		if(ty<0 || ty>=N || tx<0 || ty>=0) break;
		if(dfs(ty,tx)) {
			A[ty][tx]=cd;
			if(sta[y][x]) {
				sta[y][x]=false;
				return true;
			}
			else {
				return dfs(y,x);
			}
		}
	}
	sta[y][x]=false;
	vis[y][x]=true;
	if(cd==0) cout<<"L"<<(y+1)<<endl;
	if(cd==1) cout<<"R"<<(y+1)<<endl;
	if(cd==2) cout<<"U"<<(x+1)<<endl;
	if(cd==3) cout<<"D"<<(x+1)<<endl;
	
	return false;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>U[i];
	FOR(i,N) cin>>D[i];
	FOR(i,N) cin>>L[i];
	FOR(i,N) cin>>R[i];
	
	FOR(y,N) mf.add_edge(0,2+y,L[y]+R[y]);
	FOR(x,N) mf.add_edge(0,302+x,U[x]+D[x]);
	FOR(y,N) FOR(x,N) {
		mf.add_edge(2+y,602+y*300+x,1);
		mf.add_edge(302+x,602+y*300+x,1);
		mf.add_edge(602+y*300+x,1,1);
	}
	
	if(mf.maxflow(0,1)!=N*N) return _P("NO\n");
	
	_P("YES\n");
	FOR(y,N) FOR(x,N) {
		FORR(e,mf.E[602+y*300+x]) if(e.cap==1 && e.to>=302 && e.to<602) A[y][x]=2; // UD
	}
	
	FOR(y,N) {
		int tot=0;
		FOR(x,N) if(A[y][x]==0) {
			if(++tot>L[y]) A[y][x]=1;
		}
	}
	FOR(x,N) {
		int tot=0;
		FOR(y,N) if(A[y][x]==2) {
			if(++tot>U[y]) A[y][x]=3;
		}
	}
	
	FOR(y,N) FOR(x,N) dfs(y,x);
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

Submission Info

Submission Time
Task J - Neue Spiel
User kmjp
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3035 Byte
Status WA
Exec Time 4204 ms
Memory 15560 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 2000 0 / 100
Status
AC × 1
WA × 1
AC × 9
WA × 39
AC × 10
WA × 40
TLE × 12
Set Name Test Cases
sample sample-01.txt, sample-02.txt
dataset1 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt
dataset2 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt WA 2 ms 3072 KB
01-02.txt WA 3 ms 3072 KB
01-03.txt WA 2 ms 3072 KB
01-04.txt WA 4 ms 3072 KB
01-05.txt WA 9 ms 3072 KB
01-06.txt WA 21 ms 3200 KB
01-07.txt WA 39 ms 3328 KB
01-08.txt WA 39 ms 3328 KB
01-09.txt WA 8 ms 3072 KB
01-10.txt WA 40 ms 3328 KB
01-11.txt WA 42 ms 3328 KB
01-12.txt WA 35 ms 3328 KB
01-13.txt WA 42 ms 3328 KB
01-14.txt AC 3 ms 2944 KB
01-15.txt WA 33 ms 3328 KB
01-16.txt WA 38 ms 3328 KB
01-17.txt WA 38 ms 3328 KB
01-18.txt WA 39 ms 3328 KB
01-19.txt AC 36 ms 3200 KB
01-20.txt WA 41 ms 3328 KB
01-21.txt WA 40 ms 3328 KB
01-22.txt AC 35 ms 3200 KB
01-23.txt AC 36 ms 3200 KB
01-24.txt WA 39 ms 3328 KB
01-25.txt WA 39 ms 3328 KB
01-26.txt AC 16 ms 3072 KB
01-27.txt WA 17 ms 3200 KB
01-28.txt WA 37 ms 3328 KB
01-29.txt WA 39 ms 3328 KB
01-30.txt WA 39 ms 3328 KB
01-31.txt AC 36 ms 3200 KB
01-32.txt WA 40 ms 3328 KB
01-33.txt AC 35 ms 3200 KB
01-34.txt WA 39 ms 3328 KB
01-35.txt WA 33 ms 3328 KB
01-36.txt WA 34 ms 3328 KB
01-37.txt AC 26 ms 3200 KB
01-38.txt WA 37 ms 3328 KB
01-39.txt WA 38 ms 3328 KB
01-40.txt WA 37 ms 3328 KB
01-41.txt WA 39 ms 3328 KB
01-42.txt WA 38 ms 3328 KB
01-43.txt WA 39 ms 3328 KB
01-44.txt WA 39 ms 3328 KB
01-45.txt WA 39 ms 3328 KB
01-46.txt WA 38 ms 3328 KB
02-01.txt TLE 4204 ms 13364 KB
02-02.txt TLE 4204 ms 15412 KB
02-03.txt TLE 4204 ms 13364 KB
02-04.txt TLE 4204 ms 13364 KB
02-05.txt TLE 4204 ms 15560 KB
02-06.txt TLE 4204 ms 13364 KB
02-07.txt TLE 4204 ms 15412 KB
02-08.txt TLE 4204 ms 13364 KB
02-09.txt TLE 4204 ms 13364 KB
02-10.txt TLE 4204 ms 15412 KB
02-11.txt TLE 4204 ms 13364 KB
02-12.txt TLE 4204 ms 15412 KB
sample-01.txt WA 3 ms 3072 KB
sample-02.txt AC 2 ms 2944 KB