OJ Board

jan_holmes

I was using the same algorithm (union-find) in C++ and it was run under 1.6 secs. Anyway, in what language do you write your code ?

jan_holmes

I wonder what is the answer for the following test case :

Code: Select all

Is it 5 ?

EDIT :

I got it now. It must be 6.

jan_holmes

I was using union-find algorithm at the contest. But I got several WA's. I think my program failed in handling reversible connection (i.e. 1->2 and 2->1).

jan_holmes

Try this :

Code: Select all

4
a b
a c aku
a c ku
c b kc
c b bada

It should return 5 instead of "impossivel".

jan_holmes

Hi... It's me the one who have 3 accounts. :oops: Actually, I didn't do it purposely. At one time, I had forgotten my ID accounts (2 times). So I had to create the new one. But then, I found my ID account right after I created the third one. But since UVA is migrated to the new server, I'm just usin...

jan_holmes

Hi, I'm just wondering why there is no forum in the new site ? Why don't the forum here is moved to new site ? Thx

jan_holmes

Runtime Error is happened not because of the unacknowledgement syntaxes in your code... It is happened because of the error on your programming logic source code, like for example you defined an array size of 10, but suddenly you try to access arr[10].

jan_holmes

using ">>C++ 4.1.2 - GNU C++ Compiler with options: -lm -lcrypt -O2 -pipe -DONLINE_JUDGE" is better because most functions in C will be available in C++.

jan_holmes

What's wrong with my code : #include <iostream> #include <bitset> #include <algorithm> #include <cstdio> #include <cstdlib> #include <string> #include <cstring> #include <vector> #include <map> #include <queue> #include <deque> #include <stack> #include <cctype> #include <set> #include <cmath> #incl...

jan_holmes

EDIT : ACed... I was just assumed that the stack is not more than 1000.

jan_holmes

Try this test case :

Code: Select all

1
5 8 9 7 6 10

The answer should be 3.

jan_holmes

Got TLE with DP (Top Down). How did you guys solve this problem without getting TLE ?

jan_holmes

This might help :

Code: Select all

int main () {
    string s;
    while (getline(cin,s)) {
          if (s.length() == 0) break;
          int n = atoi(s.c_str());
          printf("%d\n",n);
    }
    return 0;
}

jan_holmes

Can anybody tell me what is the limit of n ? And I think it is a dp problem, am I right ?

EDIT : ACC...

The one for sure is that n < 15000. And yes, it is kind of a dp problem ( at least I solved it that way).

jan_holmes

Can you give me another sample IOs ? I got WA with this code : #include <iostream> #include <bitset> #include <algorithm> #include <cstdio> #include <cstdlib> #include <string> #include <cstring> #include <vector> #include <map> #include <queue> #include <deque> #include <stack> #include <cctype> #i...

OJ Board

Search found 136 matches

Re: 11503-Virtual Friends

Re: 11504 - Dominos

Re: 11504 - Dominos

Re: 11492 - Babel

Re: Multiple users

No Forum in new UVA site ?

11240 - Antimonotonicity