CodeForces 1619D New Year's Problem

合集 - Codeforces(21)

1.CodeForces 1992E Novice's Mistake2024-07-16 2.CodeForces 1935A Entertainment in MAC2024-06-16 3.CodeForces 1992C Gorilla and Permutation2024-07-16 4.CodeForces 1992D Test of Love2024-07-16 5.CodeForces 1992B Angry Monk2024-07-16 6.CodeForces 1992A Only Pluses2024-07-16 7.CodeForces 1983B Corner Twist2024-07-16 8.CodeForces 1983A Array Divisibility2024-07-16 9.CodeForces 1983C Have Your Cake and Eat It Too2024-07-16 10.CodeForces 1883B Chemistry2024-07-26 11.CodeForces 1883A Morning2024-07-26 12.CodeForces 1883C Raspberries2024-07-28 13.CodeForces 1883D In Love2024-07-28 14.CodeForces 1883E Look Back2024-07-28 15.CodeForces 1883F You Are So Beautiful2024-07-28 16.CodeForces 1883G1 Dances (Easy version)2024-07-28 17.CodeForces 908B New Year and Buggy Bot2024-08-01 18.CodeForces 908C New Year and Curling2024-08-01 19.CodeForces 1132B Discounts2024-08-01

20.CodeForces 1619D New Year's Problem2024-08-01

21.Codeforces Round 964 (Div. 4)2024-08-07

题目链接：CodeForces 1619D【New Year's Problem】

思路

可以因为最多只能逛n - 1个商店，当n - 1大于等于m的时候，所有朋友都能取最大值，否则至少有两个人要选择相同的商店，所以依次枚举两个人选择同一个商店，其他人选择喜悦值最大的商店。

代码

 #include <cstddef>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
const int N = 2e5 + 10;
 
ll a[N], num[N], maxn[N];
 
void solve() {
  memset(num, 0, sizeof num);
  memset(maxn, 0, sizeof maxn);
 
  // n is the number of friend 
  int n, m;
  cin >> m >> n;
  vector<vector<ll>> ve(m + 1, vector<ll>(n + 1));
  
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> ve[i][j];
      maxn[j] = max(maxn[j], ve[i][j]);
    }
  }
  ll minn = 1e9;
  for (int i = 1; i <= n; i++) {
    minn = min(minn, maxn[i]);
  }
 
 
  ll res = 0; 
  if (n - 1 >= m) {
    res = minn;
  } else {
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= n; j++) {
        for (int k = j + 1; k <= n; k++) {
          // 选两个人在同一个商店买礼物
          res = max(res, min(minn, min(ve[i][j], ve[i][k])));
        }
      }
    }
  }
  cout << res << endl;
}
 
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
 
  return 0;
}

posted @ 2024-08-01 16:53 薛定谔的AC 阅读(6) 评论(0) 编辑收藏举报

againss

CodeForces 1619D New Year's Problem

思路

代码

公告

搜索

常用链接

合集

随笔分类

随笔档案

阅读排行榜

推荐排行榜

	#include <cstddef>
	#include <cstring>
	#include <iostream>
	#include <algorithm>
	#include <vector>
	using namespace std;
	#define ll long long
	const int N = 2e5 + 10;

	ll a[N], num[N], maxn[N];

	void solve() {
	memset(num, 0, sizeof num);
	memset(maxn, 0, sizeof maxn);

	// n is the number of friend
	int n, m;
	cin >> m >> n;
	vector<vector<ll>> ve(m + 1, vector<ll>(n + 1));

	for (int i = 1; i <= m; i++) {
	for (int j = 1; j <= n; j++) {
	cin >> ve[i][j];
	maxn[j] = max(maxn[j], ve[i][j]);
	}
	}
	ll minn = 1e9;
	for (int i = 1; i <= n; i++) {
	minn = min(minn, maxn[i]);
	}


	ll res = 0;
	if (n - 1 >= m) {
	res = minn;
	} else {
	for (int i = 1; i <= m; i++) {
	for (int j = 1; j <= n; j++) {
	for (int k = j + 1; k <= n; k++) {
	// 选两个人在同一个商店买礼物
	res = max(res, min(minn, min(ve[i][j], ve[i][k])));
	}
	}
	}
	}
	cout << res << endl;
	}

	int main() {
	int t;
	cin >> t;
	while (t--) {
	solve();
	}

	return 0;
	}