Contest Duration: ~ (local time) (120 minutes) Back to Home

Submission #5943792

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
struct UnionFind {
vector<int> par; // uf(x,y)->y
UnionFind() {}
UnionFind(int NV) { init(NV); }
void init(int NV) { par.clear(); rep(i, 0, NV) par.push_back(i); }
void reset() { rep(i, 0, par.size()) par[i] = i; }
int operator[](int x) { return par[x] == x ? x : par[x] = operator[](par[x]); }
void operator()(int x, int y) { x = operator[](x); y = operator[](y); if (x != y) par[x] = y; }
};
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i     @hamayanhamayan
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N, X[50], Y[50];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> X[i] >> Y[i];

if (N == 1) {
cout << 1 << endl;
return;
}

int ans = inf;
rep(a, 0, N) rep(b, a + 1, N) {
int p = X[a] - X[b];
int q = Y[a] - Y[b];

if (p == 0 and q == 0) continue;

UnionFind uf(N);
rep(i, 0, N) rep(j, 0, N) if (X[i] + p == X[j] and Y[i] + q == Y[j]) uf(i, j);

int cst = 0;
rep(i, 0, N) if (uf[i] == i) cst++;
chmin(ans, cst);
}

cout << ans << endl;
}

```

#### Submission Info

Submission Time 2019-06-16 10:40:15+0900 B - Picking Up hamayanhamayan C++14 (GCC 5.4.1) 300 2299 Byte AC 6 ms 256 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 5 ms 256 KB
04.txt 5 ms 256 KB
05.txt 6 ms 256 KB
06.txt 6 ms 256 KB
07.txt 5 ms 256 KB
08.txt 3 ms 256 KB
09.txt 5 ms 256 KB
10.txt 5 ms 256 KB
11.txt 6 ms 256 KB
12.txt 5 ms 256 KB
13.txt 6 ms 256 KB
14.txt 6 ms 256 KB
15.txt 6 ms 256 KB
16.txt 6 ms 256 KB
17.txt 6 ms 256 KB
18.txt 6 ms 256 KB
19.txt 6 ms 256 KB
20.txt 6 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB