이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define MOD 1000000007
int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, ans = 0;
	cin >> n;
	int x[n], y[n];
	for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
	if(n == 1) {
		cout << -1;
		return 0;
	}
	int grid[401][401];
	memset(grid, -1, sizeof(grid));
	for(int i = 0; i < 401; i++) {
		for(int j = 0; j < 401; j++) {
			if(grid[i][j] != -1) continue;
			queue<pair<int, int>> q;
			q.push({i,j});
			grid[i][j] = ans;
			while(!q.empty()) {
				pair<int, int> c = q.front();
				q.pop();
				for(int r = 0; r < n; r++) {
					for(int s = 0; s < n; s++) {
						int nx = c.first+x[r]-x[s];
						int ny = c.second+y[r]-y[s];
						if(nx < 0 || nx > 400 || ny < 0 || ny > 400) continue;
						if(grid[nx][ny] != -1) continue;
						grid[nx][ny] = ans;
						q.push({nx, ny});
					}
				}
			}
			ans++;
		}
	}
	cout << ans;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |