oj.uz

답안 #1013564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013564 2024-07-03T16:29:29 Z spacewalker 이상적인 도시 (IOI12_city) C++14
0 / 100
 1000 ms 3220 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
constexpr ll MOD = 1'000'000'000;

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

int DistanceSum(int N, int *X, int *Y) {
  cerr << "!!! BRUTE SOLUTION " << endl;
  map<pair<int, int>, int> cell_index;
  for (int i = 0; i < N; ++i) cell_index[{X[i], Y[i]}] = i;
  vector<vector<int>> graph(N);
  for (int i = 0; i < N; ++i) {
    for (auto [dx, dy] : dirs) {
      int nx = X[i] + dx, ny = Y[i] + dy;
      auto possible_index = cell_index.find({nx, ny});
      if (possible_index != cell_index.end()) {
        graph[i].push_back(possible_index->second);
      }
    }
  }

  ll ans = 0;
  for (int i = 0; i < N; ++i) {
    vector<int> dist(N, -1);
    dist[i] = 0;
    queue<int> q;
    q.push(i);
    while (!q.empty()) {
      int cur = q.front(); q.pop();
      for (int nxt : graph[cur]) {
        if (dist[nxt] != -1) continue;
        dist[nxt] = dist[cur] + 1;
        q.push(nxt);
      }
    }
    ans += accumulate(dist.begin(), dist.end(), 0LL);
  }
  return ans;
}

Compilation message

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:16:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   16 |     for (auto [dx, dy] : dirs) {
      |               ^

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1061 ms 3164 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1051 ms 3220 KB Time limit exceeded
2 Halted 0 ms 0 KB -