Gym - 101149F The Weakest Sith （结构体排序）

The Weakest Sith

time limit per test

2.0 s

memory limit per test

256 MB

input

standard input

output

standard output

In a galaxy far, far away the great galactic empire had collapsed after the death of the emperor, and now a new corrupted galactic republic gradually grows stronger. But the evil Sith don't spend time in vain: they've created opposition named «The last order» and now they are planning to choose a leader by a fair tournament.

In the tournament there will be n Siths who has left alive. The i-th of these Siths has three integer characteristics: mastery of lightsabers ai, mastery of the Force bi and the level of mental balance ci. All characteristics of all Siths are different. The tournament consists of one on one fights. The winner of each of these fights is the Sith who has at least two characteristics that are bigger than their opponent's corresponding ones.

The problem is that the Sith tournaments have never been organized to find the strongest Sith who could beat anyone else: instead, they were supposed to distinguish the weakest one, somebody who couldn't win any fight, and to let everybody take a good laugh at that loser. It seems like such Sith will become the leader of «The last order», so it'd be good to know them in advance.

Input

The first line contains a single integer n (2 ≤ n ≤ 2·105) — the number of the Siths who will participate in the tournament.

Each of the next n lines contains three space-separated integers: ai, bi, ci (1 ≤ ai, bi, ci ≤ 109) — the three corresponding characteristics of the i-th Sith.

Output

In the first line output a single integer — the number of Siths who can't win any fight.

In the second line print the numbers of those Siths separated by a space.

Examples

input

4
3 11 9
1 4 8
5 2 10
12 7 6

output

1
2

input

3
700 40 1
50 2 800
3 900 60

output

0

恕我无知，，再做这个题之前竟然不知到这样排序。。

只有一个人两个成绩都小于另外一个人才算输

问你能否有一个人输给其他所有人。。

结构体排序。

cmp函数

bool cmp(data a,data b)
{
    int cnt=0;
    if(a.a>b.a)
        cnt++;
    if(a.b>b.b)
        cnt++;
    if(a.c>b.c)
        cnt++;
    if(cnt<2)
        return true;
    else return false;
}

然后给大家代码。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 200005
struct data
{
    int a,b,c;
    int id;
}a[N];
bool cmp(data a,data b)
{
    int cnt=0;
    if(a.a>b.a)
        cnt++;
    if(a.b>b.b)
        cnt++;
    if(a.c>b.c)
        cnt++;
    if(cnt<2)
        return true;
    else return false;
}

int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d%d",&a[i].a,&a[i].b,&a[i].c);
            a[i].id=i;
        }
        sort(a+1,a+n+1,cmp);
        int Flag=0;
        for(int i=2; i<=n; i++)
        {
            if(cmp(a[1],a[i]))
                continue;
            else Flag=1;
        }
        if(Flag)
            printf("0\n");
        else printf("1\n%d\n",a[1].id);
    }
}