Submission #371954

---

Source Code Expand

#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double R;
typedef tuple<ll, ll, ll, ll> Q;

Q solve(R xx, R yy) {
//    printf("%Lf %Lf\n", xx, yy);
    xx *= 1000; yy *= 1000;
//    printf("%Lf %Lf\n", xx, yy);
    ll x = (ll)round(xx), y = (ll)round(yy);
    ll xm = x % 1000, ym = y % 1000;
    xm = (xm + 1000) % 1000;
    if (!xm) xm = 1000;
    ym = (ym + 1000) % 1000;
    if (!ym) ym = 1000;
//    printf("d%lld %lld %lld %lld\n", x, y, xm, ym);
    if (xm == 0 && ym == 0) {
        xm = ym = 1;
    }
    ll xd = (x - xm) / 1000, yd = (y - ym) / 1000;    
    return Q(xd, yd, xd-xm, yd-ym);
}

int main() {
    R xx, yy;
    cin >> xx >> yy;
    ll a, b, c, d;
    tie(a, b, c, d) = solve(xx, yy);
    printf("%lld %lld %lld %lld\n", a, b, c, d);
    tie(a, b, c, d) = solve(xx, -yy);
    b = -b; d = -d;
    printf("%lld %lld %lld %lld\n", a, b, c, d);
    return 0;
}

Submission Info

Judge Result