切换到宽版
  • 8340阅读
  • 5回复

Money Systems [复制链接]

上一主题 下一主题
离线stevenjl
 

只看楼主 倒序阅读 0 发表于: 2006-02-01

2.2 PROB Money Systems





这个题目的测试点10十分变态
我写好程序,就是通不过
又没有优化方法
只好提交几十次,终于通过了一次^_^





TASK: money
LANG: PASCAL

Compiling...
Compile: OK

Executing...
sending data (money) money /home/kolstad/trainweb

Test 1 OK [0.003 secs]
Test 2 OK [0.003 secs]
Test 3 OK [0.003 secs]
Test 4 OK [0.005 secs]
Test 5 OK [0.018 secs]
Test 6 OK [0.09 secs]
Test 7 OK [0.004 secs]
Test 8 OK [0.005 secs]
Test 9 OK [0.005 secs]
Test 10 OK [0.99 secs]
Test 11 OK [0.005 secs]
Test 12 OK [0.017 secs]
Test 13 OK [0.029 secs]

All tests OK.





Your program ('money') produced all correct answers!  This is your
submission #36 for this problem.  Congratulations!





紧接着的下一次就又失败了^_^





TASK: money
LANG: PASCAL

Compiling...
Compile: OK

Executing...
sending data (money) money /home/kolstad/trainweb

Test 1 OK [0.003 secs]
Test 2 OK [0.003 secs]
Test 3 OK [0.004 secs]
Test 4 OK [0.005 secs]
Test 5 OK [0.018 secs]
Test 6 OK [0.093 secs]
Test 7 OK [0.003 secs]
Test 8 OK [0.005 secs]
Test 9 OK [0.006 secs]
Execution error: Your program (`money') used more than the allotted
runtime of 1 seconds (it ended or was stopped at 1.011 seconds) when
presented with test case 10, shown below.

----- Test Case 10 ------
5 10000
5 8 13 21 34
----------------------------





我写的程序:




但这样过总是不好的,各位有什么好办法吗?

Dream Walker...
离线archimedes

只看该作者 1 发表于: 2006-02-02
网上抄的标程,说是1s过,没读它~
  1. program money;
  2. const
  3. maxv=25;
  4. maxn=10000;
  5. var
  6. fin,fout:text;
  7. value:array[1..maxv]of integer;
  8. m:array[0..maxn]of int64;
  9. v,n,i,j:integer;
  10. begin
  11. fillchar(m,sizeof(m),0);
  12. assign(fin,'money.in');
  13. reset(fin);
  14. readln(fin,v,n);
  15. for i:=1 to v do begin
  16.   read(fin,value[i]);
  17.   m[0]:=1;
  18. end;
  19. close(fin);
  20. for i:=1 to v do
  21.   for j:=1 to n do
  22.     if value[i]<=j then m[j]:=m[j]+m[j-value[i]];
  23. assign(fout,'money.out');
  24. rewrite(fout);
  25. writeln(fout,m[n]);
  26. close(fout);
  27. end.
离线stevenjl

只看该作者 2 发表于: 2006-02-02
的确强,在读
Dream Walker...
离线velicue
只看该作者 3 发表于: 2006-04-02
我在做这题呢!能否贴出CASE10的测试数据?
离线stevenjl

只看该作者 4 发表于: 2006-04-02
----- Test Case 10 ------
5 10000
5 8 13 21 34
Dream Walker...
离线blueblood
只看该作者 5 发表于: 2006-07-02
今天刚刚做, 用的记忆化搜索,可是想交的时候发现usaco上不去了。
[ 此贴被blueblood在2006-07-06 11:29重新编辑 ]
快速回复
限100 字节
 
上一个 下一个