WA in stpar

[LordCasius]

Hi, im having trouble with this problem, im following the logic the problem says but im still getting WA. Somebody can tell me why of this? tnx

A.C

P.D. Sorry for my bad english, im a Spanish-Talker

[leppyr64]

Why did you post this again? Did you try the test case that was in the other topic?

[LordCasius]

i though i was doing something wrong posting my problem in another's problem , well, and you was rigth, i have understand than if a van go to the street , he cannot go back(or pop the pile) thanks for your help

[ksidd]

hi i am getting right anwer for all the given car configuration i tried around 60 test cases all the time i am getting correct answer but still it is giving wrong answer
please help
my code is:

#include<stdio.h>
int main(void)
{
	for(;;){
	int n,a[2000],l=0,b[2000],c[2000],d[2000],i,j,k,count;
	scanf("%d",&n);
	if(n==0){break;}
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		b[i]=0;c[i]=0;
	}
	j=1;count=0;k=n;
	for(i=0;i<n;i++)	
	{
		if(k==0)
		k=1;
		if(a[i]==j||c[k]==j)
		{
			b[count]=j;
			if(a[i]==j){a[i]=0;}	
			if(c[k]==j){k++;}
			count++;j++;
		}	
		else
		{	k--;
			c[k]=a[i];	
			a[i]=0;
		}	
	}	
	for(i=0;i<n;i++)
	{
		d[i]=c[i]+b[i];
		if(d[i]!=i+1 && d[i]!=0 &&  d[i]!=i)
		l++;	
	}
	if(l>0)
	{
		printf("no\n");
	}
	else
	printf("yes\n");
	}
return 0;
}

[leppyr64]

Please use code tags. Please don't multi-post.

Please test all test cases with n=4

[ksidd]

Please use code tags. Please don't multi-post.

Please test all test cases with n=4

[quote="ksidd"] before putting these problem i tested all the 24 possible cases with n=4

[leppyr64]

Then your understanding of the problem is incorrect. Read the prolem statement.

[ksidd]

sir,
i read the problem correctly
and then i coded it i also cross checked all the output with my friend on the same problem who got AC

[leppyr64]

Then you have not tested all 24 test cases with n = 4.

[rajnishkr123]

i have tried all the cases . can someone which case i am missing??

:
#include<vector>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<stack>
using namespace std;
int main() {
    int n;
    cin>>n;
    while(n){
             vector<int> road;
             vector<int> stk;
             int a[n];
             stk.clear();
             road.clear();
              int count=0,count1=0,k=1,e=1;
              for(int i=0;i<n;i++)
              cin>>a[i];
             if(a[0]==1)
                       road.push_back(a[0]);
              else
                      { stk.push_back(a[0]);
                        count=-1;
                        }
             for(int i=1;i<n;i++)
             {
                     if(a[i]==count+2)
                         { road.push_back(a[i]);
                          count++;
                          }
                     else  
                         {
                          if(stk.empty())
                              {stk.push_back(a[i]) ;
                                e=0;
                                }
                          while(stk[count1]==count+2)
                           {  road.push_back(stk[count1]);
                              count++;
                              stk.pop_back();
                              count1--;
                           }
                           if(a[i]>stk[count1])
                          { cout<<"no\n";
                            k=0 ;
                            break;
                          }
                              if(e)
                              { stk.push_back(a[i]) ;
                              count1++;
                              }
                              e=1;
                    }
             }
             if(k)
             cout<<"yes\n";
             cin>>n;
             }
             return 0;
             }

thanxs..

[rajnishkr123]

i have tried all the cases . can someone help which case i am missing??

:
#include<vector>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<stack>
using namespace std;
int main() {
    int n;
    cin>>n;
    while(n){
             vector<int> road;
             vector<int> stk;
             int a[n];
             stk.clear();
             road.clear();
              int count=0,count1=0,k=1,e=1;
              for(int i=0;i<n;i++)
              cin>>a[i];
             if(a[0]==1)
                       road.push_back(a[0]);
              else
                      { stk.push_back(a[0]);
                        count=-1;
                        }
             for(int i=1;i<n;i++)
             {
                     if(a[i]==count+2)
                         { road.push_back(a[i]);
                          count++;
                          }
                     else  
                         {
                          if(stk.empty())
                              {stk.push_back(a[i]) ;
                                e=0;
                                }
                          while(stk[count1]==count+2)
                           {  road.push_back(stk[count1]);
                              count++;
                              stk.pop_back();
                              count1--;
                           }
                           if(a[i]>stk[count1])
                          { cout<<"no\n";
                            k=0 ;
                            break;
                          }
                              if(e)
                              { stk.push_back(a[i]) ;
                              count1++;
                              }
                              e=1;
                    }
             }
             if(k)
             cout<<"yes\n";
             cin>>n;
             }
             return 0;
             }

thanxs..