oj.uz

답안 #1072652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072652 2024-08-24T01:52:32 Z PenguinsAreCute Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 25 ms 6296 KB 
#include <bits/stdc++.h>
using namespace std;
using i2 = pair<int,int>;
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(v) begin(v),end(v)
#define sz(v) int(v.size())
vector<int> perm;
bitset<150005> vis;
vector<int> adj[150005];
void dfs(int x) {
  perm.push_back(x);
  vis[x]=1;
  for(auto i: adj[x]) if(!vis[i]) dfs(i);
}
struct block {int x, y, i;};
vector<int> build_skyscrapers(int t, vector<int> r, vector<int> c) {
  int n = r.size();
  block lst[n];
  for(int i=0;i<n;i++) lst[i]={r[i],c[i],i};
  auto lamb = [](block a, block b){return i2(a.x,a.y)<i2(b.x,b.y);};
  sort(lst,lst+n,lamb);
  int dx[8]={-1,-1,-1,0,0,1,1,1}, dy[8]={-1,0,1,-1,1,-1,0,1};
  for(int i=0;i<n;i++) for(int j=0;j<8;j++) {
    auto it=lb(lst,lst+n,block{i+dx[j],i+dy[j],0},lamb);
    if(it!=lst+n&&(*it).x==i+dx[j]&&(*it).y==i+dy[j]) adj[i].push_back(it-lst);
  }
  dfs(min_element(all(r))-begin(r));
  if(sz(perm)<n) return {-1};
  return perm;
}

// grader
main() {
  int n, t;
  assert(2==scanf("%d %d",&n,&t));
  vector<int> r(n), c(n);
  for(int i=0;i<n;i++) assert(2==scanf("%d %d",&r[i],&c[i]));
  vector<int> v = build_skyscrapers(t,r,c);
  if(v[0]==-1) printf("NO");
  else {
    printf("YES\n");
    for(auto i: v) printf("%d\n",i+1);
  }
}

Compilation message

skyscrapers.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main() {
      | ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ans=YES N=1
2 Correct 1 ms 4184 KB ans=YES N=4
3 Incorrect 1 ms 3932 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ans=YES N=1
2 Correct 1 ms 4184 KB ans=YES N=4
3 Incorrect 1 ms 3932 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ans=YES N=1
2 Correct 1 ms 4184 KB ans=YES N=4
3 Incorrect 1 ms 3932 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB ans=NO N=1934
2 Correct 2 ms 3820 KB ans=NO N=1965
3 Incorrect 2 ms 3932 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB ans=YES N=1
2 Correct 1 ms 4184 KB ans=YES N=4
3 Incorrect 1 ms 3932 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 6296 KB ans=NO N=66151
2 Correct 24 ms 6048 KB ans=NO N=64333
3 Incorrect 25 ms 6232 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB ans=NO N=1934
2 Correct 2 ms 3820 KB ans=NO N=1965
3 Incorrect 2 ms 3932 KB Contestant did not find solution
4 Halted 0 ms 0 KB -