hihoCoder Challenge 1 register

Ended

Participants:902

Verdict:Accepted
Submitted:2014-07-15 21:56:07

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 <algorithm>
#include <iostream>
#include <iomanip>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,102400000")
int n;
vector <int> e[1000001];
vector <int> walk[1000001];
vector <int> car[1000001];
int key[1000001];
int sumKey[1000001];
long long dp[1000001][2][2];
long long dp2[1000001][2];
long long dp3[1000001];
struct edge
{
    int to;
    int walk, car;
    edge *next;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX