Codeforces_733D
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个长方体的长宽高,一次可以取一个,或者如果两个长方体有相同面,那么可以将这两个长方体通过相同面连接起来,最多可以连两个长方体。问要取的长方体的内接球的半径最大,应该取哪一个或者哪两个。
思路:先算出取一个能取的最大值,再算两个的。长方体内接球的半径受限于最短边,也就是说如果要将两个拼接起来,若不增加最短边,那么结果不可能大于取一个的最大值。接下来就暴力了。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>
using namespace std;
#define N 100005
#define INF 1e9+5
struct Node
{
int a,b,c,index;
} node[N]; bool cmp(Node x,Node y)
{
if(x.a>y.a)
return ;
else if(x.a==y.a)
{
if(x.b>y.b)
return ;
else if(x.b==y.b)
{
if(x.c>y.c)
return ;
else
return ;
}
else
return ;
}
else
return ;
} int getR(int a,int b,int c)
{
int minx=INF;
minx=min(minx,a);
minx=min(minx,b);
minx=min(minx,c);
return minx;
} int main()
{
int n;
scanf("%d",&n);
int num[];
for(int i=; i<n; i++)
{
scanf("%d%d%d",&num[],&num[],&num[]);
sort(num,num+);
node[i].a=num[];
node[i].b=num[];
node[i].c=num[];
node[i].index=i+;
}
sort(node,node+n,cmp);
int aa=-,bb=-,maxn=;
for(int i=; i<n; i++)
{
int tmp=getR(node[i].a,node[i].b,node[i].c);
if(tmp>maxn)
{
maxn=tmp;
aa=node[i].index;
}
}
for(int i=; i<n; i++)
{
if(node[i].a==node[i-].a&&node[i].b==node[i-].b)
{
int tmp=getR(node[i].a,node[i].b,node[i].c+node[i-].c);
if(tmp>maxn)
{
maxn=tmp;
aa=node[i].index;
bb=node[i-].index;
}
}
}
if(aa>&&bb>)
{
printf("2\n");
printf("%d %d\n",aa,bb);
}
else
{
printf("1\n");
printf("%d",aa);
}
return ;
}
Codeforces_733D的更多相关文章
随机推荐
- 微信最新开源的PhxSQL
在编者看到“[重磅]微信开源PhxSQL:高可用.强一致的MySQL集群”时,由衷赞叹,这等造福广大DBA及运维同仁的事情,真心赞.腾讯及微信的开放,真的不是说说而已. 本文由资深DB从业者撰写,相信 ...
- 《Sams Teach Yourself Windows® Workflow Foundation in 24 Hours》读书笔记目录
目录 1 Part I - The Basics 1.1 Hour 1 - Understanding Windows Workflow Foundation 1.2 Hour 2 - A Spin ...
- shell中的四种模式匹配
POSIX为shell为进行模式匹配提供了四种参数替换结构(老版本的shell可能不支持),每种结构有两个参数:变量名(或变量号)及模式. 第一种模式: ${variable%pattern}, ...
- hp 1810-24g switch reset
Specific steps to execute the factory default reset on the switch are: 1. Using a small, thin tool w ...
- URAL 2031. Overturned Numbers (枚举)
2031. Overturned Numbers Time limit: 1.0 second Memory limit: 64 MB Little Pierre was surfing the In ...
- C++学习之模板特例化
模板是C++中一个很重要的特性,写一份代码能用于多种数据类型(包括用户自定义类型).例如,STL的sort()函数可以用于多种数据类型的排序,类stack可以用作多种数据类型的栈.但是,如果我们想对特 ...
- 【转】在Oracle中查看各个表、表空间占用空间的大小
查看当前用户每个表占用空间的大小: select segment_name,sum(bytes)/1024/1024 from user_extents group by segment_nam ...
- 20170410 --- Linux备课资料 --- 压缩与解压缩
这节课我们来学习一下压缩与解压缩,那什么是压缩与解压缩呢? 联想一下Windows系统: 选中文件,右键选择即可 如果压缩,可以选择要压缩的格式,而解压缩直接选择就可以完成了 Linux是通过命令的方 ...
- ALSA声卡驱动中的DAPM详解之五:建立widget之间的连接关系
前面我们主要着重于codec.platform.machine驱动程序中如何使用和建立dapm所需要的widget,route,这些是音频驱动开发人员必须要了解的内容,经过前几章的介绍,我们应该知道如 ...
- vue实现全选,反选
1.example.vue <template> <table class="table-common"> <tr> <th class= ...