oj.uz

Submission #435685

# Submission time Handle Problem Language Result Execution time Memory
435685 2021-06-23T15:03:12 Z DanerZein Fountain Parks (IOI21_parks) C++17
15 / 100
 368 ms 48544 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){
	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,0));
	if(xk-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));
	}
	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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct
17 Correct 11 ms 9660 KB Output is correct
18 Correct 10 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 10 ms 9676 KB Output is correct
21 Correct 10 ms 9704 KB Output is correct
22 Correct 10 ms 9676 KB Output is correct
23 Correct 359 ms 48544 KB Output is correct
24 Correct 10 ms 9708 KB Output is correct
25 Correct 13 ms 9956 KB Output is correct
26 Correct 13 ms 10188 KB Output is correct
27 Correct 14 ms 10240 KB Output is correct
28 Correct 137 ms 25324 KB Output is correct
29 Correct 230 ms 33012 KB Output is correct
30 Correct 289 ms 40872 KB Output is correct
31 Correct 360 ms 48472 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 9 ms 9676 KB Output is correct
34 Correct 10 ms 9700 KB Output is correct
35 Correct 8 ms 9600 KB Output is correct
36 Correct 10 ms 9712 KB Output is correct
37 Correct 9 ms 9676 KB Output is correct
38 Correct 9 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 11 ms 9804 KB Output is correct
42 Correct 9 ms 9716 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 11 ms 10060 KB Output is correct
45 Correct 135 ms 24580 KB Output is correct
46 Correct 211 ms 31912 KB Output is correct
47 Correct 200 ms 31896 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct
17 Correct 11 ms 9660 KB Output is correct
18 Correct 10 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 10 ms 9676 KB Output is correct
21 Correct 10 ms 9704 KB Output is correct
22 Correct 10 ms 9676 KB Output is correct
23 Correct 359 ms 48544 KB Output is correct
24 Correct 10 ms 9708 KB Output is correct
25 Correct 13 ms 9956 KB Output is correct
26 Correct 13 ms 10188 KB Output is correct
27 Correct 14 ms 10240 KB Output is correct
28 Correct 137 ms 25324 KB Output is correct
29 Correct 230 ms 33012 KB Output is correct
30 Correct 289 ms 40872 KB Output is correct
31 Correct 360 ms 48472 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 9 ms 9676 KB Output is correct
34 Correct 10 ms 9700 KB Output is correct
35 Correct 8 ms 9600 KB Output is correct
36 Correct 10 ms 9712 KB Output is correct
37 Correct 9 ms 9676 KB Output is correct
38 Correct 9 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 11 ms 9804 KB Output is correct
42 Correct 9 ms 9716 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 11 ms 10060 KB Output is correct
45 Correct 135 ms 24580 KB Output is correct
46 Correct 211 ms 31912 KB Output is correct
47 Correct 200 ms 31896 KB Output is correct
48 Correct 9 ms 9676 KB Output is correct
49 Correct 11 ms 9676 KB Output is correct
50 Correct 9 ms 9676 KB Output is correct
51 Incorrect 9 ms 9676 KB Tree @(5, 5) appears more than once: for edges on positions 3 and 6
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct
17 Correct 9 ms 9676 KB Output is correct
18 Correct 10 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 354 ms 39372 KB Output is correct
21 Correct 333 ms 39068 KB Output is correct
22 Correct 368 ms 38692 KB Output is correct
23 Correct 216 ms 34728 KB Output is correct
24 Correct 81 ms 18552 KB Output is correct
25 Correct 144 ms 30408 KB Output is correct
26 Correct 189 ms 30488 KB Output is correct
27 Correct 242 ms 36780 KB Output is correct
28 Correct 249 ms 36760 KB Output is correct
29 Correct 256 ms 36892 KB Output is correct
30 Correct 264 ms 36760 KB Output is correct
31 Correct 10 ms 9676 KB Output is correct
32 Incorrect 30 ms 12028 KB Tree @(185691, 20403) appears more than once: for edges on positions 1379 and 7140
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct
17 Correct 357 ms 38476 KB Output is correct
18 Correct 297 ms 38536 KB Output is correct
19 Incorrect 350 ms 38868 KB Tree @(50001, 5) appears more than once: for edges on positions 0 and 149994
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9676 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 10 ms 9676 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 10 ms 9612 KB Output is correct
8 Correct 10 ms 9676 KB Output is correct
9 Correct 138 ms 27844 KB Output is correct
10 Correct 19 ms 11596 KB Output is correct
11 Correct 62 ms 19480 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 36 ms 15744 KB Output is correct
14 Correct 10 ms 9804 KB Output is correct
15 Correct 11 ms 9920 KB Output is correct
16 Correct 143 ms 27304 KB Output is correct
17 Correct 11 ms 9660 KB Output is correct
18 Correct 10 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 10 ms 9676 KB Output is correct
21 Correct 10 ms 9704 KB Output is correct
22 Correct 10 ms 9676 KB Output is correct
23 Correct 359 ms 48544 KB Output is correct
24 Correct 10 ms 9708 KB Output is correct
25 Correct 13 ms 9956 KB Output is correct
26 Correct 13 ms 10188 KB Output is correct
27 Correct 14 ms 10240 KB Output is correct
28 Correct 137 ms 25324 KB Output is correct
29 Correct 230 ms 33012 KB Output is correct
30 Correct 289 ms 40872 KB Output is correct
31 Correct 360 ms 48472 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 9 ms 9676 KB Output is correct
34 Correct 10 ms 9700 KB Output is correct
35 Correct 8 ms 9600 KB Output is correct
36 Correct 10 ms 9712 KB Output is correct
37 Correct 9 ms 9676 KB Output is correct
38 Correct 9 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 11 ms 9804 KB Output is correct
42 Correct 9 ms 9716 KB Output is correct
43 Correct 10 ms 9932 KB Output is correct
44 Correct 11 ms 10060 KB Output is correct
45 Correct 135 ms 24580 KB Output is correct
46 Correct 211 ms 31912 KB Output is correct
47 Correct 200 ms 31896 KB Output is correct
48 Correct 9 ms 9676 KB Output is correct
49 Correct 11 ms 9676 KB Output is correct
50 Correct 9 ms 9676 KB Output is correct
51 Incorrect 9 ms 9676 KB Tree @(5, 5) appears more than once: for edges on positions 3 and 6
52 Halted 0 ms 0 KB -