Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MX=2e5+5;
- int n,Ch[MX][3];
- bool Fuckme(int x,int y)
- {
- int z= 0;
- for(int i=0;i<3;i++)
- z+= (int)Ch[x][i]>Ch[y][i];
- return z>1;
- }
- vector<int> Fuckups;
- int main(){
- cin>>n;
- for(int i=1;i<=n;i++)
- {
- scanf("%d%d%d",&Ch[i][0],&Ch[i][1],&Ch[i][2]);
- }
- for(int i=1;i<=n;i+=500)
- {
- for(int j=i;j<=i+499;j++)
- {
- if(j>n)break;
- bool y=0;
- for(int k=i;k<=i+499;k++)
- {
- if(k>n)break;
- if(k==j)continue;
- if(!Fuckme(k,j)){y=1;break;}
- }
- // cout<<Niggas<<endl;
- if(!y){
- Fuckups.push_back(j);
- }
- }
- }
- if(Fuckups.empty()){
- puts("0");
- return 0;
- }
- int Loser=Fuckups.back();
- for(auto u : Fuckups)
- for(auto p : Fuckups)
- {
- if(u==p)continue;
- int z = (Fuckme(u,p))? p:u;
- Loser = Fuckme(Loser,z)? z : Loser;
- }
- for(int i=1;i<=n;i++)
- {
- if(Fuckme(Loser,i))
- {
- puts("0");
- return 0;
- }
- }
- cout<<1<<'\n'<<Loser;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement