oj.uz

답안 #435727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435727 2021-06-23T15:54:05 Z DanerZein 분수 공원 (IOI21_parks) C++17
15 / 100
 364 ms 48564 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vi;
const int MAX_N=2e5+10;
vector<vi> ox(MAX_N),oy(MAX_N);
int pa[MAX_N],tam[MAX_N];
void init(int n){
  for(int i=0;i<n;i++){
    pa[i]=i; tam[i]=1;
  }
}
int findset(int i){
  if(pa[i]==i) return i;
  return pa[i]=findset(pa[i]);
}
bool issameset(int i,int j){
  return findset(i)==findset(j);
}
void unionset(int i,int j){
  if(!issameset(i,j)){
    int u=findset(i),v=findset(j);
    pa[u]=v;
    tam[v]+=tam[u];
  }
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
  int n=x.size();
  for(int i=0;i<n;i++){
    ox[x[i]].push_back(ii(y[i],i));
    oy[y[i]].push_back(ii(x[i],i));
  }
  for(int i=0;i<MAX_N;i++){
    sort(ox[i].begin(),ox[i].end());
    sort(oy[i].begin(),oy[i].end());
  }
  vector<int> ru,rv,ra,rb;
  set<ii> ba;
  init(n);
  for(int i=2;i<MAX_N;i+=2){
    int t=oy[i].size();
    for(int j=0;j<t-1;j++){
      int xi=oy[i][j].first,xj=oy[i][j+1].first;
      int u=oy[i][j].second,v=oy[i][j+1].second;
      if(xj-xi==2 && !issameset(u,v)){
	ru.push_back(oy[i][j].second);
	rv.push_back(oy[i][j+1].second);
	unionset(u,v);
	int xk=oy[i][j+2].first;
	auto it=lower_bound(oy[i-2].begin(),oy[i-2].end(),ii(xj,-1));
	if(j+2<t && oy[i][j+2].first-xj==2 && it!=oy[i-2].end() && (*it).first==xj){
	  ra.push_back(xi+1); rb.push_back(i+1);
	  ba.insert(ii(xi+1,i+1));
	  it=lower_bound(oy[i+2].begin(),oy[i+2].end(),ii(xi,-1));
	  int id=it-oy[i+2].begin();
	  if((*it).first==xi && id-1>=0 && oy[i+2][id].first-oy[i+2][id-1].first==2){
	    int uu=oy[i+2][id].second,vv=oy[i+2][id-1].second;
	    unionset(uu,vv);
	    ru.push_back(uu); rv.push_back(vv);
	    ra.push_back(xi-1); rb.push_back(i+3);
	  }
	}
	else{
	  ra.push_back(xi+1); rb.push_back(i-1);
	  ba.insert(ii(xi+1,i-1));
	}
      }
    }
  }
  for(int i=2;i<MAX_N;i+=2){
    int t=ox[i].size();
    for(int j=0;j<t-1;j++){
      int yi=ox[i][j].first,yj=ox[i][j+1].first;
      int u=ox[i][j].second,v=ox[i][j+1].second;
      if(yj-yi==2){
	ru.push_back(u); rv.push_back(v);
	unionset(u,v);
	if(ba.find(ii(i-1,yi+1))!=ba.end()){
	  ra.push_back(i+1); rb.push_back(yi+1);
	  ba.insert(ii(i+1,yi+1));
	}
	else{
	  ra.push_back(i-1); rb.push_back(yi+1);
	  ba.insert(ii(i-1,yi+1));
	}
      }
    }
  }
  if(tam[findset(0)]!=n) return 0;
  build(ru,rv,ra,rb);
  return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:50:6: warning: unused variable 'xk' [-Wunused-variable]
   50 |  int xk=oy[i][j+2].first;
      |      ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 10 ms 9660 KB Output is correct
19 Correct 10 ms 9668 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 9 ms 9676 KB Output is correct
22 Correct 10 ms 9704 KB Output is correct
23 Correct 349 ms 48564 KB Output is correct
24 Correct 9 ms 9676 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 15 ms 10060 KB Output is correct
27 Correct 12 ms 10188 KB Output is correct
28 Correct 126 ms 25268 KB Output is correct
29 Correct 189 ms 32936 KB Output is correct
30 Correct 279 ms 40924 KB Output is correct
31 Correct 333 ms 48548 KB Output is correct
32 Correct 10 ms 9676 KB Output is correct
33 Correct 11 ms 9676 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 9 ms 9700 KB Output is correct
36 Correct 8 ms 9676 KB Output is correct
37 Correct 8 ms 9676 KB Output is correct
38 Correct 9 ms 9708 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 8 ms 9676 KB Output is correct
42 Correct 9 ms 9708 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 13 ms 10060 KB Output is correct
45 Correct 143 ms 24504 KB Output is correct
46 Correct 194 ms 31944 KB Output is correct
47 Correct 202 ms 31920 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 10 ms 9660 KB Output is correct
19 Correct 10 ms 9668 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 9 ms 9676 KB Output is correct
22 Correct 10 ms 9704 KB Output is correct
23 Correct 349 ms 48564 KB Output is correct
24 Correct 9 ms 9676 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 15 ms 10060 KB Output is correct
27 Correct 12 ms 10188 KB Output is correct
28 Correct 126 ms 25268 KB Output is correct
29 Correct 189 ms 32936 KB Output is correct
30 Correct 279 ms 40924 KB Output is correct
31 Correct 333 ms 48548 KB Output is correct
32 Correct 10 ms 9676 KB Output is correct
33 Correct 11 ms 9676 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 9 ms 9700 KB Output is correct
36 Correct 8 ms 9676 KB Output is correct
37 Correct 8 ms 9676 KB Output is correct
38 Correct 9 ms 9708 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 8 ms 9676 KB Output is correct
42 Correct 9 ms 9708 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 13 ms 10060 KB Output is correct
45 Correct 143 ms 24504 KB Output is correct
46 Correct 194 ms 31944 KB Output is correct
47 Correct 202 ms 31920 KB Output is correct
48 Correct 8 ms 9676 KB Output is correct
49 Correct 9 ms 9676 KB Output is correct
50 Runtime error 17 ms 19476 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct
17 Correct 9 ms 9676 KB Output is correct
18 Correct 9 ms 9676 KB Output is correct
19 Correct 9 ms 9676 KB Output is correct
20 Correct 364 ms 39380 KB Output is correct
21 Correct 322 ms 39056 KB Output is correct
22 Correct 306 ms 38468 KB Output is correct
23 Correct 222 ms 34840 KB Output is correct
24 Correct 78 ms 18376 KB Output is correct
25 Correct 133 ms 30412 KB Output is correct
26 Correct 164 ms 30676 KB Output is correct
27 Correct 229 ms 36764 KB Output is correct
28 Runtime error 89 ms 37316 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct
17 Correct 268 ms 38484 KB Output is correct
18 Correct 261 ms 38524 KB Output is correct
19 Incorrect 293 ms 38892 KB Tree @(49999, 7) appears more than once: for edges on positions 1 and 149992
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9708 KB Output is correct
4 Correct 8 ms 9676 KB Output is correct
5 Correct 8 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 8 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27944 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 75 ms 19476 KB Output is correct
12 Correct 24 ms 12476 KB Output is correct
13 Correct 37 ms 15600 KB Output is correct
14 Correct 9 ms 9804 KB Output is correct
15 Correct 10 ms 9932 KB Output is correct
16 Correct 130 ms 27268 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 10 ms 9660 KB Output is correct
19 Correct 10 ms 9668 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 9 ms 9676 KB Output is correct
22 Correct 10 ms 9704 KB Output is correct
23 Correct 349 ms 48564 KB Output is correct
24 Correct 9 ms 9676 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 15 ms 10060 KB Output is correct
27 Correct 12 ms 10188 KB Output is correct
28 Correct 126 ms 25268 KB Output is correct
29 Correct 189 ms 32936 KB Output is correct
30 Correct 279 ms 40924 KB Output is correct
31 Correct 333 ms 48548 KB Output is correct
32 Correct 10 ms 9676 KB Output is correct
33 Correct 11 ms 9676 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 9 ms 9700 KB Output is correct
36 Correct 8 ms 9676 KB Output is correct
37 Correct 8 ms 9676 KB Output is correct
38 Correct 9 ms 9708 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 8 ms 9676 KB Output is correct
42 Correct 9 ms 9708 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 13 ms 10060 KB Output is correct
45 Correct 143 ms 24504 KB Output is correct
46 Correct 194 ms 31944 KB Output is correct
47 Correct 202 ms 31920 KB Output is correct
48 Correct 8 ms 9676 KB Output is correct
49 Correct 9 ms 9676 KB Output is correct
50 Runtime error 17 ms 19476 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -