hiho week 38 register

Ended

Participants:420

Verdict:Accepted
Score:100 / 100
Submitted:2015-03-26 13:52:44

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/*
 * Problem:  
 * Author:  SHJWUDP
 * Created Time:  2015/3/26  13:06:10
 * File Name: 233.cpp
 * State: 
 * Memo: 
 */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int MaxA=1e4+7;
const int MaxB=1e5+7;
struct Edge {
    int v, nt;
    int w;
} edges[MaxB<<1];
int head[MaxA], edgeNum;
int N, M, K, T;
bool done[MaxA];
void init() {
    memset(head, -1, sizeof(head[0])*(N+3));
    edgeNum=0;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX