oj.uz

Submission #440242

# Submission time Handle Problem Language Result Execution time Memory
440242 2021-07-01T19:36:02 Z DanerZein Fountain Parks (IOI21_parks) C++17
55 / 100
 532 ms 50612 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;
  if(n==1){
    build(ru,rv,ra,rb);
    return 1;
  }
  for(int i=0;i<MAX_N;i++){
    int a,b;
    for(int j=0;j<ox[i].size();j++){
      a=ox[i][j+1].second; b=ox[i][j].second;
      if(j+1!=ox[i].size() && ox[i][j+1].first-ox[i][j].first==2 && !issameset(a,b)){
	unionset(a,b);
	G[a].push_back(b);
	G[b].push_back(a);
      }
    }
    for(int j=0;j<oy[i].size();j++){
      a=oy[i][j+1].second; b=oy[i][j].second;
      if(j+1!=oy[i].size() && oy[i][j+1].first-oy[i][j].first==2 && !issameset(a,b)){
	unionset(a,b);
	G[a].push_back(b);
	G[b].push_back(a);
      }
    }
  }
  if(tam[findset(0)]!=n) return 0;
  int id=-1;
  for(int i=0;i<n;i++){
    if(G[i].size()==1){
      id=i; break;
    }
  }
  queue<int> q; q.push(id);
  set<ii> ban; vis[id]=1;
  while(!q.empty()){
    int u; u=q.front();
    q.pop();
    int c=0;
    for(auto &v:G[u]){
      if(!vis[v]) c++;
    }
    while(c!=0){
      int id=-1;
      for(auto &v:G[u]){
	if(vis[v]) continue;
	id=v;
	int mid;
	if(x[u]==x[v]){
	  mid=(y[u]+y[v])/2;
	  if(ban.find(ii(x[u]+1,mid))!=ban.end() || ban.find(ii(x[u]-1,mid))!=ban.end()){
	    id=v; break;
	  }
	}
	else{
	  mid=(x[u]+x[v])/2;
	  if(ban.find(ii(mid,y[u]+1))!=ban.end() || ban.find(ii(mid,y[u]-1))!=ban.end()){
	    id=v; break;
	  }
	}
      }
      if(id==-1) break;
      vis[id]=1;
      int a,b,mid;
      if(x[u]==x[id]){
	mid=(y[u]+y[id])/2;
	if(ban.find(ii(x[u]-1,mid))==ban.end()){
	  a=x[u]-1; b=mid;
	}
	else{
	  a=x[u]+1; b=mid;
	}
      }
      else{
	mid=(x[u]+x[id])/2;
	if(ban.find(ii(mid,y[u]-1))==ban.end()){
	  a=mid; b=y[u]-1;
	}
	else{
	  a=mid; b=y[u]+1;

	}
      }
      ban.insert(ii(a,b));
      ru.push_back(u); rv.push_back(id);
      ra.push_back(a); rb.push_back(b);
      q.push(id);
      c--;
    }
  }
  build(ru,rv,ra,rb);
  return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:61: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]
   61 |     for(int j=0;j<ox[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:63: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]
   63 |       if(j+1!=ox[i].size() && ox[i][j+1].first-ox[i][j].first==2 && !issameset(a,b)){
      |          ~~~^~~~~~~~~~~~~~
parks.cpp:69: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]
   69 |     for(int j=0;j<oy[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:71: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]
   71 |       if(j+1!=oy[i].size() && oy[i][j+1].first-oy[i][j].first==2 && !issameset(a,b)){
      |          ~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 9 ms 9804 KB Output is correct
19 Correct 9 ms 9896 KB Output is correct
20 Correct 8 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9892 KB Output is correct
23 Correct 378 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10124 KB Output is correct
26 Correct 10 ms 10188 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 140 ms 25760 KB Output is correct
29 Correct 249 ms 33460 KB Output is correct
30 Correct 382 ms 41588 KB Output is correct
31 Correct 414 ms 49252 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 10 ms 9804 KB Output is correct
35 Correct 12 ms 9792 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 8 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 9 ms 9804 KB Output is correct
40 Correct 9 ms 9900 KB Output is correct
41 Correct 8 ms 9804 KB Output is correct
42 Correct 9 ms 9804 KB Output is correct
43 Correct 10 ms 10060 KB Output is correct
44 Correct 10 ms 10128 KB Output is correct
45 Correct 200 ms 30232 KB Output is correct
46 Correct 277 ms 40040 KB Output is correct
47 Correct 326 ms 40200 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 9 ms 9804 KB Output is correct
19 Correct 9 ms 9896 KB Output is correct
20 Correct 8 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9892 KB Output is correct
23 Correct 378 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10124 KB Output is correct
26 Correct 10 ms 10188 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 140 ms 25760 KB Output is correct
29 Correct 249 ms 33460 KB Output is correct
30 Correct 382 ms 41588 KB Output is correct
31 Correct 414 ms 49252 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 10 ms 9804 KB Output is correct
35 Correct 12 ms 9792 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 8 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 9 ms 9804 KB Output is correct
40 Correct 9 ms 9900 KB Output is correct
41 Correct 8 ms 9804 KB Output is correct
42 Correct 9 ms 9804 KB Output is correct
43 Correct 10 ms 10060 KB Output is correct
44 Correct 10 ms 10128 KB Output is correct
45 Correct 200 ms 30232 KB Output is correct
46 Correct 277 ms 40040 KB Output is correct
47 Correct 326 ms 40200 KB Output is correct
48 Correct 8 ms 9888 KB Output is correct
49 Correct 8 ms 9820 KB Output is correct
50 Correct 10 ms 9804 KB Output is correct
51 Correct 10 ms 9804 KB Output is correct
52 Correct 10 ms 9804 KB Output is correct
53 Correct 9 ms 9848 KB Output is correct
54 Correct 12 ms 9824 KB Output is correct
55 Correct 391 ms 49440 KB Output is correct
56 Correct 8 ms 9804 KB Output is correct
57 Incorrect 12 ms 10188 KB Tree @(3, 185601) appears more than once: for edges on positions 587 and 588
58 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct
17 Correct 9 ms 9804 KB Output is correct
18 Correct 8 ms 9824 KB Output is correct
19 Correct 9 ms 9804 KB Output is correct
20 Correct 532 ms 50612 KB Output is correct
21 Correct 418 ms 49296 KB Output is correct
22 Correct 450 ms 49764 KB Output is correct
23 Correct 363 ms 43432 KB Output is correct
24 Correct 81 ms 23292 KB Output is correct
25 Correct 146 ms 29180 KB Output is correct
26 Correct 165 ms 29144 KB Output is correct
27 Correct 431 ms 47928 KB Output is correct
28 Correct 438 ms 47920 KB Output is correct
29 Correct 399 ms 48028 KB Output is correct
30 Correct 457 ms 47960 KB Output is correct
31 Correct 8 ms 9804 KB Output is correct
32 Correct 30 ms 13004 KB Output is correct
33 Correct 98 ms 20732 KB Output is correct
34 Correct 483 ms 50604 KB Output is correct
35 Correct 14 ms 10804 KB Output is correct
36 Correct 40 ms 14956 KB Output is correct
37 Correct 74 ms 20068 KB Output is correct
38 Correct 170 ms 25276 KB Output is correct
39 Correct 256 ms 31504 KB Output is correct
40 Correct 346 ms 37448 KB Output is correct
41 Correct 415 ms 43228 KB Output is correct
42 Correct 508 ms 48844 KB Output is correct
43 Correct 8 ms 9804 KB Output is correct
44 Correct 9 ms 9852 KB Output is correct
45 Correct 10 ms 9804 KB Output is correct
46 Correct 10 ms 9804 KB Output is correct
47 Correct 10 ms 9896 KB Output is correct
48 Correct 9 ms 9804 KB Output is correct
49 Correct 10 ms 9872 KB Output is correct
50 Correct 10 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 10 ms 9804 KB Output is correct
53 Correct 9 ms 9836 KB Output is correct
54 Correct 11 ms 10032 KB Output is correct
55 Correct 12 ms 10104 KB Output is correct
56 Correct 185 ms 30188 KB Output is correct
57 Correct 341 ms 39996 KB Output is correct
58 Correct 302 ms 39948 KB Output is correct
59 Correct 9 ms 9804 KB Output is correct
60 Correct 9 ms 9804 KB Output is correct
61 Correct 9 ms 9888 KB Output is correct
62 Correct 392 ms 49208 KB Output is correct
63 Correct 377 ms 49220 KB Output is correct
64 Correct 389 ms 49124 KB Output is correct
65 Correct 11 ms 10232 KB Output is correct
66 Correct 15 ms 10700 KB Output is correct
67 Correct 197 ms 29780 KB Output is correct
68 Correct 333 ms 39672 KB Output is correct
69 Correct 422 ms 49700 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct
17 Correct 409 ms 49020 KB Output is correct
18 Correct 492 ms 49064 KB Output is correct
19 Correct 456 ms 49336 KB Output is correct
20 Correct 443 ms 46800 KB Output is correct
21 Correct 414 ms 44724 KB Output is correct
22 Correct 9 ms 9804 KB Output is correct
23 Correct 61 ms 16260 KB Output is correct
24 Correct 20 ms 11852 KB Output is correct
25 Correct 60 ms 16944 KB Output is correct
26 Correct 92 ms 22040 KB Output is correct
27 Correct 221 ms 29620 KB Output is correct
28 Correct 254 ms 34472 KB Output is correct
29 Correct 354 ms 39260 KB Output is correct
30 Correct 394 ms 43892 KB Output is correct
31 Correct 493 ms 48780 KB Output is correct
32 Correct 448 ms 49348 KB Output is correct
33 Correct 372 ms 49252 KB Output is correct
34 Correct 14 ms 10540 KB Output is correct
35 Correct 15 ms 10832 KB Output is correct
36 Correct 191 ms 29608 KB Output is correct
37 Correct 314 ms 39328 KB Output is correct
38 Correct 439 ms 49572 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9804 KB Output is correct
2 Correct 10 ms 9804 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 9 ms 9804 KB Output is correct
5 Correct 8 ms 9804 KB Output is correct
6 Correct 10 ms 9896 KB Output is correct
7 Correct 9 ms 9800 KB Output is correct
8 Correct 8 ms 9804 KB Output is correct
9 Correct 184 ms 32300 KB Output is correct
10 Correct 25 ms 12236 KB Output is correct
11 Correct 89 ms 21988 KB Output is correct
12 Correct 30 ms 13308 KB Output is correct
13 Correct 27 ms 15088 KB Output is correct
14 Correct 9 ms 9968 KB Output is correct
15 Correct 10 ms 10008 KB Output is correct
16 Correct 199 ms 32352 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 9 ms 9804 KB Output is correct
19 Correct 9 ms 9896 KB Output is correct
20 Correct 8 ms 9804 KB Output is correct
21 Correct 9 ms 9804 KB Output is correct
22 Correct 10 ms 9892 KB Output is correct
23 Correct 378 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10124 KB Output is correct
26 Correct 10 ms 10188 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 140 ms 25760 KB Output is correct
29 Correct 249 ms 33460 KB Output is correct
30 Correct 382 ms 41588 KB Output is correct
31 Correct 414 ms 49252 KB Output is correct
32 Correct 9 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 10 ms 9804 KB Output is correct
35 Correct 12 ms 9792 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 8 ms 9804 KB Output is correct
38 Correct 9 ms 9804 KB Output is correct
39 Correct 9 ms 9804 KB Output is correct
40 Correct 9 ms 9900 KB Output is correct
41 Correct 8 ms 9804 KB Output is correct
42 Correct 9 ms 9804 KB Output is correct
43 Correct 10 ms 10060 KB Output is correct
44 Correct 10 ms 10128 KB Output is correct
45 Correct 200 ms 30232 KB Output is correct
46 Correct 277 ms 40040 KB Output is correct
47 Correct 326 ms 40200 KB Output is correct
48 Correct 8 ms 9888 KB Output is correct
49 Correct 8 ms 9820 KB Output is correct
50 Correct 10 ms 9804 KB Output is correct
51 Correct 10 ms 9804 KB Output is correct
52 Correct 10 ms 9804 KB Output is correct
53 Correct 9 ms 9848 KB Output is correct
54 Correct 12 ms 9824 KB Output is correct
55 Correct 391 ms 49440 KB Output is correct
56 Correct 8 ms 9804 KB Output is correct
57 Incorrect 12 ms 10188 KB Tree @(3, 185601) appears more than once: for edges on positions 587 and 588
58 Halted 0 ms 0 KB -