[Offer收割]编程练习赛54 register

Ended

Participants:154

Verdict:Wrong Answer
Score:0 / 100
Submitted:2018-04-08 14:29:12

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
#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(false);\
    cin.tie(0);\
    cout.tie(0);
using namespace std;
typedef long long LL;
const int maxn = 1e6+10;
struct node
{
    int from;
    int to;
    int next;
} edge[maxn<<1];
int head[maxn],tot;
LL xx[maxn];
LL nb[maxn];
int n,q;
void init()
{
    memset(xx,0,sizeof xx);
    memset(nb,0,sizeof nb);
    memset(head,-1,sizeof(head));
    tot = 0;
}
void addedge(int u,int v)
{
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX