oj.uz

답안 #621026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
621026 2022-08-03T11:13:23 Z MKopchev 분수 공원 (IOI21_parks) C++17
30 / 100
 414 ms 39656 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);

map< pair<int,int>, int > seen;

int ask(int x,int y)
{
    if(seen.count({x,y}))return seen[{x,y}];

    return -1;
}

int parent[nmax];

int root(int node)
{
    if(node==parent[node])return node;

    parent[node]=root(parent[node]);

    return parent[node];
}

set< pair<int,int> > benches;

struct point
{
    int x,y,id;
};

bool cmp(point a,point b)
{
    if(a.x!=b.x)return a.x<b.x;
    return a.y<b.y;
}

point inp[nmax];

int construct_roads(std::vector<int> x, std::vector<int> y) {

    int n=x.size();

    if (n == 1) {
	build({}, {}, {}, {});
        return 1;
    }

    for(int i=0;i<x.size();i++)
        seen[{x[i],y[i]}]=i;

    for(int i=0;i<n;i++)
    {
        parent[i]=i;

        inp[i].x=x[i];
        inp[i].y=y[i];
        inp[i].id=i;
    }

    sort(inp,inp+n,cmp);

    vector<int> u={},v={},a={},b={};

    for(int j=0;j<n;j++)
    {
        int pos=ask(inp[j].x+2,inp[j].y);

        if(pos!=-1&&root(pos)!=root(inp[j].id))
        {
            parent[root(pos)]=root(inp[j].id);

            u.push_back(inp[j].id);
            v.push_back(pos);

            pair<int,int> bench={inp[j].x+1,inp[j].y-1};

            if(benches.count(bench))bench.second+=2;

            a.push_back(bench.first);
            b.push_back(bench.second);

            benches.insert(bench);
        }

        pos=ask(inp[j].x,inp[j].y+2);

        if(pos!=-1&&root(pos)!=root(inp[j].id))
        {
            parent[root(pos)]=root(inp[j].id);

            u.push_back(inp[j].id);
            v.push_back(pos);

            pair<int,int> bench={inp[j].x-1,inp[j].y+1};

            if(benches.count(bench))bench.first+=2;

            a.push_back(bench.first);
            b.push_back(bench.second);

            benches.insert(bench);
        }
    }

    for(int i=0;i<n;i++)
        if(root(i)!=root(0))return 0;

    build(u,v,a,b);

    return 1;
}

/*
static void check(bool cond, string message) {
	if (!cond) {
		printf("%s\n", message.c_str());
		fclose(stdout);
		exit(0);
	}
}

static int n;
static bool build_called;
static int m;
static vector<int> _u, _v, _a, _b;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) {
	check(!build_called, "build is called more than once");
	build_called = true;
	m = u.size();
	check(int(v.size()) == m, "u.size() != v.size()");
	check(int(a.size()) == m, "u.size() != a.size()");
	check(int(b.size()) == m, "u.size() != b.size()");
	_u = u;
	_v = v;
	_a = a;
	_b = b;
}

int main() {
	assert(scanf("%d", &n) == 1);
	vector<int> x(n), y(n);
	for (int i = 0; i < n; i++) {
		assert(scanf("%d%d", &x[i], &y[i]) == 2);
	}
	fclose(stdin);

	build_called = false;
	const int possible = construct_roads(x, y);

	check(possible == 0 || possible == 1, "Invalid return value of construct_roads()");
	if (possible == 1) {
		check(build_called, "construct_roads() returned 1 without calling build()");
	} else {
		check(!build_called, "construct_roads() called build() but returned 0");
	}

	printf("%d\n", possible);
	if (possible == 1) {
		printf("%d\n", m);
		for (int j = 0; j < m; j++) {
			printf("%d %d %d %d\n", _u[j], _v[j], _a[j], _b[j]);
		}
	}
	fclose(stdout);
	return 0;
}
*/

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 354 ms 37984 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 123 ms 15284 KB Output is correct
29 Correct 206 ms 22784 KB Output is correct
30 Correct 273 ms 30328 KB Output is correct
31 Correct 347 ms 37920 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 143 ms 19096 KB Output is correct
46 Correct 234 ms 27552 KB Output is correct
47 Correct 234 ms 27500 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 354 ms 37984 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 123 ms 15284 KB Output is correct
29 Correct 206 ms 22784 KB Output is correct
30 Correct 273 ms 30328 KB Output is correct
31 Correct 347 ms 37920 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 143 ms 19096 KB Output is correct
46 Correct 234 ms 27552 KB Output is correct
47 Correct 234 ms 27500 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 361 ms 39396 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 9 ms 1556 KB Output is correct
59 Correct 10 ms 2004 KB Output is correct
60 Correct 154 ms 19816 KB Output is correct
61 Correct 225 ms 26656 KB Output is correct
62 Correct 306 ms 32780 KB Output is correct
63 Correct 350 ms 39512 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 1 ms 324 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 324 ms 39492 KB Output is correct
68 Correct 360 ms 39656 KB Output is correct
69 Correct 345 ms 39336 KB Output is correct
70 Correct 4 ms 964 KB Output is correct
71 Correct 7 ms 1620 KB Output is correct
72 Correct 145 ms 19892 KB Output is correct
73 Correct 238 ms 29788 KB Output is correct
74 Correct 328 ms 39540 KB Output is correct
75 Correct 414 ms 39524 KB Output is correct
76 Correct 385 ms 39480 KB Output is correct
77 Correct 5 ms 1108 KB Output is correct
78 Correct 10 ms 1864 KB Output is correct
79 Correct 160 ms 19952 KB Output is correct
80 Correct 237 ms 29728 KB Output is correct
81 Correct 329 ms 39588 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 361 ms 38796 KB Output is correct
21 Correct 340 ms 37812 KB Output is correct
22 Correct 341 ms 38188 KB Output is correct
23 Correct 273 ms 32340 KB Output is correct
24 Correct 183 ms 19088 KB Output is correct
25 Correct 301 ms 31500 KB Output is correct
26 Correct 269 ms 31560 KB Output is correct
27 Correct 329 ms 37792 KB Output is correct
28 Correct 333 ms 37936 KB Output is correct
29 Correct 348 ms 37920 KB Output is correct
30 Correct 345 ms 37920 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 19 ms 3236 KB Tree @(185725, 20413) appears more than once: for edges on positions 632 and 633
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct
17 Correct 330 ms 37864 KB Output is correct
18 Correct 338 ms 37808 KB Output is correct
19 Correct 356 ms 38276 KB Output is correct
20 Correct 320 ms 38704 KB Output is correct
21 Correct 284 ms 34620 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 41 ms 6860 KB Tree @(185191, 20673) appears more than once: for edges on positions 1216 and 1217
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 144 ms 19028 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 68 ms 10372 KB Output is correct
12 Correct 16 ms 3388 KB Output is correct
13 Correct 41 ms 7152 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 150 ms 19156 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 354 ms 37984 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 123 ms 15284 KB Output is correct
29 Correct 206 ms 22784 KB Output is correct
30 Correct 273 ms 30328 KB Output is correct
31 Correct 347 ms 37920 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 143 ms 19096 KB Output is correct
46 Correct 234 ms 27552 KB Output is correct
47 Correct 234 ms 27500 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 361 ms 39396 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 9 ms 1556 KB Output is correct
59 Correct 10 ms 2004 KB Output is correct
60 Correct 154 ms 19816 KB Output is correct
61 Correct 225 ms 26656 KB Output is correct
62 Correct 306 ms 32780 KB Output is correct
63 Correct 350 ms 39512 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 1 ms 324 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 324 ms 39492 KB Output is correct
68 Correct 360 ms 39656 KB Output is correct
69 Correct 345 ms 39336 KB Output is correct
70 Correct 4 ms 964 KB Output is correct
71 Correct 7 ms 1620 KB Output is correct
72 Correct 145 ms 19892 KB Output is correct
73 Correct 238 ms 29788 KB Output is correct
74 Correct 328 ms 39540 KB Output is correct
75 Correct 414 ms 39524 KB Output is correct
76 Correct 385 ms 39480 KB Output is correct
77 Correct 5 ms 1108 KB Output is correct
78 Correct 10 ms 1864 KB Output is correct
79 Correct 160 ms 19952 KB Output is correct
80 Correct 237 ms 29728 KB Output is correct
81 Correct 329 ms 39588 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 361 ms 38796 KB Output is correct
86 Correct 340 ms 37812 KB Output is correct
87 Correct 341 ms 38188 KB Output is correct
88 Correct 273 ms 32340 KB Output is correct
89 Correct 183 ms 19088 KB Output is correct
90 Correct 301 ms 31500 KB Output is correct
91 Correct 269 ms 31560 KB Output is correct
92 Correct 329 ms 37792 KB Output is correct
93 Correct 333 ms 37936 KB Output is correct
94 Correct 348 ms 37920 KB Output is correct
95 Correct 345 ms 37920 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Incorrect 19 ms 3236 KB Tree @(185725, 20413) appears more than once: for edges on positions 632 and 633
98 Halted 0 ms 0 KB -