oj.uz

Submission #435646

# Submission time Handle Problem Language Result Execution time Memory
435646 2021-06-23T14:09:24 Z DanerZein Fountain Parks (IOI21_parks) C++17
15 / 100
 373 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){
    bool sw=0;
    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);
	if(sw){
	  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));
	}
	sw^=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 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 9 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 12 ms 9624 KB Output is correct
22 Correct 10 ms 9680 KB Output is correct
23 Correct 361 ms 48472 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 12 ms 9932 KB Output is correct
26 Correct 12 ms 10060 KB Output is correct
27 Correct 14 ms 10276 KB Output is correct
28 Correct 147 ms 25312 KB Output is correct
29 Correct 220 ms 33012 KB Output is correct
30 Correct 280 ms 40824 KB Output is correct
31 Correct 373 ms 48544 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 12 ms 9704 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 10 ms 9676 KB Output is correct
36 Correct 10 ms 9676 KB Output is correct
37 Correct 10 ms 9676 KB Output is correct
38 Correct 10 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 10 ms 9676 KB Output is correct
42 Correct 12 ms 9608 KB Output is correct
43 Correct 12 ms 9872 KB Output is correct
44 Correct 12 ms 10060 KB Output is correct
45 Correct 137 ms 24544 KB Output is correct
46 Correct 190 ms 31904 KB Output is correct
47 Correct 192 ms 31972 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 9 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 12 ms 9624 KB Output is correct
22 Correct 10 ms 9680 KB Output is correct
23 Correct 361 ms 48472 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 12 ms 9932 KB Output is correct
26 Correct 12 ms 10060 KB Output is correct
27 Correct 14 ms 10276 KB Output is correct
28 Correct 147 ms 25312 KB Output is correct
29 Correct 220 ms 33012 KB Output is correct
30 Correct 280 ms 40824 KB Output is correct
31 Correct 373 ms 48544 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 12 ms 9704 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 10 ms 9676 KB Output is correct
36 Correct 10 ms 9676 KB Output is correct
37 Correct 10 ms 9676 KB Output is correct
38 Correct 10 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 10 ms 9676 KB Output is correct
42 Correct 12 ms 9608 KB Output is correct
43 Correct 12 ms 9872 KB Output is correct
44 Correct 12 ms 10060 KB Output is correct
45 Correct 137 ms 24544 KB Output is correct
46 Correct 190 ms 31904 KB Output is correct
47 Correct 192 ms 31972 KB Output is correct
48 Correct 9 ms 9676 KB Output is correct
49 Correct 10 ms 9656 KB Output is correct
50 Incorrect 10 ms 9676 KB Tree @(5, 3) appears more than once: for edges on positions 3 and 5
51 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct
17 Correct 9 ms 9676 KB Output is correct
18 Correct 9 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 373 ms 39452 KB Output is correct
21 Incorrect 304 ms 38996 KB Tree @(15, 9) appears more than once: for edges on positions 6 and 100007
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct
17 Correct 322 ms 38484 KB Output is correct
18 Correct 301 ms 38576 KB Output is correct
19 Correct 300 ms 38860 KB Output is correct
20 Correct 270 ms 41880 KB Output is correct
21 Correct 273 ms 36632 KB Output is correct
22 Correct 11 ms 9676 KB Output is correct
23 Incorrect 46 ms 14280 KB Tree @(185097, 20847) appears more than once: for edges on positions 3080 and 17205
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9768 KB Output is correct
2 Correct 10 ms 9696 KB Output is correct
3 Correct 9 ms 9676 KB Output is correct
4 Correct 11 ms 9676 KB Output is correct
5 Correct 11 ms 9596 KB Output is correct
6 Correct 9 ms 9676 KB Output is correct
7 Correct 9 ms 9676 KB Output is correct
8 Correct 9 ms 9676 KB Output is correct
9 Correct 131 ms 27860 KB Output is correct
10 Correct 23 ms 11596 KB Output is correct
11 Correct 67 ms 19452 KB Output is correct
12 Correct 23 ms 12500 KB Output is correct
13 Correct 38 ms 15684 KB Output is correct
14 Correct 10 ms 9808 KB Output is correct
15 Correct 12 ms 9932 KB Output is correct
16 Correct 166 ms 27364 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 9 ms 9676 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 11 ms 9676 KB Output is correct
21 Correct 12 ms 9624 KB Output is correct
22 Correct 10 ms 9680 KB Output is correct
23 Correct 361 ms 48472 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 12 ms 9932 KB Output is correct
26 Correct 12 ms 10060 KB Output is correct
27 Correct 14 ms 10276 KB Output is correct
28 Correct 147 ms 25312 KB Output is correct
29 Correct 220 ms 33012 KB Output is correct
30 Correct 280 ms 40824 KB Output is correct
31 Correct 373 ms 48544 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 12 ms 9704 KB Output is correct
34 Correct 9 ms 9676 KB Output is correct
35 Correct 10 ms 9676 KB Output is correct
36 Correct 10 ms 9676 KB Output is correct
37 Correct 10 ms 9676 KB Output is correct
38 Correct 10 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 10 ms 9676 KB Output is correct
42 Correct 12 ms 9608 KB Output is correct
43 Correct 12 ms 9872 KB Output is correct
44 Correct 12 ms 10060 KB Output is correct
45 Correct 137 ms 24544 KB Output is correct
46 Correct 190 ms 31904 KB Output is correct
47 Correct 192 ms 31972 KB Output is correct
48 Correct 9 ms 9676 KB Output is correct
49 Correct 10 ms 9656 KB Output is correct
50 Incorrect 10 ms 9676 KB Tree @(5, 3) appears more than once: for edges on positions 3 and 5
51 Halted 0 ms 0 KB -