Game of Two Stacks
Problem Statement :
Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified from the game if, at any point, his running sum becomes greater than some integer xgiven at the beginning of the game. Nick's final score is the total number of integers he has removed from the two stacks. Given A, B , and x for g games, find the maximum possible score Nick can achieve (i.e., the maximum number of integers he can remove without being disqualified) during each game and print it on a new line. Output Format For each of the g games, print an integer on a new line denoting the maximum possible score Nick can achieve without being disqualified.
Solution :
Solution in C :
In C ++ :
// author: gary
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define ALL(x) (x).begin(), x.end()
const int inf = 1e9;
const int maxn = 1e5 + 10;
ll a[maxn];
ll b[maxn];
int T, n, m, x;
int main() {
scanf("%d", &T);
while(T--) {
scanf("%d%d%d", &n, &m, &x);
for(int i = 1; i <= n; i++) scanf("%lld", a + i);
for(int i = 1; i <= m; i++) scanf("%lld", b + i);
for(int i = 1; i <= n; i++) a[i] += a[i-1];
for(int i = 1; i <= m; i++) b[i] += b[i-1];
int res = 0;
for(int i = 0, j = m; i <= n && a[i] <= x; i++) {
while(a[i] + b[j] > x && j >= 1)
j --;
res = max(res, i + j);
}
printf("%d\n", res);
}
return 0;
}
In Java :
import java.io.*;
import java.util.StringTokenizer;
public class Main {
private void solve() {
int t = rw.nextInt();
for (int t_id = 0; t_id < t; ++t_id) {
int n = rw.nextInt();
int m = rw.nextInt();
int x = rw.nextInt();
int[] a = new int[n];
int[] b = new int[m];
for (int i = 0; i < n; ++i)
a[i] = rw.nextInt();
for (int i = 0; i < m; ++i)
b[i] = rw.nextInt();
int sum = 0;
int c1 = 0;
for (; c1 < n; ) {
if (sum + a[c1] <= x) {
sum += a[c1];
++c1;
} else
break;
}
int c2 = 0;
for (; c2 < m; ) {
if (sum + b[c2] <= x) {
sum += b[c2];
++c2;
} else
break;
}
int ans = c1 + c2;
for (; c1 > 0; --c1) {
sum -= a[c1 - 1];
while (c2 < m) {
if (sum + b[c2] <= x) {
sum += b[c2];
++c2;
} else
break;
}
ans = Math.max(ans, c1 - 1 + c2);
}
rw.println(ans);
}
}
private RW rw;
private String FILE_NAME = "file";
public static void main(String[] args) {
new Main().run();
}
private void run() {
rw = new RW(FILE_NAME + ".in", FILE_NAME + ".out");
solve();
rw.close();
}
private class RW {
private StringTokenizer st;
private PrintWriter out;
private BufferedReader br;
private boolean eof;
RW(String inputFile, String outputFile) {
br = new BufferedReader(new InputStreamReader(System.in));
out = new PrintWriter(new OutputStreamWriter(System.out));
File f = new File(inputFile);
if (f.exists() && f.canRead()) {
try {
br = new BufferedReader(new FileReader(inputFile));
out = new PrintWriter(new FileWriter(outputFile));
} catch (IOException e) {
e.printStackTrace();
}
}
}
private String nextLine() {
String s = "";
try {
s = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return s;
}
private String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
eof = true;
return "-1";
}
}
return st.nextToken();
}
private long nextLong() {
return Long.parseLong(next());
}
private int nextInt() {
return Integer.parseInt(next());
}
private void println() {
out.println();
}
private void println(Object o) {
out.println(o);
}
private void print(Object o) {
out.print(o);
}
private void close() {
try {
br.close();
} catch (IOException e) {
e.printStackTrace();
}
out.close();
}
}
}
In C :
#include <stdio.h>
int main() {
long long int c, i, g, m, n, x, la, lb;
long long int a[100010], b[100010];
scanf("%lld", &g);
while (g--) {
la = lb = 0;
scanf("%lld%lld%lld", &n, &m, &x);
scanf("%lld", &a[1]);
for (i = 1; ++i <= n;) {
scanf("%lld", &a[i]);
a[i] += a[i - 1];
}
scanf("%lld", &b[1]);
for (i = 1; ++i <= m;) {
scanf("%lld", &b[i]);
b[i] += b[i - 1];
}
la = 1;
while (la <= n && a[la] <= x)
la++;
la--;
c = la;
lb = 1;
while (lb <= m && b[lb] <= x) {
if (la && b[lb] + a[la] > x)
la--;
else {
if (c < la + lb)
c = la + lb;
lb++;
}
}
printf("%lld\n", c);
}
return 0;
}
In Python3 :
#!/bin/python3
import sys
g = int(input().strip())
for a0 in range(g):
n,m,x = input().strip().split(' ')
n,m,x = [int(n),int(m),int(x)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
i = 0
while i < len(a) and x >= a[i]:
x -= a[i]
i += 1
ans = i
j = 0
for p in b:
j += 1
x -= p
while x < 0 and i > 0:
i -= 1
x += a[i]
if x >= 0: ans = max(ans, j + i)
print(ans)
View More Similar Problems
Tree: Level Order Traversal
Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F
View Solution →Binary Search Tree : Insertion
You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <
View Solution →Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →