1055A - Metro - CodeForces Solution

graphs *900

Please click on ads to support us..

Python Code: 

n, m = map(int, input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
def func(m, n):
    for j in range(m, n):
        if a[j] == 1 and b[j] == 1:
            return "YES"
    return "NO"

if a[0] == 1:
    if a[m - 1] == 1:
        print("YES")
    else:
        if b[m - 1] == 1:
            print(func(m, n))
        else:
            print("NO")
else:
    print("NO")

C++ Code: 

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

  using namespace std;

  int main()
  {
      ios::sync_with_stdio(0);
      cout.tie(0);
      cin.tie(0);

      int n, x; cin >> n >> x;
      int track1[n];
      int track2[n];
      string result = "NO";
      for(int i = 0; i < n; i++)
          cin >> track1[i];
      for(int i = 0; i < n; i++)
          cin >> track2[i];
      if(track1[0] == 1)
      {
          if(track1[x-1] == 1)
            result = "YES";
          else if(track2[x-1] == 1)
          {
              for(int i = x; i < n; i++)
              {
                  if(track1[i] == 1 && track2[i] == 1)
                  {
                    result = "YES";
                    break;
                  }
              }
          }
      }
      cout << result << endl;

      return 0;
  }


Comments

Submit
0 Comments
More Questions

145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians