oj.uz

답안 #623784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623784 2022-08-06T13:27:56 Z Vladth11 Roads (CEOI20_roads) C++14
15 / 100
 78 ms 11868 KB 
#include <bits/stdc++.h>
#define C 1
#define P 0
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <long double, long double> pii;

const ll NMAX = 100001;
const ll VMAX = 101;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 447;
const ll base = 117;
const ll nr_of_bits = 18;
const ll inv2 = 500000004;

map <pii, pii> mp;
pii v[NMAX * 2];

struct ura{
    pii a, b;
};

vector <ura> sol;
map <pii, bool> scutit;
long double slope = 1;

bool mic(pii a, pii b){
    return a < b;
}

bool cmp(pii a, pii b){
    return (mic(a, b));
}

long double d(pii a, pii b){
    return sqrt((a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second));
}

map <pii, pair <int, int> > cine;

int main() {
    //ifstream cin(".in");
    //ofstream cout(".out");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, i;
    cin >> n;
    for(i = 1; i <= n; i++){
        pii a, b;
        cin >> a.first >> a.second >> b.first >> b.second;
        if(mic(a, b))
            swap(a, b);
        v[i] = a;
        pii c = {a.first, 0};
        c.second = a.second + d(a, b);
        cine[c] = b;
      	cine[a] = a;
        b = c;
        mp[a] = b;
        mp[b] = a;
    }
    sort(v + 1, v + n + 1, cmp);
    for(i = 1; i < n; i++){
        sol.push_back({v[i], mp[v[i + 1]]});
    }
    for(auto x : sol){
        cout << cine[x.a].first << " " << cine[x.a].second << " " << cine[x.b].first << " " << cine[x.b].second << "\n";
    }
    return 0;
}

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 340 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 34 ms 6108 KB Output is correct
5 Correct 75 ms 11844 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 34 ms 6084 KB Output is correct
5 Correct 78 ms 11868 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Failed 4 ms 884 KB Condition failed: "!Cross(S[*pi], S[*pa])"
9 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 36 ms 6120 KB Output is correct
5 Correct 74 ms 11788 KB Output is correct
6 Failed 0 ms 340 KB Condition failed: "pf == Sline.end() || !Cross(S[*pa], S[*pf])"
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 340 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 340 KB Condition failed: "!Cross(S[*pi], S[*pa])"
2 Halted 0 ms 0 KB -