[Graph] v1

#include <cstdio>
#include <deque>
#include <algorithm>
#define in "in.txt"
struct Bus {
    int x, y;
    int t1, t2;
    bool operator< (Bus const & o) const { // overload operator bool
        return t1 < o.t1;
    }
} edge[100005];
int main() {
    int n, T, ne;
    FILE *f;
    f = fopen(in, "rt");
    if(f==NULL)
    {
        printf("error");
        exit(0);
    }
    fscanf(f,"%d%d%d", &n, &T, &ne);
    for (int i = 0; i < ne; i ++) {
        int u, v, s, e;
        fscanf(f,"%d%d%d%d", &u, &v, &s, &e);
        edge[i].x = u;
        edge[i].y = v;
        edge[i].t1 = s;
        edge[i].t2 = e;
        perm[i] = i;
    }