OJ Board

Hi guys. I finally solved it after 11 tries! No need for anything fancy. Use long long and make sure EVERYTHING is done in long long. Don't use any double or it'll fail (I think there are test cases that involve vectors that are very very small degrees apart, thereby causing problems with floating ...

This problem is lying. I had my input array at 100 before and it gave me RTE. I increased it to 1000 and it worked. Stupid.

Don't forget that if after the first maximum point you encounter a monotonic sequence, the most extreme point of the monotonic sequence will replace the current last element of the subsequence that has been observed so far.

Hi guys,
This is my code. I've tested it with everything and it still fails. Is it possible for you guys to help? I'm very frustrated.


#include <cassert>
#include <cstdio>
#include <cmath>

using namespace std;

long long N, yy, ii, sq, K, countee, prev;

int main(void)
{
scanf("%lld\n", &N ...

Remember to set precision to 0.001 if using ternary search! Caused me lots of headaches.

Here are some killer test cases. The .in file is the input file and the .out file is for you to compare against. Good luck!

This question is quite crazy. I've tried many algorithms from Möller to Held to even Guigue but they all took more than 2 seconds and TLEd. I nearly gave up until I tried an algorithm from Hao Shen, Pheng Ann Heng and Zesheng Tang which was the only one which took less than a second to complete ...

I modified Bellman-Ford but it keeps WA-ing even though I've tried it with many different test cases, including the ones in this forum. Please help!

// removed after AC

Finally got AC! I found something weird though. From all the proofs I've seen, they do not state that the order of the edges ...

Thanks man. I got an AC. Turns out my mistake was to count the score in the DFS. Even with a flag to supposedly prevent the counting of the score more than once for a word, the judge's test cases still managed to make it fail.

This is my code. It seems so correct, but it keeps getting WA no matter the fact that I've tried many test cases and checked with different sites. Please help.

My code below works perfectly fine with a file with inputs from 5c to $300 instantaneously but the online judge keeps complaining of TLE. Does anybody know why?
import java.util.Arrays;
import java.util.Scanner;

class Main
{
private static long values[] = new long[6001];
private final static int ...

Haha I will keep posting. And thanks!

Hey!!! Thanks so much for your help! I followed exactly what you said and true enough I got AC for it. And my code is amazingly fast. I tried it on my comp with an input file containing the numbers 0 to 1000 and it took only about 6 seconds. Anyways, my prog took up 2942 KB of memory. Haha this has ...

Umm there's a probem with that.My code is now 1.1MB! And the judge has a limit of 40KB on source code. My code works perfectly fast though. Haha.

Yeah I was thinking of precalculation too but, if 500! has 1000 digits, precalculation will take up too much memory!