Codeforces Round #378 (Div. 2) D. Kostya the Sculptor map+pair
3 seconds
256 megabytes
standard input
standard output
Kostya is a genial sculptor, he has an idea: to carve a marble sculpture in the shape of a sphere. Kostya has a friend Zahar who works at a career. Zahar knows about Kostya's idea and wants to present him a rectangular parallelepiped of marble from which he can carve the sphere.
Zahar has n stones which are rectangular parallelepipeds. The edges sizes of the i-th of them are ai, bi and ci. He can take no more than two stones and present them to Kostya.
If Zahar takes two stones, he should glue them together on one of the faces in order to get a new piece of rectangular parallelepiped of marble. Thus, it is possible to glue a pair of stones together if and only if two faces on which they are glued together match as rectangles. In such gluing it is allowed to rotate and flip the stones in any way.
Help Zahar choose such a present so that Kostya can carve a sphere of the maximum possible volume and present it to Zahar.
The first line contains the integer n (1 ≤ n ≤ 105).
n lines follow, in the i-th of which there are three integers ai, bi and ci (1 ≤ ai, bi, ci ≤ 109) — the lengths of edges of the i-th stone. Note, that two stones may have exactly the same sizes, but they still will be considered two different stones.
In the first line print k (1 ≤ k ≤ 2) the number of stones which Zahar has chosen. In the second line print k distinct integers from 1 to n — the numbers of stones which Zahar needs to choose. Consider that stones are numbered from 1 to n in the order as they are given in the input data.
You can print the stones in arbitrary order. If there are several answers print any of them.
6
5 5 5
3 2 4
1 4 1
2 1 3
3 2 4
3 3 4
1
1
7
10 7 8
5 10 3
4 2 6
5 5 5
10 2 8
4 2 1
7 7 7
2
1 5
In the first example we can connect the pairs of stones:
- 2 and 4, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
- 2 and 5, the size of the parallelepiped: 3 × 2 × 8 or 6 × 2 × 4 or 3 × 4 × 4, the radius of the inscribed sphere 1, or 1, or 1.5 respectively.
- 2 and 6, the size of the parallelepiped: 3 × 5 × 4, the radius of the inscribed sphere 1.5
- 4 and 5, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
- 5 and 6, the size of the parallelepiped: 3 × 4 × 5, the radius of the inscribed sphere 1.5
Or take only one stone:
- 1 the size of the parallelepiped: 5 × 5 × 5, the radius of the inscribed sphere 2.5
- 2 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
- 3 the size of the parallelepiped: 1 × 4 × 1, the radius of the inscribed sphere 0.5
- 4 the size of the parallelepiped: 2 × 1 × 3, the radius of the inscribed sphere 0.5
- 5 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
- 6 the size of the parallelepiped: 3 × 3 × 4, the radius of the inscribed sphere 1.5
It is most profitable to take only the first stone.
题意:给你n个长方题,每次可以取1个或者两个拼接,求使得内接圆半径最大;输出方案;
思路:map标记;排个序可以减少5次,懒得改了;
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=2e5+,M=4e6+,inf=1e9+,mod=1e9+;
const ll INF=1e18+;
map<pair<int,int>,pair<int,int> >mp;
int a[];
vector<int>v;
int min(int x,int y,int z)
{
return min(x,min(y,z));
}
int ans;
void update(int a,int b,int c,int i)
{
int minnn=min(a,b,c+mp[make_pair(a,b)].first);
//cout<<minnn<<endl;
if(minnn>ans)
{
ans=minnn;
v.clear();
v.push_back(i);
v.push_back(mp[make_pair(a,b)].second);
}
}
void hh(int a,int b,int c,int i)
{
if(c>mp[make_pair(a,b)].first)
{
mp[make_pair(a,b)]=make_pair(c,i);
}
}
int main()
{
int n;
ans=;
scanf("%d",&n);
for(int i=;i<=n;i++)
{
scanf("%d%d%d",&a[],&a[],&a[]);
int minn=min(a[],a[],a[]);
if(minn>ans)
{
ans=minn;
v.clear();
v.push_back(i);
}
update(a[],a[],a[],i);
update(a[],a[],a[],i);
update(a[],a[],a[],i);
update(a[],a[],a[],i);
update(a[],a[],a[],i);
update(a[],a[],a[],i);
hh(a[],a[],a[],i);
hh(a[],a[],a[],i);
hh(a[],a[],a[],i);
hh(a[],a[],a[],i);
hh(a[],a[],a[],i);
hh(a[],a[],a[],i);
}
printf("%d\n",v.size());
for(int i=;i<v.size();i++)
printf("%d ",v[i]);
return ;
}
最新文章
- [OpenCV] Samples 12: laplace
- HashSet的故事----Jdk源码解读
- C#生成验证码
- JQ的基本架构
- 第1部分: 游戏引擎介绍, 渲染和构造3D世界
- java解析excel2003和excel2007:The supplied data appears to be in the office 2007+XML Polonly supports OLE2 office documents
- lintcode : 二叉树的最小深度
- Entity Freamwork 6连接PostgreSql数据库
- MySQL主主复制+LVS+Keepalived实现MySQL高可用性
- SecureCRT 中 python 命令行使用退格键(backspace)出现 ^H 解决办法
- [Android学习笔记]LayoutInflater的使用
- 四大OLAP工具选型浅析
- PIC32MZ Live update bootloader
- 学习C语言第一天!
- AsnycTask的内部的实现机制
- 【转】详解springboot-修改内置tomcat版本
- SQL Server-聚焦事务、隔离级别详解(二十九)
- numpy教程
- net自定义安装程序快捷方式
- MFC中format函数用法