oj.uz

Submission #997514

# Submission time Handle Problem Language Result Execution time Memory
997514 2024-06-12T12:52:51 Z crafticat Drawing (CEOI22_drawing) C++17
30 / 100
 1500 ms 9332 KB 
#include <bits/stdc++.h>

using namespace std;
using pii = pair<int,int>;

vector<vector<int>> g;
vector<bool> vis;
constexpr int inf = 1e9;
struct point {
    int x, y;

    point(int x, int y) : x(x), y(y) {}
    point() = default;
    point operator-(point other) {
        return {x - other.x,y - other.y};
    }
    int operator*(point other) {
        return x * other.y - y * other.x;
    }
};

vector<point> m;

vector<pair<point,int>> points;
vector<int> ans;

// 1 to 2, 2 to 3
int getAngle(point p1, point p2, point p3) {
    return (p3 - p1) * (p2 - p1);
}
//1
//5
//2
//6
//3
//4

void solve(int x, int par) {
    auto prev = m[par];
    for (auto child : g[x]) {
        if (par == child) continue;
        int sel = -1;
        int selId = -1;
        for (int i = 0; i < points.size(); ++i) {
            auto [p,id] = points[i];
            if (vis[i]) continue;
            int ang = getAngle(m[x],p,points[sel == -1 ? 0 : sel].first);
            if (ang > 0 || sel == -1) {
                sel = i;
                selId = id;
                break;
            }
        }

        m[child] = points[sel].first;
        vis[sel] = true;
        ans[selId] = child;
        solve(child,x);
    }
}

point leftSide;

bool comp(pair<point,int> a, pair<point,int> b) {
    return getAngle(leftSide,a.first,b.first) > 0;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int n; cin >> n;

    g.resize(n + 1);
    for (int i = 0; i < n - 1; ++i) {
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    points.resize(n);
    vis.resize(n + 1);

    int bestP = 0;
    for (int i = 0; i < n; ++i) {
        int x, y; cin >> x >> y;
        points[i] = {{x, y},i};
        if (points[bestP].first.x > x) {
            bestP = i;
        }
        if (points[bestP].first.x == x && points[bestP].first.y < y) {
            bestP = i;
        }
    }

    m.resize(n + 1);
    leftSide = points[bestP].first;
    sort(points.begin(),points.end(),comp);
    for (auto [p, i] : points) {
        if (points[bestP].first.x > p.x) {
            bestP = i;
        }
        if (points[bestP].first.x == p.x && points[bestP].first.y < p.x) {
            bestP = i;
        }
    }

    m[0] = {0,0};
    m[1] = leftSide;
    vis[bestP] = true;
    ans.resize(n + 1);
    ans[points[bestP].second] = 1;

    solve(1,0);

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << "\n";
    }

    return 0;
}

Compilation message

Main.cpp: In function 'void solve(int, int)':
Main.cpp:44:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<point, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int i = 0; i < points.size(); ++i) {
      |                         ~~^~~~~~~~~~~~~~~
Main.cpp:39:10: warning: variable 'prev' set but not used [-Wunused-but-set-variable]
   39 |     auto prev = m[par];
      |          ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1587 ms 9332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 8 ms 908 KB Output is correct
3 Correct 8 ms 676 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 15 ms 856 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 14 ms 860 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 8 ms 604 KB Output is correct
14 Correct 8 ms 860 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 8 ms 908 KB Output is correct
3 Correct 8 ms 676 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 15 ms 856 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 14 ms 860 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 8 ms 604 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 41 ms 1112 KB Output is correct
16 Correct 49 ms 1628 KB Output is correct
17 Correct 43 ms 1428 KB Output is correct
18 Correct 39 ms 1760 KB Output is correct
19 Correct 40 ms 1896 KB Output is correct
20 Correct 40 ms 1248 KB Output is correct
21 Correct 40 ms 1368 KB Output is correct
22 Correct 39 ms 1116 KB Output is correct
23 Correct 38 ms 1512 KB Output is correct
24 Correct 40 ms 1372 KB Output is correct
25 Correct 38 ms 1836 KB Output is correct
26 Correct 39 ms 1872 KB Output is correct
27 Correct 44 ms 1116 KB Output is correct
28 Correct 38 ms 1392 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 8 ms 908 KB Output is correct
3 Correct 8 ms 676 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 15 ms 856 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 14 ms 860 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 8 ms 604 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 41 ms 1112 KB Output is correct
16 Correct 49 ms 1628 KB Output is correct
17 Correct 43 ms 1428 KB Output is correct
18 Correct 39 ms 1760 KB Output is correct
19 Correct 40 ms 1896 KB Output is correct
20 Correct 40 ms 1248 KB Output is correct
21 Correct 40 ms 1368 KB Output is correct
22 Correct 39 ms 1116 KB Output is correct
23 Correct 38 ms 1512 KB Output is correct
24 Correct 40 ms 1372 KB Output is correct
25 Correct 38 ms 1836 KB Output is correct
26 Correct 39 ms 1872 KB Output is correct
27 Correct 44 ms 1116 KB Output is correct
28 Correct 38 ms 1392 KB Output is correct
29 Execution timed out 1570 ms 6492 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1587 ms 9332 KB Time limit exceeded
2 Halted 0 ms 0 KB -