Submission #994721

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
994721	2024-06-08 04:28:05	hmm789	Portal (BOI24_portal)	C++14	1 / 100	2092 ms	1372 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#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];
  int X = 301, Y = 301;
  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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 29
• Subtask 5: 0 / 15
• Subtask 6: 0 / 35