二分,贪心
分析1(二分)
考虑二分的mid:
首先,我们的mid一定不能所有列的最大值的最小值mn;
如果>mn,则那一列最大值为mn的一定不满足了;
有了上面这个条件之后,也就是说每一列的最大值都>=mid;
有n个朋友,那么最坏的情况就是这n个满足>=mid的数分布在n个不同的商场里,这是不允许的;
我们最多只能去n-1家商店,因此我们只需要判断是否存在两个人去同一家商店就行了!
注意没给nm的具体范围,所以要vector!
注意二分的写法…下面这种才能过,不知道为啥…
代码
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
//#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 1e5 + 15;
const int N = 2e6 + 7;
const int M = 4e6 + 7;
const int mod = 998244353;
const int inv = mod - mod/2;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
int n,m;
int mx[maxn]; //每一列的最大值
bool check(int mid,vector<vector<int>> &v)
{
for(int i=0;i<m;i++)
{
int cnt = 0;
for(int j=0;j<n;j++)
{
if(v[i][j] >= mid) cnt++;
if(cnt >= 2) return true; //有两个人可以用同一家商店
}
}
return false;
}
void solve()
{
iire(m,n);
for(int i=0;i<n+10;i++) mx[i] = -1;
vector<vector<int>> v(m+10,vector<int>(n+10));
int l = 1, r = -1;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
ire(v[i][j]);
r = max(r,v[i][j]);
mx[j] = max(mx[j],v[i][j]);
}
int mn = inf; //每一列的最大值的最小值
for(int i=0;i<n;i++) mn = min(mn,mx[i]);
while(l < r)
{
int mid = l + r + 1 >> 1;
if(mid <= mn && check(mid,v)) l = mid;
else r = mid - 1;
}
cout<<l<<'\n';
}
int main()
{
int t;
// t = 1;
ire(t);
while(t--)
{
solve();
}
return 0;
}
分析2(贪心)
代码
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
//#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 1e5 + 7;
const int N = 2e6 + 7;
const int M = 4e6 + 7;
const int mod = 998244353;
const int inv = mod - mod/2;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
/*
二分,贪心
贪心参考题解:
https://blog.csdn.net/weixin_46360993/article/details/124595526?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522166005522616782425160185%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=166005522616782425160185&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-124595526-null-null.142^v40^pc_rank_34_1,185^v2^control&utm_term=D.%20New%20Years%20Problem&spm=1018.2226.3001.4449
*/
int n,m;
int mx[maxn]; //每一列的最大值
void solve()
{
iire(m,n);
for(int i=0;i<n+5;i++) mx[i] = -1;
vector<vector<int>> v(m+10,vector<int>(n+10));
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
ire(v[i][j]);
mx[j] = max(mx[j],v[i][j]);
}
int mn = inf; //每一列的最大值的最小值
for(int i=0;i<n;i++) mn = min(mn,mx[i]);
int maxx = -1; //每一行的次大值的最大值
for(int i=0;i<m;i++)
{
vector<int> vv = v[i];
sort(vv.begin(),vv.end());
maxx = max(maxx,vv[vv.size()-2]);
}
if(m <= n-1) cout<<mn<<'\n';
else cout<<min(mn,maxx)<<'\n';
}
int main()
{
int t;
// t = 1;
ire(t);
while(t--)
{
solve();
}
return 0;
}