oj.uz

Submission #958975

# Submission time Handle Problem Language Result Execution time Memory
958975 2024-04-07T10:36:56 Z vjudge1 Ideal city (IOI12_city) C++17
0 / 100
 1000 ms 2648 KB 
//#include "city.h"
#include <bits/stdc++.h>
using namespace std;

const vector<pair<int, int>> dir = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};

int ans;
set<pair<int, int>> st, vis;

void bfs(int X, int Y) {
  queue<tuple<int, int, int>> q;
  q.push(make_tuple(0, X, Y));
  while (!q.empty()) {
    int d = get<0>(q.front());
    int x = get<1>(q.front());
    int y = get<2>(q.front());
    q.pop();

    if (vis.find(make_pair(x, y)) != vis.end()) continue;
    vis.insert(make_pair(x, y));

    ans += d;

    for (auto [a, b] : dir) {
      if (st.find(make_pair(x+a, y+b)) != st.end() &&
      vis.find(make_pair(x+a, y+b)) == vis.end()) {
        q.push(make_tuple(d+1, x+a, y+b));
      }
    }
  }
}

int DistanceSum(int N, int *X, int *Y) {
  ans = 0;

  for (int i = 0; i < N; i++) {
    st.insert(make_pair(X[i], Y[i]));
  }

  for (int i = 0; i < N; i++) {
    vis.clear();
    bfs(X[i], Y[i]);
  }

  return ans;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 547 ms 528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1102 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1030 ms 2640 KB Time limit exceeded
2 Halted 0 ms 0 KB -