## Search found 13 matches

Sun Mar 12, 2006 11:07 am
Forum: Volume 110 (11000-11099)
Topic: 11002 - Towards Zero
Replies: 39
Views: 17413
If I understood, you found bounds for each cell like min(x,y) and max(x,y) and you use in DP numbers only between those 2 values.
Sat Mar 11, 2006 5:58 pm
Forum: Volume 110 (11000-11099)
Topic: 11002 - Towards Zero
Replies: 39
Views: 17413

### 11002 - Towards Zero

I solved this problem in 02.924 s using DP. I used 25040 KB of memory . I would be very pleased if anybody would tell me better method or some optimalization of DP method.
Thu Feb 16, 2006 1:16 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12344
What is correct output for: 8 20 1 3 3 4 5 1 3 3 6 1 2 3 4 5 6 5 1 2 3 4 5 8 1 2 3 4 5 6 7 8 2 1 2 1 1 1 1 7 1 2 3 4 5 6 7 1 1 6 1 2 3 4 5 6 2 1 2 2 1 2 1 1 4 1 2 3 4 2 1 2 6 1 2 3 4 5 6 2 1 2 6 1 2 3 4 5 6 6 1 2 3 4 5 6 3 1 2 3 7 1 2 3 4 5 6 7 2 5 3 5 2 1 2 1 1 1 1 2 1 2 2 1 2 9 18 3 5 4 1 2 4 1 3 ...
Thu Feb 16, 2006 12:57 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12344
Or maybe someone knows any tricky input???
Wed Feb 15, 2006 10:53 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12344

### 10092

I'm trying to solve problem 10092 but I'm getting WA. I'm buildig graph like this: conect every category with sink (capicty= numbers of problems for this category). if problem i is in category j I conect (j,i) (capicty=1) and fianlly I conect evry problem with the sink (capicty=1). and find max flow...
Fri Jan 27, 2006 11:38 pm
Forum: Volume 100 (10000-10099)
Topic: 10051 - Tower of Cubes
Replies: 19
Views: 8688

### To people he have WA.

I got 3 WA befor I changed may array. So I think that limits for this problem are diffrent from those which are given. I got AC when changed limits to 1<N<600 and numbers of colors 1 to 200.
Sat Oct 01, 2005 10:02 pm
Forum: Volume 109 (10900-10999)
Topic: 10918 - Tri Tiling
Replies: 12
Views: 6025
Very strange think, before I submit my program i thought that for n=0 answer is 0 but now i see that if you want to have ACC you should return 1 for n=0. All in All i think that there is a mistake in a test files.
Sat Oct 01, 2005 9:52 pm
Forum: Volume 109 (10900-10999)
Topic: 10918 - Tri Tiling
Replies: 12
Views: 6025
1
0
0
0
0
i think the answer should be :
0
0
0
0
0
Tue Jun 07, 2005 12:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10098 - Generating Fast
Replies: 62
Views: 13592

### 10098 - Output limit I don't know why

This is my code: type literka= record z:char; wsk:byte; end; lista= array[0..10] of literka; slowo= record tab:array[1..10] of char; poz:byte; level:byte; znaki:lista; end; var stos:array[1..20] of slowo; pokaz:array[1..10] of slowo; dl,il,i,n:word; lp:integer; t:string; procedure swap(a,b:byte); va...
Tue Jun 07, 2005 10:52 am
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 29387

### 10487 WA- I don't know why.

This is my code: #include <stdio.h> long t,akt; long tab[1001]; int n,m,c,i; void licz(long co); void sortowanie(int p, int k); void uprosc(); int main() { c=0; while (1==1) { scanf("%d",&n); if (n==0) return 0; c++; for (i=1;i<=n;i++) scanf("%d",&tab ); sortowanie(1,n); uprosc(); scanf("%d",&m); pr...
Tue May 31, 2005 1:01 pm
Forum: Volume 100 (10000-10099)
Topic: 10036 - Divisibility
Replies: 37
Views: 10559

### 10036

I solved this problem using simply DP but i'm not satisified with my time( over 2 seconds). I would be vary happy if anybody would tell me some faster algorithm.
Wed Jan 12, 2005 6:33 pm
Forum: Volume 108 (10800-10899)
Topic: 10804 - Gopher Strategy
Replies: 39
Views: 23155
Don't worry about that, i don't know for what is it but if you write it in normal way, wou will get AC
Sat Jun 19, 2004 10:55 pm
Forum: Volume 4 (400-499)
Topic: 434 - Matty's Blocks
Replies: 13
Views: 3471

### Why I get WA in 434

This is my code, if anybody know what is wrong pleas tell me. var temp,prawo:array[0..8] of byte; przod:array[0..8,1..3] of byte; s,m,t,n,k,j,i:byte; f:text; begin assign(f,'dane.txt'); reset(f); readln(f,n); for j:=1 to n do begin for i:=0 to 8 do begin przod[i,1]:=0; przod[i,2]:=0; przod[i,3]:=0; ...