oj.uz

답안 #814403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814403 2023-08-08T07:18:38 Z becaido 분수 공원 (IOI21_parks) C++17
15 / 100
 526 ms 38044 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;
    set<pair<int, int>> s;
    while (q.size()) {
        int pos = q.front();
        q.pop();
        if (pos == 0) break;
        int lx, ly, rx, ry;
        tie(lx, ly) = make_pair(x[pos], y[pos]);
        tie(rx, ry) = make_pair(x[pa[pos]], y[pa[pos]]);
        u.pb(pos), v.pb(pa[pos]);
        int mx = (lx + rx) / 2, my = (ly + ry) / 2;
        if (lx == rx) {
            if (lx == 2) a.pb(lx - 1), b.pb(my);
            else a.pb(lx + 1), b.pb(my);
        } else {
            a.pb(mx), b.pb(ly - 1);
        }
        if (u.size() > a.size()) assert(0);
        if (--deg[pa[pos]] == 0) q.push(pa[pos]);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct
17 Correct 3 ms 4992 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 511 ms 38044 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 5 ms 5336 KB Output is correct
27 Correct 6 ms 5460 KB Output is correct
28 Correct 151 ms 18452 KB Output is correct
29 Correct 276 ms 25056 KB Output is correct
30 Correct 360 ms 31728 KB Output is correct
31 Correct 526 ms 38000 KB Output is correct
32 Correct 4 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 4 ms 4948 KB Output is correct
38 Correct 4 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 4 ms 4948 KB Output is correct
43 Correct 6 ms 5204 KB Output is correct
44 Correct 5 ms 5256 KB Output is correct
45 Correct 207 ms 21648 KB Output is correct
46 Correct 299 ms 29020 KB Output is correct
47 Correct 342 ms 29032 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct
17 Correct 3 ms 4992 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 511 ms 38044 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 5 ms 5336 KB Output is correct
27 Correct 6 ms 5460 KB Output is correct
28 Correct 151 ms 18452 KB Output is correct
29 Correct 276 ms 25056 KB Output is correct
30 Correct 360 ms 31728 KB Output is correct
31 Correct 526 ms 38000 KB Output is correct
32 Correct 4 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 4 ms 4948 KB Output is correct
38 Correct 4 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 4 ms 4948 KB Output is correct
43 Correct 6 ms 5204 KB Output is correct
44 Correct 5 ms 5256 KB Output is correct
45 Correct 207 ms 21648 KB Output is correct
46 Correct 299 ms 29020 KB Output is correct
47 Correct 342 ms 29032 KB Output is correct
48 Correct 3 ms 4968 KB Output is correct
49 Incorrect 3 ms 4948 KB Tree @(5, 5) appears more than once: for edges on positions 0 and 2
50 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct
17 Correct 3 ms 4996 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 4 ms 4948 KB Output is correct
20 Correct 501 ms 37936 KB Output is correct
21 Incorrect 506 ms 38036 KB Tree @(99999, 100003) appears more than once: for edges on positions 0 and 2
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct
17 Correct 474 ms 38020 KB Output is correct
18 Incorrect 498 ms 38032 KB Tree @(50003, 100001) appears more than once: for edges on positions 99996 and 100000
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5008 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 159 ms 21572 KB Output is correct
10 Correct 15 ms 6812 KB Output is correct
11 Correct 57 ms 13992 KB Output is correct
12 Correct 22 ms 7764 KB Output is correct
13 Correct 36 ms 10076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 149 ms 21580 KB Output is correct
17 Correct 3 ms 4992 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 511 ms 38044 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5204 KB Output is correct
26 Correct 5 ms 5336 KB Output is correct
27 Correct 6 ms 5460 KB Output is correct
28 Correct 151 ms 18452 KB Output is correct
29 Correct 276 ms 25056 KB Output is correct
30 Correct 360 ms 31728 KB Output is correct
31 Correct 526 ms 38000 KB Output is correct
32 Correct 4 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 4 ms 4948 KB Output is correct
38 Correct 4 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 4 ms 4948 KB Output is correct
43 Correct 6 ms 5204 KB Output is correct
44 Correct 5 ms 5256 KB Output is correct
45 Correct 207 ms 21648 KB Output is correct
46 Correct 299 ms 29020 KB Output is correct
47 Correct 342 ms 29032 KB Output is correct
48 Correct 3 ms 4968 KB Output is correct
49 Incorrect 3 ms 4948 KB Tree @(5, 5) appears more than once: for edges on positions 0 and 2
50 Halted 0 ms 0 KB -