fyfcauc的专栏

//3452K 735MS C++ #include #include const int MAX = 910; struct TreeNode { int NextBroId; int parentId; }; typedef struct TreeNode TreeNode; int LCACounter[MAX]; int querys[MAX][MAX];

#include #include using namespace std; long long fourEdgeLength[4]; long long lengthSum; long long edgeMaxLength; int caseNum; bool flag; long long sticks[21]; int stickNum; void dfs(int stic

//3996K 672MS G++ #include #include #include #include using namespace std; // int OP[9] = {1+2+8+16, 1+2+4, 2+4+16+32, // 1+8+64, 2+8+16+32+128, 4+32+256, // 8+16+64+12

// 320K 110MS C++ #include #include using namespace std; const int MAX = 110; struct MapInfo { int length; int toll; }; struct Road { int end; int length; int toll; int

// 384K 0MS G++ #include #include using namespace std; int M; int N; const int MAX = 11; // int map[MAX][MAX]; char visitCityFlag[MAX]; char visitRoadFlag[MAX][MAX]; struct Road { int begi

// 164K 32MS C++ #include #include #include using namespace std; // int comp(const void * a,const void * b) // { // return *(int*)a-*(int*)b; // } struct Rectangle{ int x1, y1; int x2, y2;

//25008K 1891MS G++ #include #include #include #include using namespace std; int W; int H; const int MAX = 5010; struct Flatten { int x; int y; }; typedef struct Flatten Flatten; Flatten fl