oj.uz

Submission #440232

# Submission time Handle Problem Language Result Execution time Memory
440232 2021-07-01T19:19:08 Z DanerZein Fountain Parks (IOI21_parks) C++17
55 / 100
 504 ms 50676 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;
  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(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(0);
  set<ii> ban; vis[0]=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:57: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]
   57 |     for(int j=0;j<ox[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:58: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]
   58 |       if(j+1!=ox[i].size() && ox[i][j+1].first-ox[i][j].first==2){
      |          ~~~^~~~~~~~~~~~~~
parks.cpp:65: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]
   65 |     for(int j=0;j<oy[i].size();j++){
      |                 ~^~~~~~~~~~~~~
parks.cpp:66: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]
   66 |       if(j+1!=oy[i].size() && oy[i][j+1].first-oy[i][j].first==2){
      |          ~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 8 ms 9892 KB Output is correct
19 Correct 8 ms 9804 KB Output is correct
20 Correct 8 ms 9888 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 9 ms 9872 KB Output is correct
23 Correct 413 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10060 KB Output is correct
26 Correct 9 ms 10120 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 143 ms 25784 KB Output is correct
29 Correct 224 ms 33464 KB Output is correct
30 Correct 339 ms 41548 KB Output is correct
31 Correct 405 ms 49256 KB Output is correct
32 Correct 8 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 8 ms 9804 KB Output is correct
35 Correct 8 ms 9804 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9896 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9808 KB Output is correct
41 Correct 9 ms 9932 KB Output is correct
42 Correct 8 ms 9804 KB Output is correct
43 Correct 10 ms 10044 KB Output is correct
44 Correct 10 ms 10188 KB Output is correct
45 Correct 174 ms 30220 KB Output is correct
46 Correct 286 ms 40108 KB Output is correct
47 Correct 289 ms 40052 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 8 ms 9892 KB Output is correct
19 Correct 8 ms 9804 KB Output is correct
20 Correct 8 ms 9888 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 9 ms 9872 KB Output is correct
23 Correct 413 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10060 KB Output is correct
26 Correct 9 ms 10120 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 143 ms 25784 KB Output is correct
29 Correct 224 ms 33464 KB Output is correct
30 Correct 339 ms 41548 KB Output is correct
31 Correct 405 ms 49256 KB Output is correct
32 Correct 8 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 8 ms 9804 KB Output is correct
35 Correct 8 ms 9804 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9896 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9808 KB Output is correct
41 Correct 9 ms 9932 KB Output is correct
42 Correct 8 ms 9804 KB Output is correct
43 Correct 10 ms 10044 KB Output is correct
44 Correct 10 ms 10188 KB Output is correct
45 Correct 174 ms 30220 KB Output is correct
46 Correct 286 ms 40108 KB Output is correct
47 Correct 289 ms 40052 KB Output is correct
48 Correct 7 ms 9804 KB Output is correct
49 Correct 8 ms 9896 KB Output is correct
50 Correct 9 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 9 ms 9804 KB Output is correct
53 Correct 9 ms 9896 KB Output is correct
54 Correct 9 ms 9804 KB Output is correct
55 Incorrect 425 ms 46376 KB Tree @(3, 95049) appears more than once: for edges on positions 4 and 5
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct
17 Correct 8 ms 9804 KB Output is correct
18 Correct 7 ms 9892 KB Output is correct
19 Correct 7 ms 9820 KB Output is correct
20 Correct 504 ms 50676 KB Output is correct
21 Correct 393 ms 49496 KB Output is correct
22 Correct 423 ms 49748 KB Output is correct
23 Correct 335 ms 43336 KB Output is correct
24 Correct 80 ms 23236 KB Output is correct
25 Correct 134 ms 29100 KB Output is correct
26 Correct 137 ms 29176 KB Output is correct
27 Correct 412 ms 47896 KB Output is correct
28 Correct 428 ms 47952 KB Output is correct
29 Correct 419 ms 48020 KB Output is correct
30 Correct 415 ms 48024 KB Output is correct
31 Correct 9 ms 9804 KB Output is correct
32 Correct 29 ms 12996 KB Output is correct
33 Correct 84 ms 20848 KB Output is correct
34 Correct 486 ms 50648 KB Output is correct
35 Correct 14 ms 10828 KB Output is correct
36 Correct 38 ms 14916 KB Output is correct
37 Correct 73 ms 20088 KB Output is correct
38 Correct 177 ms 25256 KB Output is correct
39 Correct 222 ms 31528 KB Output is correct
40 Correct 311 ms 37492 KB Output is correct
41 Correct 429 ms 43400 KB Output is correct
42 Correct 488 ms 48908 KB Output is correct
43 Correct 9 ms 9804 KB Output is correct
44 Correct 9 ms 9856 KB Output is correct
45 Correct 8 ms 9804 KB Output is correct
46 Correct 8 ms 9804 KB Output is correct
47 Correct 9 ms 9804 KB Output is correct
48 Correct 9 ms 9824 KB Output is correct
49 Correct 8 ms 9892 KB Output is correct
50 Correct 9 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 9 ms 9804 KB Output is correct
53 Correct 7 ms 9804 KB Output is correct
54 Correct 9 ms 10028 KB Output is correct
55 Correct 10 ms 10188 KB Output is correct
56 Correct 178 ms 30204 KB Output is correct
57 Correct 262 ms 39936 KB Output is correct
58 Correct 264 ms 39972 KB Output is correct
59 Correct 8 ms 9804 KB Output is correct
60 Correct 8 ms 9824 KB Output is correct
61 Correct 7 ms 9804 KB Output is correct
62 Correct 389 ms 49212 KB Output is correct
63 Correct 400 ms 49452 KB Output is correct
64 Correct 418 ms 49040 KB Output is correct
65 Correct 10 ms 10244 KB Output is correct
66 Correct 12 ms 10700 KB Output is correct
67 Correct 199 ms 29920 KB Output is correct
68 Correct 282 ms 39620 KB Output is correct
69 Correct 459 ms 49768 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct
17 Correct 377 ms 49052 KB Output is correct
18 Correct 378 ms 49060 KB Output is correct
19 Correct 456 ms 49488 KB Output is correct
20 Correct 415 ms 46776 KB Output is correct
21 Correct 365 ms 44568 KB Output is correct
22 Correct 10 ms 9804 KB Output is correct
23 Correct 60 ms 16280 KB Output is correct
24 Correct 19 ms 11912 KB Output is correct
25 Correct 52 ms 16968 KB Output is correct
26 Correct 93 ms 22032 KB Output is correct
27 Correct 214 ms 29528 KB Output is correct
28 Correct 257 ms 34480 KB Output is correct
29 Correct 361 ms 39244 KB Output is correct
30 Correct 395 ms 44052 KB Output is correct
31 Correct 471 ms 48740 KB Output is correct
32 Correct 430 ms 49320 KB Output is correct
33 Correct 385 ms 49260 KB Output is correct
34 Correct 11 ms 10316 KB Output is correct
35 Correct 13 ms 10828 KB Output is correct
36 Correct 180 ms 29668 KB Output is correct
37 Correct 282 ms 39444 KB Output is correct
38 Correct 450 ms 49616 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9804 KB Output is correct
2 Correct 7 ms 9804 KB Output is correct
3 Correct 7 ms 9804 KB Output is correct
4 Correct 7 ms 9828 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 9 ms 9804 KB Output is correct
7 Correct 7 ms 9804 KB Output is correct
8 Correct 9 ms 9804 KB Output is correct
9 Correct 181 ms 32396 KB Output is correct
10 Correct 19 ms 12236 KB Output is correct
11 Correct 75 ms 21908 KB Output is correct
12 Correct 27 ms 13260 KB Output is correct
13 Correct 27 ms 15068 KB Output is correct
14 Correct 9 ms 9932 KB Output is correct
15 Correct 11 ms 10128 KB Output is correct
16 Correct 223 ms 32344 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 8 ms 9892 KB Output is correct
19 Correct 8 ms 9804 KB Output is correct
20 Correct 8 ms 9888 KB Output is correct
21 Correct 8 ms 9804 KB Output is correct
22 Correct 9 ms 9872 KB Output is correct
23 Correct 413 ms 49196 KB Output is correct
24 Correct 8 ms 9804 KB Output is correct
25 Correct 9 ms 10060 KB Output is correct
26 Correct 9 ms 10120 KB Output is correct
27 Correct 10 ms 10188 KB Output is correct
28 Correct 143 ms 25784 KB Output is correct
29 Correct 224 ms 33464 KB Output is correct
30 Correct 339 ms 41548 KB Output is correct
31 Correct 405 ms 49256 KB Output is correct
32 Correct 8 ms 9804 KB Output is correct
33 Correct 9 ms 9804 KB Output is correct
34 Correct 8 ms 9804 KB Output is correct
35 Correct 8 ms 9804 KB Output is correct
36 Correct 8 ms 9804 KB Output is correct
37 Correct 9 ms 9804 KB Output is correct
38 Correct 9 ms 9896 KB Output is correct
39 Correct 10 ms 9804 KB Output is correct
40 Correct 8 ms 9808 KB Output is correct
41 Correct 9 ms 9932 KB Output is correct
42 Correct 8 ms 9804 KB Output is correct
43 Correct 10 ms 10044 KB Output is correct
44 Correct 10 ms 10188 KB Output is correct
45 Correct 174 ms 30220 KB Output is correct
46 Correct 286 ms 40108 KB Output is correct
47 Correct 289 ms 40052 KB Output is correct
48 Correct 7 ms 9804 KB Output is correct
49 Correct 8 ms 9896 KB Output is correct
50 Correct 9 ms 9804 KB Output is correct
51 Correct 9 ms 9804 KB Output is correct
52 Correct 9 ms 9804 KB Output is correct
53 Correct 9 ms 9896 KB Output is correct
54 Correct 9 ms 9804 KB Output is correct
55 Incorrect 425 ms 46376 KB Tree @(3, 95049) appears more than once: for edges on positions 4 and 5
56 Halted 0 ms 0 KB -