A~Minimums and Maximums
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 201000;
int t;
int main()
{
cin>>t;
while(t--)
{
int l1,r1,l2,r2;
cin>>l1>>r1>>l2>>r2;
if(l2>=l1&&l2<=r1) cout<<l2<<'\n';
else if(l1>=l2&&l1<=r2) cout<<l1<<'\n';
else cout<<l1+l2<<'\n';
}
return 0;
}
B~Robots
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 20;
int t;
//n==1 || g[1][1]==R yes
//
int main()
{
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
char g[N][N];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>g[i][j];
if(n==1||g[1][1]=='R')
{
cout<<"YES\n";
continue;
}
int i1,j1,min1=25;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
if(g[i][j]=='R')
if(i+j<min1)
{
min1=i+j;
i1=i;
j1=j;
}
}
//cout<<i1<<" "<<j1;
int ok=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
if(g[i][j]=='R')
{
if(i<i1||j<j1)
{
ok=0;
}
}
}
if(ok==0) cout<<"NO\n";
else cout<<"YES\n";
}
return 0;
}
由于博主比较菜,只会这两题~~下次补题