codejam 2015 Round 1A

A. Mushroom Monster 很水

int main()
{
    int Tcase;
    if(freopen("A-large-practice.in","r",stdin)==NULL)printf("failed!\n");
    if(freopen("A-large-practice.out","w",stdout)==NULL)printf("failed!\n");
    int N;
    int nums[1000];
    int ans1,ans2;
    int maxdif;
    while(cin >> Tcase){
        for(int tcase = 1;tcase<= Tcase;tcase++){
            cin >> N;
            for(int i = 0;i < N;i++)
                cin >>nums[i];
            maxdif = ans1 = ans2 = 0;
            for(int i = 1;i < N;i++){
                if(nums[i] < nums[i-1]){
                    ans1+=(nums[i-1] - nums[i]);
                    maxdif = maxdif > (nums[i-1] - nums[i]) ? maxdif:(nums[i-1] -nums[i]);
                }
            }
            for(int i = 1;i < N;i++){
                if(nums[i-1] < maxdif) ans2+=nums[i-1];
                else ans2+=maxdif;
            }
            printf("Case #%d: %d %d\n",tcase,ans1,ans2);
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}

B. Haircut  枚举理发师，判断成功与否，复杂度大概Blog(N)

bool ok(long long Mk[],int Mklen,long long N,int cur_id){
    long long low = 0,high = N,mid;
    long long time,tnum;
    while(low <= high){
        mid = (low+high) /2;
        time =  mid * Mk[cur_id];
        tnum = 0;
        for(int i = 0;tnum <= N &&i <= cur_id;i++){
            tnum+= (time / Mk[i] + 1);
        }
        time --;
        for(int i = cur_id+1;tnum <= N &&i < Mklen;i++){
            tnum+= (time / Mk[i] + 1);
        }
        if(tnum > N)
            high = mid - 1;
        else if(tnum < N)low = mid + 1;
        else return true;
    }
    return false;
}

int main()
{
    int Tcase;
    if(freopen("B-large-practice.in","r",stdin)==NULL)printf("failed!\n");
    if(freopen("B-large-practice.out","w",stdout)==NULL)printf("failed!\n");
    long long B,N;
    long long Mk[1000];
    int ans;
    while(cin >> Tcase){
        for(int tcase = 1;tcase<= Tcase;tcase++){
            my_type cur_barber;
            cin >> B>>N;
            for(int i = 0;i < B;i++)
                cin >>Mk[i];
            for(int i = 0;i < B;i++){
                if(ok(Mk,B,N,i)){
                    ans = i+1;
                    break;
                }
            }

            printf("Case #%d: %d\n",tcase,ans);
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}

C. Logging 枚举点对，然后判断叉积的正负个数，对于每个点来说，所有与其他的点的点对的叉积正/负个数的最小值为所求。

只是注意，少于3个点的话，所有点都是边界。

typedef struct{
    long long x,y;
}MyPoint,MyVector;

int main()
{
    int Tcase;
    if(freopen("C-large-practice.in","r",stdin)==NULL)printf("failed!\n");
    if(freopen("C-large-practice.out","w",stdout)==NULL)printf("failed!\n");
    int N;
    MyPoint points[3000];
    int ans[3000];
    MyVector cur_vec,tmp_vec;
    int minussum,plussum,tmpmin;
    long long tmpcross;
    while(cin >> Tcase){
        for(int tcase = 1;tcase<= Tcase;tcase++){
            cin>>N;
            for(int i = 0;i < N;i++){
                cin >>points[i].x>>points[i].y;
                ans[i] = 3000;
            }
            if(tcase < 10)continue;
            if(N <= 3)
                for(int i = 0;i < N;i++)ans[i] = 0;
            printf("Case #%d:\n",tcase);
            for(int i = 0;i < N;i++){
                    for(int j = i+1;j<N;j++){
                            if(j == i)continue;
                        tmpmin = 3000;
                        cur_vec.x = points[j].x - points[i].x;
                        cur_vec.y = points[j].y - points[i].y;
                        minussum = plussum = 0;
                        for(int k = 0;k<N;k++){
                            tmp_vec.x = points[k].x - points[i].x;
                            tmp_vec.y = points[k].y - points[i].y;
                            tmpcross = tmp_vec.x*cur_vec.y - cur_vec.x*tmp_vec.y;
                            if(tmpcross>0)plussum++;
                            else if(tmpcross < 0)minussum++;
                        }
                        tmpmin = tmpmin < plussum?tmpmin:plussum;
                        tmpmin = tmpmin < minussum?tmpmin:minussum;
                        ans[i] = tmpmin < ans[i]?tmpmin:ans[i];
                        ans[j] = tmpmin < ans[j]?tmpmin:ans[j];
                    }
            }
            for(int i = 0;i < N;i++)
                cout << ans[i] <<endl;
        }
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}