1671B - Consecutive Points Segment - CodeForces Solution

brute force math

Please click on ads to support us..

Python Code: 

def sol():
    n=int(input())

    for i in range(n):
        m=int(input())
        l1=[]
        l=list(map(int,input().split(" ")))
        if m==1 or m==0:
            print("YES")
            continue
        g4=0
        g3=0
        g2=0
        for j in range(0,m-1):
            if l[j+1]-l[j]==3:
                g3+=1
                continue
            elif l[j+1]-l[j]==2:
                g2+=1
                continue
            elif l[j+1]-l[j]>=4:
                g4+=1

        if (g4>0):
            print("NO")
        elif (g3<=1 and g2==0):
            print("YES")
        elif(g3==0 and g2<=2):
            print("YES")
        else:
            print("NO")
            
        



sol()

C++ Code: 

#include <bits/stdc++.h>
#define int long long int

#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL)

#define endl "\n"

using namespace std;

void solve(){
    int n;
    cin>>n;
    vector<int>v(n);

    bool l=true;
    bool r=true;


    for(auto &i : v)cin>>i;
      

    for(int i=0;i<n-1;i++){
      if(l)v[i]++;
      else l=true;

      if(v[i+1]-v[i]>1){v[i+1]--;l=false;}
      else if(v[i+1]-v[i]==1){l=false;}


    }

    if(l==true and v[n-1]-v[n-2]==0)v[n-1]++;




    // for(auto i : v){
    //   cout<<i<<" ";
    // }
    // cout<<endl;
    for(int i=0;i<n-1;i++){
      if(v[i+1]-v[i]>=2){
        cout<<"NO"<<endl;return;
      }
    }
cout<<"YES"<<endl;

    
  }
  



signed main()
{
    fastio;
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST