歐拉環 測資有點tricky~ 只要奇點數量不是0跟2就是無解 /* * GCA : Where is the Dp,there is the wall */ #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <climits> #include <vector> #include <set> #include <map> #include <queue> #include <cctype> #include <utility> #include <ctime> using namespace std; #ifdef DEBUG #define VAR(a,b) decltype(b) a=(b) #define debug(...) printf( "DEBUG: " ),printf(__VA_ARGS__) #else #define VAR(a,b) __typeof(b) a=(b) #define debug(...) #endif typedef long long int Int; #define Set(a,s) memset(a,s, sizeof (a)) #define Pln() printf( "\n" ) #define M 106 #define PB push_back #define oo INT_MAX #define X first #define Y second #define FOR(a,b) for (VAR(a,(b).begin());a!=(b).end();++a) #define eps 1e-9 inline bool xdy( double x, double y){ return x>y+eps;} inline bool xddy( double x, double y){ re...