oj.uz

Submission #814466

# Submission time Handle Problem Language Result Execution time Memory
814466 2023-08-08T07:41:14 Z becaido Fountain Parks (IOI21_parks) C++17
15 / 100
 444 ms 43804 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "parks.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

#ifdef WAIMAI
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);
#endif

const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
const int SIZE = 2e5 + 5;

vector<int> adj[SIZE];
map<pair<int, int>, int> mp;
int deg[SIZE], pa[SIZE];
queue<int> q;

int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    FOR (i, 0, n - 1) mp[{x[i], y[i]}] = i;
    FOR (i, 0, n - 1) FOR (j, 0, 3) {
        int tx = x[i] + 2 * dx[j];
        int ty = y[i] + 2 * dy[j];
        if (mp.count({tx, ty})) adj[i].pb(mp[{tx, ty}]);
    }
    q.push(0);
    fill(pa, pa + n, -1);
    while (q.size()) {
        int pos = q.front();
        q.pop();
        for (int np : adj[pos]) if (np != 0 && pa[np] == -1) {
            pa[np] = pos;
            deg[pos]++;
            q.push(np);
        }
    }
    FOR (i, 1, n - 1) if (pa[i] == -1) return 0;
    FOR (i, 0, n - 1) if (!deg[i]) q.push(i);
    vector<int> u, v, a, b;
    while (q.size()) {
        int pos = q.front();
        q.pop();
        if (pos == 0) break;
        u.pb(pos), v.pb(pa[pos]);
        if (--deg[pa[pos]] == 0) q.push(pa[pos]);
    }
    a.resize(n - 1), b.resize(n - 1);
    FOR (i, 0, n - 2) if (x[u[i]] == 2 && x[v[i]] == 2) {
        a[i] = x[u[i]] - 1;
        b[i] = (y[u[i]] + y[v[i]]) / 2;
    }
    FOR (i, 0, n - 2) if (x[u[i]] == 6 && x[v[i]] == 6) {
        a[i] = x[u[i]] + 1;
        b[i] = (y[u[i]] + y[v[i]]) / 2;
    }
    set<pair<int, int>> s;
    set<int> ys;
    vector<pair<int, int>> all;
    FOR (i, 0, n - 2) if (x[u[i]] != x[v[i]]) {
        all.pb(y[u[i]], i);
    }

    sort(all.begin(), all.end());
    for (auto [Y, i] : all) {
        int X = (x[u[i]] + x[v[i]]) / 2;
        Y--;
        if (ys.count(Y)) Y += 2;
        a[i] = X, b[i] = Y;
        ys.insert(b[i]);
        s.emplace(a[i], b[i]);
    }

    FOR (i, 0, n - 2) if (x[u[i]] == 4 && x[v[i]] == 4) {
        a[i] = x[u[i]] - 1, b[i] = (y[u[i]] + y[v[i]]) / 2;
        if (s.count({a[i], b[i]})) a[i] += 2;
        s.emplace(a[i], b[i]);
    }
    build(u, v, a, b);
    return 1;
}

/*
in1
5
4 4
4 6
6 4
4 2
2 4
out1
1
4
0 2 5 5
0 1 3 5
3 0 5 3
4 0 3 3

in2
2
2 2
4 6
out2
0
*/

#ifdef WAIMAI
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;
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 434 ms 43804 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 5 ms 5332 KB Output is correct
27 Correct 7 ms 5460 KB Output is correct
28 Correct 154 ms 22812 KB Output is correct
29 Correct 239 ms 31560 KB Output is correct
30 Correct 367 ms 40300 KB Output is correct
31 Correct 434 ms 43716 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5004 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 5 ms 5272 KB Output is correct
45 Correct 186 ms 26784 KB Output is correct
46 Correct 296 ms 36596 KB Output is correct
47 Correct 293 ms 36576 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 434 ms 43804 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 5 ms 5332 KB Output is correct
27 Correct 7 ms 5460 KB Output is correct
28 Correct 154 ms 22812 KB Output is correct
29 Correct 239 ms 31560 KB Output is correct
30 Correct 367 ms 40300 KB Output is correct
31 Correct 434 ms 43716 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5004 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 5 ms 5272 KB Output is correct
45 Correct 186 ms 26784 KB Output is correct
46 Correct 296 ms 36596 KB Output is correct
47 Correct 293 ms 36576 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4948 KB Output is correct
55 Correct 444 ms 42080 KB Output is correct
56 Correct 3 ms 4948 KB Output is correct
57 Incorrect 5 ms 5396 KB Tree @(5, 186769) appears more than once: for edges on positions 261 and 278
58 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct
17 Incorrect 3 ms 4948 KB a[0] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct
17 Incorrect 384 ms 43336 KB a[82418] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4976 KB Output is correct
9 Correct 139 ms 21592 KB Output is correct
10 Correct 11 ms 6740 KB Output is correct
11 Correct 62 ms 13892 KB Output is correct
12 Correct 16 ms 7760 KB Output is correct
13 Correct 36 ms 10092 KB Output is correct
14 Correct 3 ms 5080 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 141 ms 21604 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 434 ms 43804 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5272 KB Output is correct
26 Correct 5 ms 5332 KB Output is correct
27 Correct 7 ms 5460 KB Output is correct
28 Correct 154 ms 22812 KB Output is correct
29 Correct 239 ms 31560 KB Output is correct
30 Correct 367 ms 40300 KB Output is correct
31 Correct 434 ms 43716 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5004 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 5 ms 5272 KB Output is correct
45 Correct 186 ms 26784 KB Output is correct
46 Correct 296 ms 36596 KB Output is correct
47 Correct 293 ms 36576 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4948 KB Output is correct
55 Correct 444 ms 42080 KB Output is correct
56 Correct 3 ms 4948 KB Output is correct
57 Incorrect 5 ms 5396 KB Tree @(5, 186769) appears more than once: for edges on positions 261 and 278
58 Halted 0 ms 0 KB -