oj.uz

답안 #943900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943900 2024-03-12T04:11:26 Z vjudge1 Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 185 ms 11600 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
  return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
  return a < b ? (a = b) == b : false;
}

const vector<int> dx = {-1, -1, -1, 0, 0, 1, 1, 1};
const vector<int> dy = {-1, 0, 1, -1, 1, -1, 0, 1};

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, t; cin >> n >> t;
  int x[n], y[n];
  map<int, map<int, bool>> vis;
  map<int, map<int, int>> used;
  map<int, vector<int>> g;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    used[x[i]][y[i]] = i + 1;
    g[x[i] + y[i]].push_back(i);
  }
  int Min = -1;
  for (int i = 0; i < n; ++i) {
    bool flag = false;
    for (int j = 0; j < 8; ++j) {
      if (used[x[i] + dx[j]][y[i] + dy[j]]) {
        flag |= true;
      }
    }
    if (Min == -1 || x[i] + y[i] < x[Min] + y[Min]) {
      Min = i;
    }
    if (!flag) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  queue<int> q;
  q.push(Min);
  vis[x[Min]][y[Min]] = true;
  while (!q.empty()) {
    int i = q.front();
    cout << i + 1 << '\n';
    q.pop();
    for (int j = 0; j < 8; ++j) {
      int to_x = x[i] + dx[j], to_y = y[i] + dy[j];
      if (used[to_x][to_y]) {
        if (!vis[to_x][to_y]) {
          vis[to_x][to_y] = true;
          q.push(used[to_x][to_y] - 1);
        }
      }
    }
  }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Contestant did not find solution
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Contestant did not find solution
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Contestant did not find solution
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB ans=NO N=1934
2 Correct 1 ms 604 KB ans=NO N=1965
3 Incorrect 3 ms 604 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Contestant did not find solution
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 7004 KB ans=NO N=66151
2 Correct 31 ms 6484 KB ans=NO N=64333
3 Incorrect 185 ms 11600 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 57283)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB ans=NO N=1934
2 Correct 1 ms 604 KB ans=NO N=1965
3 Incorrect 3 ms 604 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -