oj.uz

Submission #440165

# Submission time Handle Problem Language Result Execution time Memory
440165 2021-07-01T16:37:50 Z DanerZein Fountain Parks (IOI21_parks) C++17
30 / 100
 510 ms 50632 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
const int MAX_N=2e5+10;
vector<vi> G;
int pa[MAX_N],tam[MAX_N];
bool vis[MAX_N];
vector<ii> ox[MAX_N],oy[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];
  }
}
bool orden(iii a,iii b){
  if(a.second.second==b.second.second){
    return a.second.first<b.second.first;
  }
  return a.second.second<b.second.second;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
  int n=x.size();
  G.clear(); G.resize(n+1);
  for(int i=0;i<MAX_N;i++){
    ox[i].clear(); oy[i].clear();
  }
  memset(vis,0,sizeof vis);

  init(n);
  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;
  int id=-1;
  for(int i=0;i<MAX_N;i++){
    int a,b;
    for(int j=0;j<ox[i].size();j++){
      if(j+1!=ox[i].size() && ox[i][j+1].first-ox[i][j].first==2){
	a=ox[i][j+1].second; b=ox[i][j].second;
	unionset(a,b);
	G[a].push_back(b);
	G[b].push_back(a);
      }
    }
    for(int j=0;j<oy[i].size();j++){
      if(id==-1){
	id=oy[i][j].second;
      }
      if(j+1!=oy[i].size() && oy[i][j+1].first-oy[i][j].first==2){
	a=oy[i][j+1].second; b=oy[i][j].second;
	unionset(a,b);
	G[a].push_back(b);
	G[b].push_back(a);
      }
    }
  }
  if(tam[findset(0)]!=n) return 0;
  queue<int> q; q.push(id);
  set<ii> ban; vis[id]=1;
  while(!q.empty()){
    int u; u=q.front();
    q.pop();
    vector<iii> pro;
    for(auto &v:G[u]){
      if(!vis[v]) pro.push_back(iii(v,ii(x[v],y[v])));
    }
    sort(pro.begin(),pro.end(),orden);
    for(int i=0;i<pro.size();i++){
      int a=pro[i].first;
      ru.push_back(a); rv.push_back(u);
      int xi,yi;
      if(x[a]==x[u]){
	xi=x[a]-1; yi=(y[a]+y[u])/2;
	if(ban.find(ii(xi,yi))!=ban.end()){
	  xi=x[a]+1;
	}
	ban.insert(ii(xi,yi));
      }
      else{
	xi=(x[a]+x[u])/2; yi=y[a]-1;
	if(ban.find(ii(xi,yi))!=ban.end()){
	  yi=y[a]+1;
	}
	ban.insert(ii(xi,yi));
      }
      ra.push_back(xi); rb.push_back(yi);
      q.push(a);
      vis[a]=1;
    }
  }
  build(ru,rv,ra,rb);
  return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int j=0;j<ox[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:59:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |       if(j+1!=ox[i].size() && ox[i][j+1].first-ox[i][j].first==2){
      |          ~~~^~~~~~~~~~~~~~
parks.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int j=0;j<oy[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:70:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |       if(j+1!=oy[i].size() && oy[i][j+1].first-oy[i][j].first==2){
      |          ~~~^~~~~~~~~~~~~~
parks.cpp:89:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for(int i=0;i<pro.size();i++){
      |                 ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct
17 Correct 9 ms 9804 KB Output is correct
18 Correct 8 ms 9804 KB Output is correct
19 Correct 10 ms 9804 KB Output is correct
20 Correct 10 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9804 KB Output is correct
23 Correct 455 ms 49364 KB Output is correct
24 Correct 10 ms 9880 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 13 ms 10168 KB Output is correct
27 Correct 11 ms 10188 KB Output is correct
28 Correct 173 ms 25792 KB Output is correct
29 Correct 223 ms 33460 KB Output is correct
30 Correct 318 ms 41640 KB Output is correct
31 Correct 472 ms 49272 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 11 ms 9804 KB Output is correct
35 Correct 10 ms 9804 KB Output is correct
36 Correct 11 ms 9792 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9804 KB Output is correct
41 Correct 9 ms 9804 KB Output is correct
42 Correct 10 ms 9804 KB Output is correct
43 Correct 11 ms 10064 KB Output is correct
44 Correct 11 ms 10216 KB Output is correct
45 Correct 190 ms 30180 KB Output is correct
46 Correct 273 ms 39936 KB Output is correct
47 Correct 267 ms 40004 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct
17 Correct 9 ms 9804 KB Output is correct
18 Correct 8 ms 9804 KB Output is correct
19 Correct 10 ms 9804 KB Output is correct
20 Correct 10 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9804 KB Output is correct
23 Correct 455 ms 49364 KB Output is correct
24 Correct 10 ms 9880 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 13 ms 10168 KB Output is correct
27 Correct 11 ms 10188 KB Output is correct
28 Correct 173 ms 25792 KB Output is correct
29 Correct 223 ms 33460 KB Output is correct
30 Correct 318 ms 41640 KB Output is correct
31 Correct 472 ms 49272 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 11 ms 9804 KB Output is correct
35 Correct 10 ms 9804 KB Output is correct
36 Correct 11 ms 9792 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9804 KB Output is correct
41 Correct 9 ms 9804 KB Output is correct
42 Correct 10 ms 9804 KB Output is correct
43 Correct 11 ms 10064 KB Output is correct
44 Correct 11 ms 10216 KB Output is correct
45 Correct 190 ms 30180 KB Output is correct
46 Correct 273 ms 39936 KB Output is correct
47 Correct 267 ms 40004 KB Output is correct
48 Correct 9 ms 9904 KB Output is correct
49 Correct 9 ms 9804 KB Output is correct
50 Correct 9 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 8 ms 9804 KB Output is correct
53 Correct 10 ms 9896 KB Output is correct
54 Correct 8 ms 9804 KB Output is correct
55 Correct 397 ms 49556 KB Output is correct
56 Correct 8 ms 9820 KB Output is correct
57 Correct 11 ms 10188 KB Output is correct
58 Correct 17 ms 11104 KB Output is correct
59 Correct 15 ms 10828 KB Output is correct
60 Correct 173 ms 29632 KB Output is correct
61 Correct 246 ms 36676 KB Output is correct
62 Correct 317 ms 42344 KB Output is correct
63 Correct 450 ms 49696 KB Output is correct
64 Correct 9 ms 9804 KB Output is correct
65 Correct 11 ms 9892 KB Output is correct
66 Correct 9 ms 9808 KB Output is correct
67 Correct 386 ms 49200 KB Output is correct
68 Correct 470 ms 49196 KB Output is correct
69 Correct 377 ms 49104 KB Output is correct
70 Correct 13 ms 10204 KB Output is correct
71 Correct 15 ms 10704 KB Output is correct
72 Correct 189 ms 29788 KB Output is correct
73 Correct 290 ms 39584 KB Output is correct
74 Correct 447 ms 49700 KB Output is correct
75 Correct 410 ms 49324 KB Output is correct
76 Correct 414 ms 49284 KB Output is correct
77 Correct 12 ms 10316 KB Output is correct
78 Correct 15 ms 10740 KB Output is correct
79 Correct 174 ms 29696 KB Output is correct
80 Correct 281 ms 39404 KB Output is correct
81 Correct 429 ms 49656 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct
17 Correct 9 ms 9804 KB Output is correct
18 Correct 10 ms 9804 KB Output is correct
19 Correct 9 ms 9872 KB Output is correct
20 Correct 469 ms 50632 KB Output is correct
21 Correct 462 ms 49392 KB Output is correct
22 Correct 461 ms 49816 KB Output is correct
23 Correct 313 ms 43380 KB Output is correct
24 Correct 88 ms 23236 KB Output is correct
25 Correct 161 ms 29068 KB Output is correct
26 Correct 129 ms 29064 KB Output is correct
27 Correct 413 ms 47932 KB Output is correct
28 Correct 382 ms 47968 KB Output is correct
29 Correct 423 ms 47996 KB Output is correct
30 Correct 431 ms 47996 KB Output is correct
31 Correct 10 ms 9804 KB Output is correct
32 Incorrect 32 ms 12920 KB Tree @(185817, 20263) appears more than once: for edges on positions 108 and 114
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct
17 Correct 385 ms 48972 KB Output is correct
18 Correct 398 ms 49064 KB Output is correct
19 Correct 510 ms 49356 KB Output is correct
20 Correct 408 ms 46760 KB Output is correct
21 Correct 366 ms 44544 KB Output is correct
22 Correct 8 ms 9804 KB Output is correct
23 Incorrect 60 ms 16256 KB Tree @(185241, 20565) appears more than once: for edges on positions 164 and 182
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9804 KB Output is correct
2 Correct 9 ms 9804 KB Output is correct
3 Correct 10 ms 9776 KB Output is correct
4 Correct 10 ms 9892 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 8 ms 9824 KB Output is correct
7 Correct 10 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 178 ms 32376 KB Output is correct
10 Correct 20 ms 12236 KB Output is correct
11 Correct 74 ms 22008 KB Output is correct
12 Correct 29 ms 13312 KB Output is correct
13 Correct 27 ms 15044 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 10 ms 10060 KB Output is correct
16 Correct 165 ms 32420 KB Output is correct
17 Correct 9 ms 9804 KB Output is correct
18 Correct 8 ms 9804 KB Output is correct
19 Correct 10 ms 9804 KB Output is correct
20 Correct 10 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9804 KB Output is correct
23 Correct 455 ms 49364 KB Output is correct
24 Correct 10 ms 9880 KB Output is correct
25 Correct 10 ms 10060 KB Output is correct
26 Correct 13 ms 10168 KB Output is correct
27 Correct 11 ms 10188 KB Output is correct
28 Correct 173 ms 25792 KB Output is correct
29 Correct 223 ms 33460 KB Output is correct
30 Correct 318 ms 41640 KB Output is correct
31 Correct 472 ms 49272 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 11 ms 9804 KB Output is correct
35 Correct 10 ms 9804 KB Output is correct
36 Correct 11 ms 9792 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9804 KB Output is correct
41 Correct 9 ms 9804 KB Output is correct
42 Correct 10 ms 9804 KB Output is correct
43 Correct 11 ms 10064 KB Output is correct
44 Correct 11 ms 10216 KB Output is correct
45 Correct 190 ms 30180 KB Output is correct
46 Correct 273 ms 39936 KB Output is correct
47 Correct 267 ms 40004 KB Output is correct
48 Correct 9 ms 9904 KB Output is correct
49 Correct 9 ms 9804 KB Output is correct
50 Correct 9 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 8 ms 9804 KB Output is correct
53 Correct 10 ms 9896 KB Output is correct
54 Correct 8 ms 9804 KB Output is correct
55 Correct 397 ms 49556 KB Output is correct
56 Correct 8 ms 9820 KB Output is correct
57 Correct 11 ms 10188 KB Output is correct
58 Correct 17 ms 11104 KB Output is correct
59 Correct 15 ms 10828 KB Output is correct
60 Correct 173 ms 29632 KB Output is correct
61 Correct 246 ms 36676 KB Output is correct
62 Correct 317 ms 42344 KB Output is correct
63 Correct 450 ms 49696 KB Output is correct
64 Correct 9 ms 9804 KB Output is correct
65 Correct 11 ms 9892 KB Output is correct
66 Correct 9 ms 9808 KB Output is correct
67 Correct 386 ms 49200 KB Output is correct
68 Correct 470 ms 49196 KB Output is correct
69 Correct 377 ms 49104 KB Output is correct
70 Correct 13 ms 10204 KB Output is correct
71 Correct 15 ms 10704 KB Output is correct
72 Correct 189 ms 29788 KB Output is correct
73 Correct 290 ms 39584 KB Output is correct
74 Correct 447 ms 49700 KB Output is correct
75 Correct 410 ms 49324 KB Output is correct
76 Correct 414 ms 49284 KB Output is correct
77 Correct 12 ms 10316 KB Output is correct
78 Correct 15 ms 10740 KB Output is correct
79 Correct 174 ms 29696 KB Output is correct
80 Correct 281 ms 39404 KB Output is correct
81 Correct 429 ms 49656 KB Output is correct
82 Correct 9 ms 9804 KB Output is correct
83 Correct 10 ms 9804 KB Output is correct
84 Correct 9 ms 9872 KB Output is correct
85 Correct 469 ms 50632 KB Output is correct
86 Correct 462 ms 49392 KB Output is correct
87 Correct 461 ms 49816 KB Output is correct
88 Correct 313 ms 43380 KB Output is correct
89 Correct 88 ms 23236 KB Output is correct
90 Correct 161 ms 29068 KB Output is correct
91 Correct 129 ms 29064 KB Output is correct
92 Correct 413 ms 47932 KB Output is correct
93 Correct 382 ms 47968 KB Output is correct
94 Correct 423 ms 47996 KB Output is correct
95 Correct 431 ms 47996 KB Output is correct
96 Correct 10 ms 9804 KB Output is correct
97 Incorrect 32 ms 12920 KB Tree @(185817, 20263) appears more than once: for edges on positions 108 and 114
98 Halted 0 ms 0 KB -