2006/3/29 23:49 新TJU第一次提交…… 578408 Crearfar 1000 Wrong Answer 56 k 4 ms C++ 2006-03-29 23:49:21 578407 kzc_tc 1081 Wrong Answer 268 k 532 ms Free Pascal 2005-11-11 10:09:09 pic.1 The Long Period TJU终于恢复了…… 不过估计需要很长时间才能够重新聚集人气…… 到目前已经有1560次提交了……
关于上次发的USACO C 比 Pascal 快的问题……USACO 2006 March Gold problem 1: skilift O(nk)Pascal: 9 10 11 TLE >2sC: 9 (1.3xs) TLE 10 (1.039s) TLE 11 (1.039s) TLE后来把存储数据改成了long(原来是long long)，只在比较的时候强制转换long long (Analysis的做法）C: 9 (0.579s) AC 10 (0.398s) AC 11 (0.389s) ACC 里面的 long long就是慢啊…… 一倍差距啊……
今天证实了USACO的C比Pascal快…… 有两件事可以说明： 1.USACO 1.4.2 buylow 同样的算法（我照着Pascal打的C程序），Pascal 1.015s TLE C 0.875s AC 2.USACO 2006 March Analysis用的算法和LTY用的一样，我后来也编了一下，都是O(nk)的，LTY TLE 3个点 难道Analysis的程序会TLE？ 所以，希望 USACO 能够延长 Pascal 的时限 否则也太……
There happened few things when I updated FreeBSD from 5.3 to 5.4, 5.2.1 to 5.3, and so on. But when I updated from 5.4 to 6.0, many problems appeared.First, for the version of the libraries has inreased, now there are 2 versions of libraries in my FreeBSD. For instance, libc.so.5 and libc.so.6, libstdc++, and so …
Continue reading ‘FreeBSD: the great problem of updating from 5.4 to 6.0’ »
终于AC了~~~修正了非常多的小BUG，使用随机测试非常多次，终于AC了~从最初的100行左右，涨到了22x行~~~新年新气象啊~下面是验证程序~ 不过不判无解的~const maxn=100; var c,t,p,q,n:longint; l,r:array[1..maxn,1..maxn]of longint; d:array[1..maxn]of longint; col:array[1..maxn,1..2]of byte; s:string; begin assign(input,’sgu121.in’);reset(input); readln(n); for t:=1 to n do begin read(p); while p<>0 do begin inc(d[t]); l[t,d[t]]:=p; read(p); end; end; close(input); p:=0; assign(input,’sgu121.out’);reset(input); readln(s); if s=’No solution’ then begin writeln(‘Reported No solution…’); exit; end; reset(input); for t:=1 to n do begin read(p);c:=0; while p<>0 …