栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 3152 Food Competition

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 3152 Food Competition

#include <cstdio>#include <vector>#include <algorithm>using namespace std;#  define CHECK(v, l, r)#  define CHECK_NZ(v)int main() {    int n, a, b;    long long w, wa, wb, va1, va2, vb1, vb2;    long long l, r, m, ww, ta, tb;    bool fa, fb;    double ansa, ansb;    int p[50000], d[50000];    vector<long long> pa, pb;    while (scanf("%d%d%d", &n, &a, &b) != EOF) {        CHECK(n, 0, 50000);        CHECK(a, -100000000, -1);        CHECK(b, 1, 100000000);        pa.clear();        pb.clear();        ww = 0;        for (int i = 0; i < n; ++i) { scanf("%d", &p[i]); CHECK(p[i], a, b); CHECK_NZ(p[i]);        }        for (int i = 0; i < n; ++i) { scanf("%d", &d[i]); CHECK(d[i], -1, 1); CHECK_NZ(d[i]);        }        scanf("%lld%lld%lld%lld%lld%lld%lld", &w, &va1, &va2, &wa, &vb1, &vb2, &wb);        CHECK((int)w, 1, 87654321);        CHECK((int)va1, 1, 1000);        CHECK((int)va2, 1, 1000);        CHECK((int)wa, 1, 1000);        CHECK((int)vb1, 1, 1000);        CHECK((int)vb2, 1, 1000);        CHECK((int)wb, 1, 1000);        swap(va1, vb1);        swap(va2, vb2);        ta = -a * (va1 + va2);        tb = b * (vb1 + vb2);        for (int i = 0; i < n; ++i) { if (p[i] < 0) {     if (d[i] == -1) {         pa.push_back(ta + va2 * -p[i]);         w += wa;     } else {         pa.push_back(ta - va1 * -p[i]);     } } else {     if (d[i] == 1) {         pb.push_back(tb + vb2 * p[i]);         w += wb;     } else{         pb.push_back(tb - vb1 * p[i]);     } }        }        l = 0LL;        r = 0x7f7f7f7f7f7f7f7fLL;        while (l < r) { m = (l + r) / 2; ww = w; for (int i = 0; ww > 0 && i < pa.size(); ++i) {     ww -= (m + pa[i]) / ta * wa; } for (int i = 0; ww > 0 && i < pb.size(); ++i) {     ww -= (m + pb[i]) / tb * wb; } if (ww <= 0) {     r = m; } else {     l = m + 1; }        }        m = r;        fa = fb = false;        ansa = ansb = 0;        for (int i = 0; i < pa.size(); ++i) { ww = (m + pa[i]) / ta * wa; if ((m + pa[i]) % ta == 0) {     ww -= wa;     fa = true; } w -= ww; ansa += ww;        }        for (int i = 0; i < pb.size(); ++i) { ww = (m + pb[i]) / tb * wb; if ((m + pb[i]) % tb == 0) {     ww -= wb;     fb = true; } w -= ww; ansb += ww;        }        if (fa && fb) { CHECK(w, 1, wa + wb); if (wa * 2 < w) {     ansa += wa;     ansb += w - wa; } else if (wb * 2 < w) {     ansa += w - wb;     ansb += wb; } else {     ansa += w / 2.0;     ansb += w / 2.0; }        } else if (fa) { CHECK(w, 1, wa); ansa += w;        } else if (fb) { CHECK(w, 1, wb); ansb += w;        } else { CHECK(w, 0, 0);        }        printf("%.1lf %.1lfn", ansa, ansb);    }    return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/374082.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号