Search found 18 matches

by ibroker
Sat Sep 08, 2007 2:44 pm
Forum: General
Topic: New system is coming!
Replies: 13
Views: 8219

I miss too. :(

It's very unconvenience. :(
by ibroker
Wed Aug 15, 2007 2:40 pm
Forum: Volume 112 (11200-11299)
Topic: 11252 - Take Me Home (To the Place I Belong)
Replies: 8
Views: 2677

//jah thanks. I got ACC using O(n) memory. :D but It is confuse why my O(n^2) memory dynamic got WA. :( #include <cstdio> #include <algorithm> using namespace std; #define ll long long int ll c; int n, m; ll mm[1010], pp[1010]; ll nn[1010], rr[1010]; ll data[1010][1010], track[1010][1010]; ll now_co...
by ibroker
Tue Aug 14, 2007 8:13 am
Forum: Volume 112 (11200-11299)
Topic: 11252 - Take Me Home (To the Place I Belong)
Replies: 8
Views: 2677

I use dynamic O(n^3) implementation.

And I also find a reduction to an O(n^2) solution.

But it is WA. :(

Anybody has some data cases?

My simple dynamic fomula is like this.

d[i, j] = d[i-1, k] + C (C is constant, and need calculating)
by ibroker
Sat Aug 11, 2007 1:56 pm
Forum: Volume 112 (11200-11299)
Topic: 11245 - Anti-Arithmetic-Sequence
Replies: 18
Views: 5867

Oh! I see !

I think that subsequence always continuous.

So I consider only A, A[i+1], A[i+2]... A[i+p-1](A[1]~A[n]),

not A, A[j], A[k] ... (i<j<k)

Thanks ! :D
by ibroker
Sat Aug 11, 2007 10:49 am
Forum: Volume 112 (11200-11299)
Topic: 11245 - Anti-Arithmetic-Sequence
Replies: 18
Views: 5867

I can't understand problem exactly.
Problem says, for p=3 the infinite sequence is 1,2,4,5,10,11,13,14...
Why is "1,2,4,5,7,8,10,11..." sequence not allowed?
I think that this sequence doesn't contain arithmetic sequence length p.
I need help. :(
by ibroker
Sat Aug 11, 2007 4:34 am
Forum: Volume 112 (11200-11299)
Topic: 11249 - Game
Replies: 32
Views: 13221

Thanks!! :D
by ibroker
Fri Aug 10, 2007 8:46 pm
Forum: Volume 112 (11200-11299)
Topic: 11249 - Game
Replies: 32
Views: 13221

Oops I have to modify my post I think (1 5) is loosing position. if I make one of the pile zero, another player must be winner. (because he can take up to all the stones from a pile) So he must make piles nonzero. Then he can take a stone.(k=1) So another player's starts (1 4). another player can ta...
by ibroker
Fri Aug 10, 2007 2:47 pm
Forum: Volume 112 (11200-11299)
Topic: 11249 - Game
Replies: 32
Views: 13221

Sample input is confuse.

start at (a b) : (2 6)
take 1 stone both pile.(because at most k means 0~k)
(2 6) -> (1 5)

I think (1 5) must be winning point

Did I got misunderstand problem?
by ibroker
Wed Jan 10, 2007 7:16 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19763

Re: 11149 TLE..?

Thanks ! I got Accepted
by ibroker
Mon Jan 08, 2007 5:33 am
Forum: Volume 111 (11100-11199)
Topic: 11149 - Power of Matrix
Replies: 42
Views: 19763

11149 Power of Matrix

I use operator overloading calculating matrix.
And I divide equation like this.
A^1+A^2+...A^(2k) = A+A^2+...A^k + A^k(A+A^2..._A^k)
It throws me TLE.
What can I do to cut running time?

Code: Select all


[/code]
by ibroker
Mon Jul 03, 2006 4:25 am
Forum: Volume 103 (10300-10399)
Topic: 10339 - Watching Watches
Replies: 10
Views: 3088

10339 Watcing Watches

I think my solution correct, but I got WA. d = 43200.0/fabs((double)(a-b)); d = d*(86400-a)/(86400.); hour = (d - (int)d)*24.; minute = (hour - (int)hour) * 60; hour = (int)hour; a and b are input integer. d is the real day which watches will be synchronized. watch goes (86400-a)/(86400) days slower...
by ibroker
Fri May 12, 2006 9:46 am
Forum: Volume 108 (10800-10899)
Topic: 10816 - Travel in Desert
Replies: 49
Views: 22347

My algorithm

My method similar to you.
I also sort temperature and connect.
this means, If start and end point are same group(exist path),
then I try dijkstra algorithm.
I also connect every same temperature.
but I don't know why I got WA. plz help~~
by ibroker
Mon May 01, 2006 5:11 am
Forum: Volume 108 (10800-10899)
Topic: 10816 - Travel in Desert
Replies: 49
Views: 22347

10816 I don't know my error

I use union-set finding temperature and dijkstra finding length. I use these algorithms many times at other problems. But I only get WA in this problem. I already correct answer all of input at board What's the matter? #include <cstdio> #include <vector> #include <algorithm> #define M 150 using name...
by ibroker
Fri Feb 24, 2006 5:36 am
Forum: Volume 1 (100-199)
Topic: 183 - Bit Maps
Replies: 15
Views: 2867

183 WA.....

What is wrong! any have some tricky data? #include <string.h> #include <stdio.h> #define M 500000 char c; int yy, xx; char temp[M]; int str; char path[M]; int dep; char data[300][300]; int p; void make(int, int, int, int); void filled(int, int, int, int); int main() { char tmp[300]; int i, j; gets(t...
by ibroker
Wed Feb 15, 2006 5:38 pm
Forum: Volume 102 (10200-10299)
Topic: 10272 - DDR King
Replies: 1
Views: 2687

10272 - DDR King

plz give me some data set. #include <stdio.h> #define M 510 int even1[M], even2[M]; int odd1[M], odd2[M]; int first[M], last[M]; int main() { int t1, t2; int i, j; even1[1]=0; even2[1]=0; odd1[1]=1; odd2[1]=3; first[1]=1; last[1]=3; even1[2]=2; even2[2]=6; odd1[2]=1; odd2[2]=3; first[2]=2; last[2]=6...

Go to advanced search