OJ Board

Donotalo

This is weird!

The input of the problem statement states that N(2 < N < 1000001), M(0 < M < 1001) and K(1< K < 101). I found that my program outputs "sequence nai" for K == 1. I fixed that so the output become 1 for K == 1. And got accepted.

Is in the judge data there was an input where K == 1?

Donotalo

Is there any tricky input I can check?

Donotalo

Hi, I'm getting WA in this problem. I can't figure my mistake out. Can anyone check my output to the following input with an AC code's output? Thanks in advance. INPUT: 15 20 12 4 20 12 8 3 5 3 1000000 10 12 3 1 2 1000000 1000 100 50 50 50 29 17 11 29 17 33 14 6 3 14365 66 3 353540 233 99 222222 222...

Donotalo

I tried the following:
Input:

Code: Select all

9
10 5 4 1
1000 2 1 42
100 2 4 66
101 60 70 51
100 2 3 98
10000000 1 1 10000000
35 3 10 35
35 3 10 34
29 13 5 29

Output:

Code: Select all

0
41
uh-oh!
uh-oh!
34
9999999
6
15
uh-oh!

Seems correct to me. Are they wrong? Can anyone give me tricky I/O? Please help.

Thanks.

Donotalo

I tried with 10 colors but got WA. Here is my code: #include <iostream> #include <string> #include <sstream> using namespace std; #define MAX 10004 #define NCOLOR 10 unsigned long INF = (1 << 29); int degree[MAX], graph[MAX][MAX], cost[MAX][NCOLOR]; int main() { register int m, p; int n, i, j, k, co...

Donotalo

Actually I don't.

OK. I think this problem is too difficult for me to try.

Donotalo

DP! Oh! This is the only thing I always stuck at. DP problems are interesting. That is why I start thinking about the solution and stuck. Actually, I'm a novice in DP programming. Can you please give me some more hints so that I can come up with a recursion?

Donotalo

Can anyone tell me in details how to solve this problem? Thanks in advance.

Donotalo

checked all i/o-s in this board but could not get the reason i'm getting wa in this problem. can anyone please check my code?

thanks in advance.

Code: Select all

//Problem 10800
#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main()
{
        (removed)
	return 0;
}

Donotalo

I tried Floyd-Warshall but getting WA. Can anyone tell me how to solve this problem?

Thanks.

Donotalo

my output to the above input is as follows: TERM 1000000 IS 1009/406 TERM 1234567 IS 240/1332 TERM 2897534 IS 495/1913 TERM 3897346 IS 1110/1683 TERM 4482323 IS 1802/1193 TERM 5809231 IS 3115/295 TERM 6898729 IS 3688/27 TERM 7829873 IS 1031/2927 TERM 8298733 IS 2032/2043 TERM 9908727 IS 801/3652 TER...

Donotalo

yes, i think so. output 2 should be correct. but after i got PE in output 2, i tried output 1 and also got PE. that's why i asked for help here, and wondering what's my mistake!

Donotalo

for the following input:

Code: Select all

both of the following outputs result PE:

Output 1

Code: Select all

S-Tree #1:
0011

S-Tree #2:
0011

Output 2

Code: Select all

S-Tree #1:
0011

S-Tree #2:
0011

why? please give suggestions on how to fix it!

Donotalo

i tried every sample input in previous posts and ended up with WA, though for those inputs my program correctly generates the output.

i assumed that if the intersection (1, 1) or (w, n) is blocked, the answer is 0. is there anything wrong? can anyone give me some critical sample input and output?

Donotalo

for the following configuration: 1 1 0 0 [4] 1 (4 is the current direction) 1 1 0 why the next move is 3 not 6? similarly, 1 1 1 1 [3] 1 0 1 0 why the next move is 6 not 4? please help me to understand! :( (these examples are taken from Jan's sample input 1 and 3, respectively.)

OJ Board

Search found 56 matches

Re: 11536 - Smallest Sub-Array

Re: 11536 - Smallest Sub-Array

11536 - Smallest Sub-Array

11280 - Flying to Fredericton

712 - S-Trees