oj.uz

Submission #999467

# Submission time Handle Problem Language Result Execution time Memory
999467 2024-06-15T14:28:49 Z yoav_s Roads (CEOI20_roads) C++17
0 / 100
 2 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

#define double long double

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

p operator+(p a, p b)
{
    return p(a.f + b.f, a.s + b.s);
}

p operator-(p a, p b)
{
    return p(a.f - b.f, a.s - b.s);
}

ll operator*(p a, p b)
{
    return a.s * b.f - a.f * b.s;
}

const double pi = 3.14159265358979323846264338327950288419716939937510;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll N;
    cin >> N;
    vector<pair<p,p>> edges(N);
    for (ll i = 0; i < N; i++) cin >> edges[i].f.f >> edges[i].f.s >> edges[i].s.f >> edges[i].s.s;
    for (ll i = 0 ;i < N; i++)
    {
        edges[i] = {min(edges[i].f, edges[i].s), max(edges[i].f, edges[i].s)};
    }
    complex<double> diff(edges[0].s.f - edges[0].f.f, edges[0].s.s - edges[0].f.s);
    double angle = arg(diff);
    vector<pair<double, double>> identifier(N);
    for (ll i= 0 ; i < N; i++)
    {
        complex<double> comp = complex<double>(edges[i].f.f, edges[i].f.s);
        comp = polar(abs(comp), arg(comp) - pi / 2 + angle);
        identifier[i] = {comp.real(), comp.imag()};
    }
    v perm(N);
    for (ll i = 0; i < N; i++) perm[i] = i;
    sort(all(perm), [&identifier](ll i, ll j){return identifier[i] < identifier[j];});
    vector<pair<p, p>> edgesSorted;
    for (ll i=  0; i < N; i++) edgesSorted.pb(edges[perm[i]]);
    for (ll i = 0; i < (ll)edges.size() - 1; i++)
    {
        cout << edgesSorted[i].f.f << " " << edgesSorted[i].f.s << " " << edgesSorted[i + 1].f.f << " " << edgesSorted[i + 1].f.s << "\n";
    }
    return 0;
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 348 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 2 ms 600 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 2 ms 600 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 2 ms 524 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Failed 0 ms 344 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 348 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
2 Halted 0 ms 0 KB -