## 11550 - Demanding Dilemma

Moderator: Board moderators

### 11550 - Demanding Dilemma

pls give me some test cases.i m getting wa.
heres my code
Code: Select all

Last edited by rij on Tue Nov 04, 2008 11:48 am, edited 1 time in total.
rij
New poster

Posts: 5
Joined: Mon Nov 03, 2008 3:59 am
Location: BD

### Re: 11550 - Demanding Dilemma

I WA too...-_-!
but I can't understand your code on:if(arr[i][j]=='1'&& i!=j)count++;
why do you check if i!=j? I think it doesn't need...
zhouerjin
New poster

Posts: 5
Joined: Wed Oct 01, 2008 4:52 pm

### Re: 11550 - Demanding Dilemma

try this case
Input:
Code: Select all
`13 21 11 00 1`

My AC output:
Code: Select all
`Yes`

hope this helps..
mmonish
Experienced poster

Posts: 109
Joined: Sun Mar 11, 2007 2:55 pm
Location: SUST

### Re: 11550 - Demanding Dilemma

corrected but still wa
Code: Select all
`void call(int n,int m){      int count=0,fc=0;      for(int j=0;j<m;j++){         count=0;         for(int i=0;i<n;i++){            if(arr[i][j]=='1')count++;         }         if(count==2)            fc++;      }      if(fc==m)         cout<<"Yes"<<endl;      else cout<<"No"<<endl;      return;}`
rij
New poster

Posts: 5
Joined: Mon Nov 03, 2008 3:59 am
Location: BD

### Re: 11550 - Demanding Dilemma

You must also check if there are no two identical edges defined by the incidence matrix. If there are, you should return "No".
Vytenis
New poster

Posts: 7
Joined: Mon Aug 04, 2008 8:16 pm

### Re: 11550 - Demanding Dilemma

thanks got ac after a number of tries.
rij
New poster

Posts: 5
Joined: Mon Nov 03, 2008 3:59 am
Location: BD

### Re: 11550 - Demanding Dilemma

rij wrote:thanks got ac after a number of tries.

can you say more detail?
I still WA...
zhouerjin
New poster

Posts: 5
Joined: Wed Oct 01, 2008 4:52 pm

### Re: 11550 - Demanding Dilemma

The graph should be a simple indirected one.

Pay attention to the word 'simple'.
SerailHydra
New poster

Posts: 20
Joined: Mon Oct 20, 2008 6:26 am

### Re: 11550 - Demanding Dilemma

I still WA....I need help...
Code: Select all
`void prepare(){   scanf("%d%d",&n,&m);   for (int i=1;i<=n;i++)   for (int j=1;j<=n;j++)      flag[i][j]=false;   for (int i=1;i<=n;i++)   for (int j=1;j<=m;j++)      scanf("%d",&map[i][j]);}bool work(){   for (int i=1;i<=m;i++)   {      int u=-1,v=-1;      for (int j=1;j<=n;j++)      if (map[j][i])      {         if (u==-1) u=j;else          if (v!=-1) return false;else v=j;      }      if (u*v<0) return false;      if (flag[u][v]) return false;      flag[u][v]=flag[v][u]=true;   }   return true;}`
zhouerjin
New poster

Posts: 5
Joined: Wed Oct 01, 2008 4:52 pm

### Re: 11550 - Demanding Dilemma

To : zhouerjin
Change only one line & i hope that will make you AC.

Code: Select all
`if (u*v<0) return false;`

change to ->
Code: Select all
`if (u==-1||v==-1) return false;`

Because if u & v two are -1 then u*v>0
SHAKIL
shakil
Learning poster

Posts: 74
Joined: Sat Jul 15, 2006 6:28 am

### Re: 11550 - Demanding Dilemma

This is a very simple problem.
Just check if every column(edge) has exactly two vertex and no two columns(edges) has same vertexes(Because multiple edges are not allowed)
You can try this Cases
Input :
Code: Select all
`33 31 1 01 1 11 0 02 21 11 13 31 0 01 1 10 1 1`

Output :
Code: Select all
`NoNoNo`

In 1st case first column(edge) has three vertex which is not possible
In 2nd case 1st and 2nd edges have the same vertexes (1,2) and (1,2) so again No
In 3rd case same thing occurs like 2nd case.Here 2nd and 3rd edges have the same vertexes (2,3) and (2,3)
@li_kuet
New poster

Posts: 24
Joined: Fri May 25, 2012 6:22 pm

### Re: 11550 - Demanding Dilemma

input
Code: Select all
`14 31 1 11 0 00 1 00 0 0`
output No
brianfry713
Guru

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