OJ Board

I miss too.

It's very unconvenience.

//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 ...

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)

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 !

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.

Thanks!!

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 ...

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?

Thanks ! I got Accepted

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]

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 ...

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~~

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 ...

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 ...

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 ...