oj.uz

Submission #532213

# Submission time Handle Problem Language Result Execution time Memory
532213 2022-03-02T13:46:30 Z Icebear16 Fountain Parks (IOI21_parks) C++17
5 / 100
 192 ms 23420 KB 
#include "parks.h"
#include <bits/stdc++.h>
int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
	build({}, {}, {}, {});
        return 1;
    }else{
	    std::vector<int> u, v, a, b;
	    std::vector<std::pair<int,int>> A;
	    for(int i=0;i<x.size();i++){
	    	A.push_back(std::make_pair((x[i]+2*y[i]),i));
		}
		sort(A.begin(),A.end());
		int r=x.size()-1;
		int m=y[A[0].second];
		int w=y[A[r].second];
		int e=((w-m)/2)+1; 
		std::vector<int> B(e,-1);
		std::vector<int> C(e,-1);
		for(int i=0;i<x.size();i++){
			if(x[i]==2){
				B[(y[i]-m)/2]=i;
			}else{
				C[(y[i]-m)/2]=i;
			}
		}
		bool flag=true;
	    for(int i=0;i<e;i++){
	    	if(B[i]==-1 && C[i]==-1){
	    		flag=false;
	    		break;
			}
		}
		if(flag==true){
			for(int i=0;i<e;i++){
				if(B[i]>=0 && C[i]>=0){
			    	u.push_back(B[i]);
			    	v.push_back(C[i]);
				    a.push_back(3);
			    	b.push_back((i*2)+m+1);
				}
				if(B[i]>=0 && B[i+1]>=0 && (i+1)!=e){
			    	u.push_back(B[i]);
			    	v.push_back(B[i+1]);
				    a.push_back(1);
			    	b.push_back((i*2)+m+1);
				}
				if(C[i]>=0 && C[i+1]>=0 && (i+1)!=e){
			    	u.push_back(C[i]);
			    	v.push_back(C[i+1]);
				    a.push_back(5);
			    	b.push_back((i*2)+m+1);
				}
			}
		    build(u, v, a, b);
		    return 1;
		}else{
			return 0;
		}
	}
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |      for(int i=0;i<x.size();i++){
      |                  ~^~~~~~~~~
parks.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   for(int i=0;i<x.size();i++){
      |               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 2 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 192 ms 23420 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 432 KB Output is correct
26 Correct 2 ms 692 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 58 ms 9932 KB Output is correct
29 Correct 126 ms 13760 KB Output is correct
30 Correct 119 ms 20068 KB Output is correct
31 Correct 161 ms 23364 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Incorrect 0 ms 208 KB Given structure is not connected: There is no path between vertices 0 and 1
36 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 2 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 192 ms 23420 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 432 KB Output is correct
26 Correct 2 ms 692 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 58 ms 9932 KB Output is correct
29 Correct 126 ms 13760 KB Output is correct
30 Correct 119 ms 20068 KB Output is correct
31 Correct 161 ms 23364 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Incorrect 0 ms 208 KB Given structure is not connected: There is no path between vertices 0 and 1
36 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct
17 Incorrect 1 ms 284 KB Pair u[0]=2 @(199998, 2) and v[0]=1 @(200000, 4) does not form a valid edge (distance != 2)
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct
17 Incorrect 106 ms 15760 KB Pair u[0]=199575 @(2, 2) and v[0]=199999 @(62538, 2) does not form a valid edge (distance != 2)
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 57 ms 9712 KB Output is correct
10 Correct 5 ms 1280 KB Output is correct
11 Correct 29 ms 5200 KB Output is correct
12 Correct 14 ms 1712 KB Output is correct
13 Correct 9 ms 1996 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 944 KB Output is correct
16 Correct 60 ms 9672 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 2 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 192 ms 23420 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 432 KB Output is correct
26 Correct 2 ms 692 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 58 ms 9932 KB Output is correct
29 Correct 126 ms 13760 KB Output is correct
30 Correct 119 ms 20068 KB Output is correct
31 Correct 161 ms 23364 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Incorrect 0 ms 208 KB Given structure is not connected: There is no path between vertices 0 and 1
36 Halted 0 ms 0 KB -