oj.uz

답안 #1072676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072676 2024-08-24T02:31:00 Z PenguinsAreCute Building Skyscrapers (CEOI19_skyscrapers) C++17
22 / 100
 89 ms 9600 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 bfs(int x, vector<int> &r, vector<int> &c) {
  vis[x]=1;
  priority_queue<i2,vector<i2>,greater<i2>> pq;
  for(pq.push({r[x],x});pq.size();) {
    int y = pq.top().second; pq.pop();
    perm.push_back(y);
    for(auto z: adj[y]) if(!vis[z]) {
      vis[z]=1;
      pq.push({r[z],z});
    }
  }
}
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{r[i]+dx[j],c[i]+dy[j],0},lamb);
    if(it!=lst+n&&(*it).x==r[i]+dx[j]&&(*it).y==c[i]+dy[j]) adj[i].push_back((*it).i);
  }
  bfs(min_element(all(r))-begin(r),r,c);
  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:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB ans=YES N=1
2 Correct 1 ms 3932 KB ans=YES N=4
3 Correct 1 ms 3932 KB ans=NO N=4
4 Correct 1 ms 3932 KB ans=YES N=5
5 Correct 1 ms 3932 KB ans=YES N=9
6 Correct 1 ms 3856 KB ans=YES N=5
7 Correct 1 ms 3932 KB ans=NO N=9
8 Correct 2 ms 3932 KB ans=NO N=10
9 Correct 1 ms 3928 KB ans=YES N=10
10 Correct 1 ms 3932 KB ans=YES N=10
11 Correct 2 ms 3932 KB ans=YES N=10
12 Correct 1 ms 3932 KB ans=YES N=9
13 Correct 2 ms 3932 KB ans=YES N=9
14 Correct 2 ms 3932 KB ans=YES N=8
15 Correct 1 ms 3928 KB ans=YES N=8
16 Correct 1 ms 3932 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB ans=YES N=1
2 Correct 1 ms 3932 KB ans=YES N=4
3 Correct 1 ms 3932 KB ans=NO N=4
4 Correct 1 ms 3932 KB ans=YES N=5
5 Correct 1 ms 3932 KB ans=YES N=9
6 Correct 1 ms 3856 KB ans=YES N=5
7 Correct 1 ms 3932 KB ans=NO N=9
8 Correct 2 ms 3932 KB ans=NO N=10
9 Correct 1 ms 3928 KB ans=YES N=10
10 Correct 1 ms 3932 KB ans=YES N=10
11 Correct 2 ms 3932 KB ans=YES N=10
12 Correct 1 ms 3932 KB ans=YES N=9
13 Correct 2 ms 3932 KB ans=YES N=9
14 Correct 2 ms 3932 KB ans=YES N=8
15 Correct 1 ms 3928 KB ans=YES N=8
16 Correct 1 ms 3932 KB ans=NO N=2
17 Correct 1 ms 3932 KB ans=YES N=17
18 Correct 2 ms 3932 KB ans=YES N=25
19 Correct 1 ms 3932 KB ans=YES N=100
20 Correct 1 ms 3932 KB ans=YES N=185
21 Correct 1 ms 3932 KB ans=NO N=174
22 Correct 1 ms 3932 KB ans=YES N=90
23 Correct 1 ms 3928 KB ans=YES N=63
24 Correct 1 ms 3932 KB ans=YES N=87
25 Correct 1 ms 3932 KB ans=YES N=183
26 Correct 1 ms 3928 KB ans=YES N=188
27 Correct 1 ms 3932 KB ans=YES N=183
28 Correct 1 ms 3932 KB ans=YES N=189
29 Correct 1 ms 3932 KB ans=YES N=200
30 Correct 2 ms 3932 KB ans=YES N=190
31 Correct 1 ms 3932 KB ans=YES N=187
32 Correct 1 ms 3976 KB ans=YES N=187
33 Correct 1 ms 3932 KB ans=YES N=182
34 Correct 2 ms 3932 KB ans=YES N=184
35 Correct 1 ms 3932 KB ans=YES N=188
36 Correct 1 ms 3932 KB ans=YES N=181
37 Correct 2 ms 3932 KB ans=YES N=188
38 Correct 1 ms 3932 KB ans=YES N=191
39 Correct 1 ms 3976 KB ans=YES N=196
40 Correct 2 ms 3928 KB ans=YES N=196
41 Correct 2 ms 3932 KB ans=YES N=196
42 Correct 2 ms 3932 KB ans=YES N=196
43 Correct 1 ms 3972 KB ans=YES N=195

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB ans=YES N=1
2 Correct 1 ms 3932 KB ans=YES N=4
3 Correct 1 ms 3932 KB ans=NO N=4
4 Correct 1 ms 3932 KB ans=YES N=5
5 Correct 1 ms 3932 KB ans=YES N=9
6 Correct 1 ms 3856 KB ans=YES N=5
7 Correct 1 ms 3932 KB ans=NO N=9
8 Correct 2 ms 3932 KB ans=NO N=10
9 Correct 1 ms 3928 KB ans=YES N=10
10 Correct 1 ms 3932 KB ans=YES N=10
11 Correct 2 ms 3932 KB ans=YES N=10
12 Correct 1 ms 3932 KB ans=YES N=9
13 Correct 2 ms 3932 KB ans=YES N=9
14 Correct 2 ms 3932 KB ans=YES N=8
15 Correct 1 ms 3928 KB ans=YES N=8
16 Correct 1 ms 3932 KB ans=NO N=2
17 Correct 1 ms 3932 KB ans=YES N=17
18 Correct 2 ms 3932 KB ans=YES N=25
19 Correct 1 ms 3932 KB ans=YES N=100
20 Correct 1 ms 3932 KB ans=YES N=185
21 Correct 1 ms 3932 KB ans=NO N=174
22 Correct 1 ms 3932 KB ans=YES N=90
23 Correct 1 ms 3928 KB ans=YES N=63
24 Correct 1 ms 3932 KB ans=YES N=87
25 Correct 1 ms 3932 KB ans=YES N=183
26 Correct 1 ms 3928 KB ans=YES N=188
27 Correct 1 ms 3932 KB ans=YES N=183
28 Correct 1 ms 3932 KB ans=YES N=189
29 Correct 1 ms 3932 KB ans=YES N=200
30 Correct 2 ms 3932 KB ans=YES N=190
31 Correct 1 ms 3932 KB ans=YES N=187
32 Correct 1 ms 3976 KB ans=YES N=187
33 Correct 1 ms 3932 KB ans=YES N=182
34 Correct 2 ms 3932 KB ans=YES N=184
35 Correct 1 ms 3932 KB ans=YES N=188
36 Correct 1 ms 3932 KB ans=YES N=181
37 Correct 2 ms 3932 KB ans=YES N=188
38 Correct 1 ms 3932 KB ans=YES N=191
39 Correct 1 ms 3976 KB ans=YES N=196
40 Correct 2 ms 3928 KB ans=YES N=196
41 Correct 2 ms 3932 KB ans=YES N=196
42 Correct 2 ms 3932 KB ans=YES N=196
43 Correct 1 ms 3972 KB ans=YES N=195
44 Correct 3 ms 3932 KB ans=NO N=1934
45 Correct 3 ms 3936 KB ans=NO N=1965
46 Correct 3 ms 3932 KB ans=YES N=1824
47 Correct 3 ms 3928 KB ans=YES N=1981
48 Correct 3 ms 3932 KB ans=YES N=1814
49 Correct 3 ms 4088 KB ans=YES N=1854
50 Correct 4 ms 3932 KB ans=YES N=1831
51 Correct 3 ms 3928 KB ans=YES N=2000
52 Correct 3 ms 3932 KB ans=YES N=1847
53 Correct 3 ms 3932 KB ans=YES N=1819
54 Correct 5 ms 3932 KB ans=YES N=1986
55 Correct 3 ms 3932 KB ans=YES N=2000
56 Correct 3 ms 3896 KB ans=YES N=1834
57 Incorrect 3 ms 3932 KB Added cell 700 (-328647117,775883244) not reachable from infinity
58 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB ans=NO N=1934
2 Correct 3 ms 3932 KB ans=NO N=1965
3 Incorrect 3 ms 3932 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 Correct 1 ms 3932 KB ans=YES N=1
2 Correct 1 ms 3932 KB ans=YES N=4
3 Correct 1 ms 3932 KB ans=NO N=4
4 Correct 1 ms 3932 KB ans=YES N=5
5 Correct 1 ms 3932 KB ans=YES N=9
6 Correct 1 ms 3856 KB ans=YES N=5
7 Correct 1 ms 3932 KB ans=NO N=9
8 Correct 2 ms 3932 KB ans=NO N=10
9 Correct 1 ms 3928 KB ans=YES N=10
10 Correct 1 ms 3932 KB ans=YES N=10
11 Correct 2 ms 3932 KB ans=YES N=10
12 Correct 1 ms 3932 KB ans=YES N=9
13 Correct 2 ms 3932 KB ans=YES N=9
14 Correct 2 ms 3932 KB ans=YES N=8
15 Correct 1 ms 3928 KB ans=YES N=8
16 Correct 1 ms 3932 KB ans=NO N=2
17 Correct 1 ms 3932 KB ans=YES N=17
18 Correct 2 ms 3932 KB ans=YES N=25
19 Correct 1 ms 3932 KB ans=YES N=100
20 Correct 1 ms 3932 KB ans=YES N=185
21 Correct 1 ms 3932 KB ans=NO N=174
22 Correct 1 ms 3932 KB ans=YES N=90
23 Correct 1 ms 3928 KB ans=YES N=63
24 Correct 1 ms 3932 KB ans=YES N=87
25 Correct 1 ms 3932 KB ans=YES N=183
26 Correct 1 ms 3928 KB ans=YES N=188
27 Correct 1 ms 3932 KB ans=YES N=183
28 Correct 1 ms 3932 KB ans=YES N=189
29 Correct 1 ms 3932 KB ans=YES N=200
30 Correct 2 ms 3932 KB ans=YES N=190
31 Correct 1 ms 3932 KB ans=YES N=187
32 Correct 1 ms 3976 KB ans=YES N=187
33 Correct 1 ms 3932 KB ans=YES N=182
34 Correct 2 ms 3932 KB ans=YES N=184
35 Correct 1 ms 3932 KB ans=YES N=188
36 Correct 1 ms 3932 KB ans=YES N=181
37 Correct 2 ms 3932 KB ans=YES N=188
38 Correct 1 ms 3932 KB ans=YES N=191
39 Correct 1 ms 3976 KB ans=YES N=196
40 Correct 2 ms 3928 KB ans=YES N=196
41 Correct 2 ms 3932 KB ans=YES N=196
42 Correct 2 ms 3932 KB ans=YES N=196
43 Correct 1 ms 3972 KB ans=YES N=195
44 Correct 3 ms 3932 KB ans=NO N=1934
45 Correct 3 ms 3936 KB ans=NO N=1965
46 Correct 3 ms 3932 KB ans=YES N=1824
47 Correct 3 ms 3928 KB ans=YES N=1981
48 Correct 3 ms 3932 KB ans=YES N=1814
49 Correct 3 ms 4088 KB ans=YES N=1854
50 Correct 4 ms 3932 KB ans=YES N=1831
51 Correct 3 ms 3928 KB ans=YES N=2000
52 Correct 3 ms 3932 KB ans=YES N=1847
53 Correct 3 ms 3932 KB ans=YES N=1819
54 Correct 5 ms 3932 KB ans=YES N=1986
55 Correct 3 ms 3932 KB ans=YES N=2000
56 Correct 3 ms 3896 KB ans=YES N=1834
57 Incorrect 3 ms 3932 KB Added cell 700 (-328647117,775883244) not reachable from infinity
58 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 9168 KB ans=NO N=66151
2 Correct 60 ms 6484 KB ans=NO N=64333
3 Incorrect 89 ms 9600 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 33786)
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 3 ms 3932 KB ans=NO N=1965
3 Incorrect 3 ms 3932 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -