oj.uz

답안 #699834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699834 2023-02-18T05:41:29 Z vjudge1 Fences (JOI18_fences) C++17
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 1e6 + 5;
const int M = 1e7 + 5;
const int B = 316;
const ll mod = 998244353;
const ll inf = 3e18;

struct Mat { vector<vector<ll>> mt = vector<vector<ll>> (15, vector<ll>(15, 0)); Mat operator *(const Mat& other) { Mat c; for (int i = 0; i <= 10; ++ i) { for (int j = 0; j <= 10; ++ j) { for (int k = 0; k <= 10; ++ k) { (c.mt[i][k] += mt[i][j] * other.mt[j][k]) %= mod; } } } return c; } };
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x,m);x=binmul(x,x,m);ti >>= 1; x %= m; res %= m;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n;
long double s, x[N], y[N], x2[N], y2[N];

long double tabu(long double x, long double y, long double x2, long double y2, long double x3, long double y3) {
    long double base = sqrt(pow(x3 - x2, 2) + pow(y3 - y2, 2));
    long double s1 = sqrt(pow(x - x2, 2) + pow(y - y2, 2));
    long double s2 = sqrt(pow(x - x3, 2) + pow(y - y3, 2));
    long double p = (base + s1 + s2) * 0.5;
    long double area = sqrt(p * (p - base) * (p - s1) * (p - s2));
    long double h = (area * 2.0) / base;
    long double mx = max({s1, s2});
    if (mx == s1 && s1*s1 > s2*s2 + base*base) return s2;
    else if (mx == s2 && s2*s2 > s1*s1+base*base) return s1;
    else return h;
}

const void solve() {
    cin >> n >> s;
    for (int i = 1; i <= n; ++ i) cin >> x[i] >> y[i] >> x2[i] >> y2[i];
    long double ans = s * 8;
    if (n == 1) {
        if (x[1] <= -s && x2[1] <= -s) {
            if (y[1] > y2[1]) swap(x[1], x2[1]), swap(y[1], y2[1]);
            long double dis1 = tabu(-s, -s, x[1], y[1], x2[1], y2[1]);
            long double dis2 = tabu(-s, s, x[1], y[1], x2[1], y2[1]);
            ans = min(ans, s * 6 + dis1 + dis2);
        } 
        if (x[1] >= s && x2[1] >= s) {
            if (y[1] > y2[1]) swap(x[1], x2[1]), swap(y[1], y2[1]);
            long double dis1 = tabu(s, s, x[1], y[1], x2[1], y2[1]);
            long double dis2 = tabu(s, -s, x[1], y[1], x2[1], y2[1]);
            ans = min(ans, s * 6 + dis1 + dis2);
        }
        if (y[1] <= -s && y2[1] <= -s) {
            if (x[1] > x2[1]) swap(x[1], x2[1]), swap(y[1], y2[1]);
            long double dis1 = tabu(-s, -s, x[1], y[1], x2[1], y2[1]);
            long double dis2 = tabu(s, -s, x[1], y[1], x2[1], y2[1]);
            ans = min(ans, s * 6 + dis1 + dis2);
        }
        if (y[1] >= s && y2[1] >= s) {
            if (x[1] > x2[1]) swap(x[1], x2[1]), swap(y[1], y2[1]);
            long double dis1 = tabu(-s, s, x[1], y[1], x2[1], y2[1]);
            long double dis2 = tabu(s, s, x[1], y[1], x2[1], y2[1]);
            ans = min(ans, s * 6 + dis1 + dis2);
        }
        cout << fixed << setprecision(10) << ans;
        return;
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));
    // file("cowsignal");

    int tt = 1;
    // cin >> tt;

    for (int i = 1; i <= tt; ++ i) {
        // cout << "Case " << i << ": ";
        solve();
    }

    return 0;
}

Compilation message

fences.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization("O3")
      | 
fences.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("unroll-loops")
      | 
fences.cpp:6: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    6 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -