55 条题解

  • 0
    @ 2006-11-01 17:20:49

    数轴上的带权中点....+垃圾数据=cheat

  • 0
    @ 2006-10-18 10:03:13

    Longint ---|60

    Int64 ---|80

    cheat ---|100

  • 0
    @ 2006-10-11 19:53:35

    先动态规划

    然后枚举

    然后回朔

    然后递归

    然后递推

    最后输出

  • 0
    @ 2006-09-28 21:23:33

    问一下:你们诸位牛人测试数据都是哪里搞来的?

  • 0
    @ 2006-09-24 11:58:35

    什么时候改了数据的话说一下~ 既然我都80了 还是先cheat过吧 实在是懒得写高精

  • 0
    @ 2006-09-22 17:56:09

    汗一个...........有必要Cheat吗。。。。不用Cheat至少90的啊啊

  • 0
    @ 2006-09-23 09:08:10

    第六个数据变态了,怎么超过了10^31次方啊。我第十个数据没问题,但第六个就超时,第八个错误。也得了80分

  • 0
    @ 2006-09-21 19:41:55

    佩服楼下的仁兄....

    这样都行.

  • 0
    @ 2006-09-18 19:48:49

    http://www.vijos.cn/Test_ShowBody.asp?id=1010&userid=919

    居然有人在考试的时候还做到90分。。。!!!???。。。

  • 0
    @ 2006-09-18 17:45:34

    同意……

    面对80分就满意了……

    要100分就cheat了……

  • 0
    @ 2006-09-18 15:01:38

    同意,真不知道数据6和数据10是怎么出的...

  • -1
    @ 2016-11-30 16:42:25
    #include <algorithm>
    #include <iostream>
    #include <string>
    #include <cmath>
    using namespace std;
    double Min = 99999999999999999999LL,man[10001],dist[10001];
    int n = 1,num;
    string country[5001];
    int main() {
        while (cin >> man[n] >> dist[n] >> country[n]) n++;
        n--;
        for (int i = 1;i <= n;i++) {
            double s = 0;
            for (int j = 1;j <= n;j++) s += man[j]*fabs(dist[i]-dist[j]);
            if (s < Min) {
              Min = s;
              num = i;
            }
        }
        cout << country[num];
        return 0;
    }
    
  • -1
    @ 2014-07-17 20:28:33

    测试数据 #0: Accepted, time = 0 ms, mem = 772 KiB, score = 10

    测试数据 #1: Accepted, time = 0 ms, mem = 772 KiB, score = 10

    测试数据 #2: Accepted, time = 0 ms, mem = 764 KiB, score = 10

    测试数据 #3: Accepted, time = 0 ms, mem = 772 KiB, score = 10

    测试数据 #4: Accepted, time = 0 ms, mem = 772 KiB, score = 10

    测试数据 #5: Accepted, time = 0 ms, mem = 772 KiB, score = 10

    测试数据 #6: Accepted, time = 15 ms, mem = 764 KiB, score = 10

    测试数据 #7: Accepted, time = 0 ms, mem = 768 KiB, score = 10

    测试数据 #8: Accepted, time = 0 ms, mem = 764 KiB, score = 10

    测试数据 #9: Accepted, time = 15 ms, mem = 772 KiB, score = 10

    Accepted, time = 30 ms, mem = 772 KiB, score = 100
    水题,不需要想的太复杂

  • -1
    @ 2014-03-01 21:57:23

    测试数据 #0: WrongAnswer, time = 0 ms, mem = 616 KiB, score = 0
    测试数据 #1: WrongAnswer, time = 0 ms, mem = 616 KiB, score = 0
    测试数据 #2: WrongAnswer, time = 0 ms, mem = 616 KiB, score = 0
    测试数据 #3: WrongAnswer, time = 15 ms, mem = 616 KiB, score = 0
    测试数据 #4: WrongAnswer, time = 0 ms, mem = 620 KiB, score = 0
    测试数据 #5: WrongAnswer, time = 0 ms, mem = 612 KiB, score = 0
    测试数据 #6: WrongAnswer, time = 0 ms, mem = 616 KiB, score = 0
    测试数据 #7: WrongAnswer, time = 0 ms, mem = 620 KiB, score = 0
    测试数据 #8: WrongAnswer, time = 0 ms, mem = 620 KiB, score = 0
    测试数据 #9: WrongAnswer, time = 0 ms, mem = 612 KiB, score = 0
    WrongAnswer, time = 15 ms, mem = 620 KiB, score = 0
    代码
    begin
    write('VIJOS');
    end.

  • -1
    @ 2009-08-04 12:09:40

    朴素O(n^2)AC....

信息

ID
1225
难度
6
分类
高精度 | 其他 | 排序 点击显示
标签
(无)
递交数
1189
已通过
276
通过率
23%
被复制
5
上传者