oj.uz

Submission #994714

# Submission time Handle Problem Language Result Execution time Memory
994714 2024-06-08T04:18:59 Z hmm789 Portal (BOI24_portal) C++14
0 / 100
 2000 ms 3040 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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 X = 401, Y = 401;
	int grid[X][Y];
	memset(grid, -1, sizeof(grid));
	for(int i = 0; i < X; i++) {
		for(int j = 0; j < Y; 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 >= X || ny < 0 || ny >= Y) continue;
						if(grid[nx][ny] != -1) continue;
						grid[nx][ny] = ans;
						q.push({nx, ny});
					}
				}
			}
			ans++;
		}
	}
	cout << ans;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 6 ms 1704 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 6 ms 1704 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 2089 ms 3040 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1624 KB Output is correct
2 Correct 7 ms 1716 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2096 ms 1628 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 6 ms 1704 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 6 ms 1704 KB Output isn't correct
3 Halted 0 ms 0 KB -