For free

Simulated problem: #include #include #include #include using namespace std; #define LEN 100001 int a[LEN], su[LEN]; int main() { int n, k; while(scanf("%d%d", &n, &k) != EOF) { int i, j

a.cc #include #include using namespace std; int main() { long long xa, xb, xc; long long ya, yb, yc; long long i, j; cin>> xa>> ya>> xb>> yb>> xc>> yc; if((yb-ya)*(xc-xb) == (yc-yb)*(xb-x

用并查集，没有用搜索的方式。中途犯了一点小错误 #include #include #include using namespace std; #define LEN 1010 int p[LEN], x[LEN], y[LEN]; void init() { int i; for(i = 0; i < LEN; i++) { p[i] = i; } } int f