OJ Board

jaracz

I gathered inputs from other posts and added mine: A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H:EG;C:AD. A C 3 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 1 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 6 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 7 A:B;B:A. B A 3 A:B;B:C;C:A. B...

jaracz

Read carefully entire topic, there's a critical input above for your algo, which let you know why your idea is wrong..

jaracz

My AC'ed program gives following output

Code: Select all

yes
no
yes
no
no
yes
no
yes
yes
no
yes
yes
yes
yes
no
no
no
no
no
no
no
no
no
yes
no
no
yes
yes
yes
yes
yes

I guess such an input

Code: Select all

5 ( 5 () 1 () ())
4 ( 2 (2 () 1()()) ())

isn't correct, it doesn't follow the input specification
Hope it helps

jaracz

thx for your explanation
i'll find out more and compare the results, cause problem isn't so hard, so it could be the best way to study;)

regards

jaracz

message to misof!! actually you don't need to use bellman-ford algorithm at first i got wa ( i used dijkstra then set used arcs as infinity and used dijkstra again) , then i read your advise and used dijkstra then set used arcs as infinity then negated arcs and finally used bellman-ford, i got AC bu...

jaracz

So maybe you make some mistake in taking input?
I mean are you testing your prog using file stream or you just type whole input using keybord
If yes try to read in from file
If it won't help then you must rethink your algo

Regards

jaracz

maybe try this: INPUT 7 too low 8 too high 9 right on 1 too high 7 too low 8 right on 5 too low 8 too high 7 too high 5 right on 10 right on 10 too low 1 too high 5 right on 4 too high 3 too high 5 right on 6 too low 7 too low 5 right on 4 too low 1 too low 6 too high 9 too high 5 right on 1 too low...

jaracz

yes indeed!

my output differ from your!
Try to rethink one before last test case

Code: Select all

9
too low
8
too low
7
too low
8
right on

the correct answer is : "Stan is dishonest"

Regards & hope it helps

jaracz

93 isn't prime

jaracz

Could anyone post here more test cases??!!

Thx in advance

jaracz

I passed sample in/out and these in this post, but still WA I need some critical input, or hint.. Here's my code if someone wants to check it #include <cstdio> #include <vector> #include <algorithm> using namespace std; vector <int> modify(vector <int> a) { vector <int> pom(a); for(int i = 0; i < a....

jaracz

I agree

jaracz

Actually, your suggestion gives TLE too there is 2kn operations to get the final sequence and than print them maybe you did it in better way?? I tried to speed up it several times but it must be k-permutaion, otherwise i get WA;( anyway here is my code #include <stdio.h> #include <string.h> int main...

jaracz

you're right:)
wasn't necessery to change string each time
thanks anyway
<peace>

jaracz

It can't be input like a + ++a or a+ --a ...and so on I mean it can't be same letter used a few times cause it was written Execute the statements generated in step 1, then those generated in step 3, and finally the one generated in step 2, in that order. so at first calculate expresisons like ++a an...

OJ Board

Search found 79 matches

Re: 168 - Theseus and the Minotaur TLE