louchenyao

#include <cstdio>

using namespace std;

bool gt[7][4][4];
bool unanimity[37][7];

char* profile_str[7];

louchenyao

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct Edge {
    int u, v;
    double weight;
    bool operator < (const Edge & e) const {

louchenyao

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
typedef long double LD;
const int kN = 1e5+10;
int N;
LL D;
LL A[kN], X[kN], SUM[kN];
 

louchenyao

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int kN = 300000+10;
int N, M;
vector<int> G[kN];
bool have_bomb[kN];
int T, need;
 

louchenyao

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int kN = 1e5+10;
const int kK = 20+2;
int N, S, K;
vector<int> G[kN];
long long need[kN][kK], have[kN][kK];
int deep[kN], fa[kN];

louchenyao

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<int, int> PII;
const int kN = 5000+10;
const int INF = 1e9;
int N, M, first_dis[kN], last_dis[kN];
vector<PII> G[kN];