This is my rather unconventional solution using sorted contest array(by start time or end time) and wormhole array. The solution yields O(NlogN) since it sorts the contest array twice by its start-time order and end-time order.

// ZCO15002

What's wrong with this?

#include <vector>
#include <cstdio>
#include <algorithm>

#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
using namespace std;

#include <iostream>
using namespace std;
 
void leadGameWinner(int arr1[], int arr2[], int s) {
  int score1 = 0, score2 = 0, winner = -1;

#include<iostream>
 
using namespace std;
 
 

Space Complexity: O(1)

Time Complexity: O(N)

Language: Python 3

#LEADGAME

i am trying to use kadane's algorithm on each segment of BIT but getting WA, can someone help?

where do i compile my code?

General

Please is there a python version of this courses, I'm still a beginner in python but I believe everything here is in c.

Or is it supposed to be general?

w,h = map(int,input().split())
l = [int(_) for _ in input().split()]
o = [int(_) for _ in input().split()]
pos,hook = 0,0
for i in range(len(o)-1):

Here is my java code for the given problem.

import java.util.*;
class ZCO14001
{

//So my submission keeps getting wrong answers and I can't seem to figure out where I went wrong, really need someone's help
 
 
#include <iostream>
int picked = 0;

I would love to see a stack based dfs solution to this problem? If anyone solved by that method please share.

C++ (AC) Solution:

#include <iostream>
#include <vector>
#include <queue>

I'am Getting WA....Any Corner Case??

My code Ubuntu Pastebin