Codechef-Solutions/Chef and Work.cpp at main · abhinav8925/Codechef-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102

/*
  ***** !!!!! JAI SHREE KRISHNA !!!!! *****

  Date - 7th May 2023
  Code by - Abhinav Anand

  Problem link -> https://www.codechef.com/problems/CHEFNWRK

*/

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;
int N=1000001;
vector<int> arr(N,true);
vector<int> prime_num;
vector<int> prime_fact(N,-1);

void sieve()
{

    arr[0]=arr[1]=0;
    for(int i=2;i<=sqrt(N);i++)
    {
        if(arr[i]==1)
        {
            for(int j=i*i;j<=N;j+=i)
                arr[j]=0;
        }
    }

    for(int i=2;i<=N;i++)
    {
        if(arr[i])
            prime_num.push_back(i);
    }
}


bool isprime(int n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}


void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n],sum=0,cnt=0;


    for(int i=0;i<n;i++)
        cin>>a[i];

    for(int i=0;i<n;)
    {
        if(a[i]>k)
        {
            cout << "-1" << endl;
            return;
        }
        else
        {
            sum+=a[i];
            if(sum>k)
            {
                cnt++;
                sum=0;
            }
            else
                i++;
        }
    }
    if(cnt==0)
        cout << 1 << endl;
    else
        cout << cnt+1 << endl;

}

int main() {

	//sieve_prime_factor();
	// sieve();
	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}