11336 - DRM

All about problems in Volume 113. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
mohsincsedu
Learning poster
Posts: 63
Joined: Tue Sep 20, 2005 12:31 am
Location: Dhaka
Contact:

11336 - DRM

Post by mohsincsedu »

Code: Select all

//Remove After ACC... :)
My Program is failed for Input:

Code: Select all

graph1
a b
a c
* * *
graph2
a c
a d
d b
* * *
graph1
a b
a c
c d
* * *
graph2
a c
c d
a d
d b
* * *
END
Output should be:

Code: Select all

YES: graph2 is a more detailed version of graph1
NO: graph2 is not a more detailed version of graph1

Misunderstood the problem description.....

Thanks to Jan(GURU)...
Amra korbo joy akhdin............................

vahid sanei
Learning poster
Posts: 84
Joined: Fri Jan 09, 2009 4:37 pm
Location: IRAN

Re: 11336 - D: DRM

Post by vahid sanei »

WHY i get Wrong answer :( , please give me some critical I/O
here is my code :

Code: Select all

Accepted
thanks in advance
Last edited by vahid sanei on Mon Dec 28, 2009 9:11 pm, edited 2 times in total.
Impossible says I`m possible

vahid sanei
Learning poster
Posts: 84
Joined: Fri Jan 09, 2009 4:37 pm
Location: IRAN

Re: 11336 - D: DRM

Post by vahid sanei »

Accepted
Last edited by vahid sanei on Mon Dec 28, 2009 9:12 pm, edited 1 time in total.
Impossible says I`m possible

vahid sanei
Learning poster
Posts: 84
Joined: Fri Jan 09, 2009 4:37 pm
Location: IRAN

Re: 11336 - D: DRM

Post by vahid sanei »

please help me , i `m getting wa still :(
[Edit] Accepted
Last edited by vahid sanei on Mon Dec 28, 2009 9:12 pm, edited 1 time in total.
Impossible says I`m possible

Scarecrow
Learning poster
Posts: 69
Joined: Wed Oct 19, 2011 9:06 pm

Re: 11336 - D: DRM

Post by Scarecrow »

plz can anyone explain me the problem? i cant understand the problem clearly. plz sm1 extend a helping hand :)
Do or do not. There is no try.

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

Re: 11336 - D: DRM

Post by brianfry713 »

You are testing if the second map contains all the streets in the first map. Check that there is a path between each pair of cities in the first map on the second map, and those are either the same pair of cities or only stop on cities not contained in the first map.
Check input and AC output for thousands of problems on uDebug!

Scarecrow
Learning poster
Posts: 69
Joined: Wed Oct 19, 2011 9:06 pm

Re: 11336 - D: DRM

Post by Scarecrow »

thnx :D understood and got AC :)
Do or do not. There is no try.

Post Reply

Return to “Volume 113 (11300-11399)”