QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #137159 | #237. Triangle Partition | Akagi_Ritsuko_219 | 100 ✓ | 8ms | 3760kb | C++20 | 758b | 2023-08-10 00:36:45 | 2023-08-10 00:36:46 |
Judging History
answer
/**
C Triangle Partition
链接:http://acm.hdu.edu.cn/showproblem.php?pid=6300
题意:给出3*n个点 构造出n个不相交的三角形 并且输出他们的编号
签到题 不相交 无限取出最相邻的三个点即可 排序即可实现;
*/
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e4+7;
struct node {
int x,y,id;
bool operator <(const node &a)const {
if(x==a.x) return y<a.y;
return x<a.x;
}
}a[maxn];
int main (){
int t;scanf("%d",&t);
while(t--){
int n;scanf("%d",&n);
for(int i=1;i<=3*n;i++) scanf("%d %d",&a[i].x,&a[i].y),a[i].id=i;
sort(a+1,a+1+3*n);
for(int i=1;i<=3*n;i+=3) printf("%d %d %d\n",a[i].id,a[i+1].id,a[i+2].id);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 8ms
memory: 3760kb
input:
190 10 -7215 2904 -5179 1663 -542 1091 -5687 7868 7838 -1048 -2944 4346 -2780 3959 -9402 1099 -8548 -7238 -3821 -2917 2713 295 -856 -8661 7651 3945 -8216 -543 5798 5024 8583 -3384 -1208 5955 3068 -385 340 2968 6559 -272 4537 5075 5126 4343 639 8281 1700 2572 819 9317 -9854 -1316 -3421 -1137 9368 718...
output:
26 8 9 14 29 1 4 2 10 27 6 7 17 12 3 19 23 25 24 11 18 21 22 15 20 30 13 5 16 28 30 3 18 29 5 17 12 11 27 15 19 10 28 25 9 24 7 13 6 8 23 14 22 2 20 4 16 26 21 1 6 11 16 8 27 10 13 15 14 29 22 19 9 2 18 24 12 20 1 26 4 5 30 7 3 25 23 17 21 28 16 8 18 19 23 13 7 26 24 3 1 5 29 25 27 9 6 15 12 22 14 1...
result:
ok AC