Polygonal Chain

input/code.cpp: In function 'void go(int)':
input/code.cpp:56:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for(int i=1;i<n;i++)cout<<outp[i]<<" ";cout<<endl;
         ^~~
input/code.cpp:56:48: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
         for(int i=1;i<n;i++)cout<<outp[i]<<" ";cout<<endl;
                                                ^~~~

#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+5;

int n;

int outp[nmax];

int inp[nmax];

char dir[nmax];

pair<int,int> points[nmax][2];

bool in(int p,int q,int val)
{
    if(p>q)swap(p,q);

    return p<=val&&val<=q;
}

bool meet(int p,int q,int u,int v)
{
    if(p>q)swap(p,q);
    if(u>v)swap(u,v);

    return max(p,u)<=min(q,v);
}
void go(int pos)
{
    points[pos][1]=points[pos][0];

    if(pos%2)points[pos][1].first+=inp[pos];
    else points[pos][1].first-=inp[pos];

    /*test -
           |
    */
    for(int j=1;j+1<pos;j++)
    {
        if(in(points[pos][0].first,points[pos][1].first,points[j][1].first)&&in(points[j][1].second,points[j+1][0].second,points[pos][0].second))return;
    }

    /*
    test - -
    */
    for(int j=1;j<pos;j++)
    {
        if(points[pos][0].second==points[j][0].second&&meet(points[pos][0].first,points[pos][1].first,points[j][0].first,points[j][1].first))return;
    }

    if(pos==n)
    {
        cout<<"YES\n";
        for(int i=1;i<n;i++)cout<<outp[i]<<" ";cout<<endl;

        exit(0);
    }

    for(outp[pos]=1;outp[pos]<=(1<<11);outp[pos]=outp[pos]<<1)
    {
        points[pos+1][0]=points[pos][1];
        if(dir[pos]=='U')points[pos+1][0].second+=outp[pos];
        else points[pos+1][0].second-=outp[pos];

        /*
        test |
             -
        */
        for(int i=1;i<pos;i++)
        {
            //meet p[i][0] - p[i][1] with p[j][1]-p[j+1][0]
            if(in(points[pos][1].second,points[pos+1][0].second,points[i][1].second)&&in(points[i][1].first,points[i][0].first,points[pos+1][0].first))return;
        }
        /*
        test |
             |
        */
        for(int j=1;j<pos;j++)
        {
            if(points[pos][0].first==points[j][0].first&&meet(points[pos+1][0].second,points[pos][1].second,points[j+1][0].second,points[j][1].second))return;
        }

        go(pos+1);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();

    cin>>n;
    for(int i=1;i<=n;i++)cin>>inp[i];

    for(int i=1;i<n;i++)cin>>dir[i];

    go(1);

    cout<<"NO\n";

    return 0;
}

Test 1

Group: 1, 2, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 4, 5

Verdict: ACCEPTED

Test 5

Group: 1, 2, 4, 5

Verdict: ACCEPTED

Test 6

Group: 2, 4, 5

Verdict: ACCEPTED

Test 7

Group: 2, 4, 5

Verdict: ACCEPTED

Test 8

Group: 2, 4, 5

Verdict: WRONG ANSWER

Test 9

Group: 2, 4, 5

Verdict: ACCEPTED

Test 10

Group: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 4, 5

Verdict: WRONG ANSWER

Test 12

Group: 5

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2, 4, 5

Verdict: WRONG ANSWER

Test 16

Group: 4, 5

Verdict: ACCEPTED

Test 17

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 1, 2, 4, 5

Verdict: ACCEPTED

Test 20

Group: 2, 4, 5

Verdict: ACCEPTED

Test 21

Group: 2, 4, 5

Verdict: ACCEPTED

Test 22

Group: 2, 4, 5

Verdict: ACCEPTED

Test 23

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2, 4, 5

Verdict: ACCEPTED