Submission #1205529

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>P;

int p[40][40];
P ba[500];
P ca[500];
string res[500];

int main(){
	int h,w,k,t;
	cin>>h>>w>>k>>t;
	
	for(int i=0;i<k;i++){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		ba[i]=P(a,b);
		ca[i]=P(c,d);
		p[a][b]=1;
		p[c][d]=1;
		}
		
		for(int i=0;i<k;i++){
			if(ba[i].first<ca[i].first){
				if(!p[ba[i].first+1][ba[i].second]){swap(p[ba[i].first][ba[i].second],p[ba[i].first+1][ba[i].second]);
			res[i].push_back('R');
			}
			else res[i].push_back('-');
				}
			else{
				if(!p[ba[i].first-1][ba[i].second]){
					swap(p[ba[i].first][ba[i].second],p[ba[i].first-1][ba[i].second]);
					res[i].push_back('L');
					}
					else res[i].push_back('-');
				}	
			}
			
		cout<<1<<endl;
		for(int i=0;i<k;i++)cout<<res[0];
		cout<<endl;	
		
	return 0;
	}

Submission Info

Judge Result