A. Robot Cleaner
#include<bits/stdc++.h>
using namespace std;
int t;
int n,m;
int rb,cb,rd,cd;// robot dirty cell
int dr,dc;
inline bool judge(int a,int b)
{
if(a==rd||b==cd) return true;
return false;
}
int main()
{
cin>>t;
while(t--)
{
dr = 1,dc = 1;
cin>>n>>m>>rb>>cb>>rd>>cd;
int ans = 0;
int x = rb,y = cb;
while(1)
{
if(judge(x,y)) break;
int t1 = x+dr,t2 = y+dc;
if(t1<1||t1>n) dr=-dr;
if(t2<1||t2>m) dc=-dc;
x = x+dr,y = y + dc;
++ans;
}
cout<<ans<<endl;
}
return 0;
}
B. Game on Ranges
#include<bits/stdc++.h>
using namespace std;
int t;
int l,r;
int n;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define x first
#define y second
const int N = 1010;
pip s[N];//ranges
pip ans[N];//order
bool st[N];
int main()
{
cin>>t;
while(t--)
{
memset(st,false,sizeof st);
cin>>n;
int p=0,q=0;
for(int i=0;i<n;++i)
{
cin>>l>>r;
if(l==r)
{
ans[p].x=l,ans[p].y.x=l,ans[p].y.y=l;
st[l]=true;
p++;
}
else
{
int t = r-l;
s[q].x=t,s[q].y.x=l,s[q].y.y=r;
q++;
}
}
sort(s,s+q);
for(int i=1;i<=n;++i)
{
if(st[i]) continue;
for(int j=0;j<q;++j)
{
if(i>=s[j].y.x&&i<=s[j].y.y)
{
ans[p].x=s[j].y.x,ans[p].y.x=s[j].y.y,ans[p].y.y=i;
p++;
st[i]=true;
break;
}
}
}
for(int i=0;i<p;++i)
{
cout<<ans[i].x<<' '<<ans[i].y.x<<' '<<ans[i].y.y<<endl;
}
}
return 0;
}