zoukankan      html  css  js  c++  java
  • NWERC2016C

    题目大意

    按$V_{y0}=1$求$V_{x0}$使得通过$n$个加速区后可以到达给定点,加速区是平行于$x$轴的不相交条带,会改变经过时的$V_x=V_{x0} imes f_i$

    简要题解

    设出$V_{x0}$解方程直接得到公式。

    #include <bits/stdc++.h>
    using namespace std;
    namespace my_header {
    #define pb push_back
    #define mp make_pair
    #define pir pair<int, int>
    #define vec vector<int>
    #define pc putchar
    #define clr(t) memset(t, 0, sizeof t)
    #define pse(t, v) memset(t, v, sizeof t)
    #define bl puts("")
    #define wn(x) wr(x), bl
    #define ws(x) wr(x), pc(' ')
        const int INF = 0x3f3f3f3f;
        typedef long long LL;
        typedef double DB;
        inline char gchar() {
            char ret = getchar();
            for(; (ret == '
    ' || ret == '
    ' || ret == ' ') && ret != EOF; ret = getchar());
            return ret; }
        template<class T> inline void fr(T &ret, char c = ' ', int flg = 1) {
            for(c = getchar(); (c < '0' || '9' < c) && c != '-'; c = getchar());
            if (c == '-') { flg = -1; c = getchar(); }
            for(ret = 0; '0' <= c && c <= '9'; c = getchar())
                ret = ret * 10 + c - '0';
            ret = ret * flg; }
        inline int fr() { int t; fr(t); return t; }
        template<class T> inline void fr(T&a, T&b) { fr(a), fr(b); }
        template<class T> inline void fr(T&a, T&b, T&c) { fr(a), fr(b), fr(c); }
        template<class T> inline char wr(T a, int b = 10, bool p = 1) {
            return a < 0 ? pc('-'), wr(-a, b, 0) : (a == 0 ? (p ? pc('0') : p) : 
                (wr(a/b, b, 0), pc('0' + a % b)));
        }
        template<class T> inline void wt(T a) { wn(a); }
        template<class T> inline void wt(T a, T b) { ws(a), wn(b); }
        template<class T> inline void wt(T a, T b, T c) { ws(a), ws(b), wn(c); }
        template<class T> inline void wt(T a, T b, T c, T d) { ws(a), ws(b), ws(c), wn(d); }
        template<class T> inline T gcd(T a, T b) {
            return b == 0 ? a : gcd(b, a % b); }
        template<class T> inline T fpw(T b, T i, T _m, T r = 1) {
            for(; i; i >>= 1, b = b * b % _m)
                if(i & 1) r = r * b % _m;
            return r; }
    };
    using namespace my_header;
    
    
    int main() {
    #ifdef lol
        freopen("C.in", "r", stdin);
        freopen("C.out", "w", stdout);
    #endif
    
        DB x, y;
        scanf("%lf %lf", &x, &y);
        int n = fr();
        DB rem = y, mult = 0;
        for (int i = 1; i <= n; ++i) {
            DB l, u, f;
            scanf("%lf %lf %lf", &l, &u, &f);
            rem -= u - l;
            mult += (u - l) * f;
        }
        mult += rem;
        printf("%.12lf
    ", x / mult);
    
    
            
    
    
        return 0;
    }
  • 相关阅读:
    算法竞赛入门经典第一章习题解答
    程序实现求int类型和double类型的最大最小值范围
    程序实现求int类型和double类型的最大最小值范围
    程序实现求int类型和double类型的最大最小值范围
    程序实现求int类型和double类型的最大最小值范围
    机器狗组装费用 南邮NOJ 1076 优先权队列
    【HDOJ】2604 Queuing
    【HDOJ】1208 Pascal's Travels
    【HDOJ】4857 逃生
    【HDOJ】2510 符号三角形
  • 原文地址:https://www.cnblogs.com/ichn/p/6783223.html
Copyright © 2011-2022 走看看