TopCoder SRM626 DIV1

最新推荐文章于 2019-01-24 21:49:00 发布

Albafica

最新推荐文章于 2019-01-24 21:49:00 发布

阅读量502

点赞数

分类专栏： TopCoderSRM

本文链接：https://blog.csdn.net/lenleaves/article/details/38343525

版权

TopCoderSRM 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

250

概率

// BEGIN CUT HERE

// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>

using namespace std;

typedef long long ll;

#define cpy(a,b) memcpy(a,b,sizeof(a));
#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)


double dp[60][55*55];

class FixedDiceGameDiv1
{
        public:

        vector<double> CalPro(int a,int b){
            int i,j,k;
            //clr(dp,0);
            dp[0][0]=1;
            FOR(i,1,a)
                FOR(j,1,a*b){
                    dp[i][j]=0;
                    FOR(k,1,min(j,b))
                        if(dp[i-1][j-k]!=0)
                            dp[i][j]+=dp[i-1][j-k]/b;
                }
            vector<double> res(a*b+1);
            REP(i,a*b+1){
                res[i]=dp[a][i];
            }
            return res;
        }
        double getExpectation(int a, int b, int c, int d)
        {
            int i,j,k;
            vector<double> alice,bob;
            alice=CalPro(a,b);
            bob=CalPro(c,d);
            double win=0;
            FOR(i,a,a*b)
                FOR(j,c,min(i-1,c*d))
                    win+=alice[i]*bob[j];
            if(win==0) return -1;
            double res=0;
            FOR(i,a,a*b)
                FOR(j,c,min(i-1,c*d)){
                    double p=alice[i]*bob[j];   //p(a=i,b=j,win)
                    double pw=p/win;            //p(a=i,b=j|win)
                    res+=pw*i;
                }
            return res;
        }

// BEGIN CUT HERE
	
// END CUT HERE

};
// BEGIN CUT HERE

// END CUT HERE

600

图论

// BEGIN CUT HERE

// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>

using namespace std;

typedef long long ll;

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)



class NegativeGraphDiv1
{
        public:
        ll g[60*2][60*2];

        vector<vector<ll> > func(vector<vector<ll> > A ,vector<vector<ll> > B){
            int n=sz(A);
            int i,j,k;
            vector<vector<ll> > C(n,vector<ll >(n));
            n--;
            FOR(i,1,n)
                FOR(j,1,n)
                    C[i][j]=0X3f3f3f3f;


            FOR(i,1,n)
                FOR(j,1,n)
                    FOR(k,1,n){
                        C[i][j]=min(C[i][j],A[i][k]+B[k][j]);
                    }
            return C;
        }

        long long findMin(int N, vector <int> from, vector <int> to, vector <int> weight, int charges)
        {
            int i,j,k;
            int n=sz(from);
            FOR(i,1,N*2)
                FOR(j,1,N*2)
                    g[i][j]=0x3f3f3f3f;
            REP(i,n){
                int u=from[i];
                int v=to[i];
                ll w=weight[i];
                g[u][v]=min(w,g[u][v]);
                g[u+N][v+N]=min(w,g[u+N][v+N]);
                g[u+N][v]=min(-w,g[u+N][v]);
            }
            FOR(k,1,2*N)
                FOR(i,1,2*N)
                    FOR(j,1,2*N)
                        g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
            if(charges==0)
                return g[1][N];
            vector<vector<ll> > D(N+1,vector<ll>(N+1));
            vector<vector<ll> > A(N+1,vector<ll>(N+1));
            FOR(i,1,N){
                FOR(j,1,N){
                    D[i][j]=0x3f3f3f3f;
                    A[i][j]=g[i+N][j];
                }
                D[i][i]=0;
                A[i][i]=min(0ll,A[i][i]);
            }
            int K=charges;
            while(K>0){
                if(K%2){
                    D=func(D,A);
                }
                A=func(A,A);
                K/=2;

            }
            return D[1][N];
        }

// BEGIN CUT HERE
	

// END CUT HERE

};
// BEGIN CUT HERE

// END CUT HERE

900

数学

// BEGIN CUT HERE

// END CUT HERE
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <utility>
#include <iterator>

using namespace std;

typedef long long ll;

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define REP(i,n) for(i=0;i<(n);++i)
#define FOR(i,l,h) for(i=(l);i<=(h);++i)
#define FORD(i,h,l) for(i=(h);i>=(l);--i)

const ll mod=1000000007;
#define bit(x,i) ((1<<i)&x)

class ReflectiveRectangle
{
        public:
        vector<int> getFactors(int n){
            vector<int> res;
            for(int i=2;i<=n/i;i++){
                if(n%i==0)
                    res.pb(i);
                while(n%i==0)
                    n/=i;
            }
            if(n>1) res.pb(n);
            return res;
        }

        ll cal(ll n){
            ll a=(n*2+1);
            ll b=(n+1)*n/2;
            if(b%3==0) return b/3%mod*a%mod;
            else return b%mod*(a/3)%mod;

        }

        int findSum(int sideA, int sideB, int bounces)
        {
            int i,j,k,n;
            if(bounces%2)
                return 0;
            ll B=bounces+2;
            vector<int> factors=getFactors(B);
            ll res=0;
            n=sz(factors);
            REP(i,(1<<n)){
                ll mul=1;
                int op=1;
                REP(j,n)
                    if(bit(i,j))
                        mul*=factors[j],op*=-1;
                ll nn=(B-1)/mul;
                ll sum=(mul%mod*mul%mod*cal(nn)%mod)%mod;
                if(op<0) res=(res-sum+mod)%mod;
                else res=(res+sum)%mod;
            }
            res=((ll)sideA*sideA%mod+(ll)sideB*sideB%mod)%mod*res;
            return res%mod;
        }

// BEGIN CUT HERE
	public:
	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
	private:
	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
	void test_case_0() { int Arg0 = 3; int Arg1 = 4; int Arg2 = 0; int Arg3 = 25; verify_case(0, Arg3, findSum(Arg0, Arg1, Arg2)); }
	void test_case_1() { int Arg0 = 3; int Arg1 = 3; int Arg2 = 2; int Arg3 = 180; verify_case(1, Arg3, findSum(Arg0, Arg1, Arg2)); }
	void test_case_2() { int Arg0 = 13; int Arg1 = 17; int Arg2 = 1; int Arg3 = 0; verify_case(2, Arg3, findSum(Arg0, Arg1, Arg2)); }
	void test_case_3() { int Arg0 = 59325; int Arg1 = 31785; int Arg2 = 262142; int Arg3 = 48032850; verify_case(3, Arg3, findSum(Arg0, Arg1, Arg2)); }
	void test_case_4() { int Arg0 = 1000000; int Arg1 = 1000000; int Arg2 = 1000000000; int Arg3 = 145972110; verify_case(4, Arg3, findSum(Arg0, Arg1, Arg2)); }

// END CUT HERE

};
// BEGIN CUT HERE
int main()
{
        ReflectiveRectangle ___test;
        ___test.run_test(-1);
        return 0;
}
// END CUT HERE

Albafica

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
TopCoder SRM626 DIV1

250 概率// BEGIN CUT HERE// END CUT HERE#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #incl
复制链接

扫一扫

专栏目录