『杭电1960』Taxi Cab Scheme

#include<stdio.h>
#include<string.h>

#define N_node 500 + 50
#define N_edge 300000

typedef struct
{
   int to ,next;
}STAR;

typedef struct
{
   int t;
   int xs ,xe ,ys ,ye;
   int time;
}NODE;

STAR E[N_edge];
NODE node[N_node];
int list[N_node] ,tot;
int mk_dfs[N_node] ,mk_gx[N_node];

void add(int a ,int b)
{
   E[++tot].to = b;
   E[tot].next = list[a];
   list[a] = tot;
}

int abss(int x)
{
   return x > 0 ? x : -x;
}

int maxx(int x ,int y)
{
   return x