solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
from __future__ import division, print_function
def main():
from sys import stdin
from math import ceil
from bisect import bisect_left as bl
input = stdin.readline
# def greater(num, arr):
# ind = bl(arr, num)
# return arr[ind]
for test in range(int(input())):
n, m = map(int, input().strip().split())
lst = list(map(int, input().strip().split()))
x = list(map(int, input().strip().split()))
dct = {}
s = 0
ans = [-1] * m
temp = 0
for i in range(n):
s += lst[i]
temp = max(temp, s)
try:
dct[temp]
except KeyError:
dct.update({s: i})
sum_lst = list(dct.keys())
# print(s, dct, sum_lst)
s_max = sum_lst[-1]
if s_max > 0:
for i in range(m):
if x[i] <= s_max:
num = bl(sum_lst, x[i])
ans[i] = dct[sum_lst[num]]
else:
if s > 0:
store = ceil((x[i] - s_max) / s)
check = x[i] - store * s
num = bl(sum_lst, check)
ans[i] = dct[sum_lst[num]] + store * n
# print(store, check, ind)
print(*ans)
######## Python 2 and 3 footer by Pajenegod and c1729
# Note because cf runs old PyPy3 version which doesn't have the sped up
# unicode strings, PyPy3 strings will many times be slower than pypy2.
# There is a way to get around this by using binary strings in PyPy3
# but its syntax is different which makes it kind of a mess to use.
# So on cf, use PyPy2 for best string performance.
py2 = round(0.5)
if py2:
from future_builtins import ascii, filter, hex, map, oct, zip
range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192
class FastIO(BytesIO):
newlines = 0
def __init__(self, file):
self._file = file
self._fd = file.fileno()
self.writable = "x" in file.mode or "w" in file.mode
self.write = super(FastIO, self).write if self.writable else None
def _fill(self):
s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
return s
def read(self):
while self._fill(): pass
return super(FastIO, self).read()
def readline(self):
while self.newlines == 0:
s = self._fill();
self.newlines = s.count(b"\n") + (not s)
self.newlines -= 1
return super(FastIO, self).readline()
def flush(self):
if self.writable:
os.write(self._fd, self.getvalue())
self.truncate(0), self.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
if py2:
self.write = self.buffer.write
self.read = self.buffer.read
self.readline = self.buffer.readline
else:
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# Cout implemented in Python
import sys
class ostream:
def __lshift__(self, a):
sys.stdout.write(str(a))
return self
cout = ostream()
endl = '\n'
# Read all remaining integers in stdin, type is given by optional argument, this is fast
def readnumbers(zero=0):
conv = ord if py2 else lambda x: x
A = [];
numb = zero;
sign = 1;
i = 0;
s = sys.stdin.buffer.read()
try:
while True:
if s[i] >= b'0'[0]:
numb = 10 * numb + conv(s[i]) - 48
elif s[i] == b'-'[0]:
sign = -1
elif s[i] != b'\r'[0]:
A.append(sign * numb)
numb = zero;
sign = 1
i += 1
except:
pass
if s and s[-1] >= b'0'[0]:
A.append(sign * numb)
return A
if __name__ == "__main__":
main()
| 13 |
PYTHON3
|
import sys
from bisect import bisect_left
input = sys.stdin.readline
def solve():
n, m = map(int,input().split())
a = list(map(int,input().split()))
p = [0]*(n+1)
M = [0]*(n+1)
for i in range(n):
p[i+1] = p[i] + a[i]
M[i+1] = max(M[i], p[i+1])
s = p[-1]
ans = []
#print(p,M)
for x in map(int,input().split()):
r = 0
if s > 0:
t = max((x-M[-1]+s-1)//s,0)
r += t*n
x -= t*s
if x > M[-1]:
ans.append('-1')
else:
pos = bisect_left(M,x)
ans.append(str(r + pos - 1))
print(' '.join(ans))
for i in range(int(input())):
solve()
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
using ll = long long;
char df = '\n';
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
ll A[n], ar[n], mx[n];
for (int i = 0; i < n; i++) cin >> A[i];
ar[0] = A[0];
for (int i = 1; i < n; i++) ar[i] = A[i]+ar[i-1];
mx[0] = ar[0];
for (int i = 1; i < n; i++) mx[i] = max(mx[i-1], ar[i]);
while (m--) {
ll x;
cin >> x;
if (x > mx[n-1]) {
if (ar[n-1] <= 0) {
cout << -1 << " ";
} else {
ll y = (x-mx[n-1])/ar[n-1];
if ((x-mx[n-1])%ar[n-1]) y++;
auto it = lower_bound(mx, mx+n, x-y*ar[n-1]);
cout << it-mx+y*n << " ";
}
} else {
auto it = lower_bound(mx, mx+n, x);
cout << it-mx << " ";
}
}
cout << df;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
cin >> tt;
while (tt--) solve();
return 0;
}
| 13 |
CPP
|
import bisect
def main():
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
a = list(map(int, input().split()))
x = list(map(int, input().split()))
p = []
pts = []; M = 0; d = {}; suma = 0
for i in range(n):
suma += a[i]
if suma > M:
M = suma
pts.append(M)
d[M] = i
for i in range(m):
xi = x[i]
if not pts:
p.append(-1); continue
if suma <= 0 or xi <= pts[-1]:
if xi > pts[-1]:
p.append(-1); continue
else:
idx = bisect.bisect_left(pts, xi)
p.append(d[pts[idx]])
else:
laps = (xi - pts[-1]) // suma
if (xi - pts[-1]) % suma:
laps += 1
xi -= laps * suma
idx = bisect.bisect_left(pts, xi)
p.append(d[pts[idx]] + n * laps)
print(*p)
main()
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10,M=1e9+7,OO=0x3f3f3f3f;
int n;
int arr[N];
ll pre[N];
ll seg[4*N];
void build(int si=0,int ss=0,int se=n-1){
if(ss==se){
seg[si]=pre[ss];
return;
}
int md=ss+(se-ss)/2,lf=si*2+1,rt=si*2+2;
build(lf,ss,md);
build(rt,md+1,se);
seg[si]=max(seg[lf],seg[rt]);
}
int go_for(ll val,int si=0,int ss=0,int se=n-1){
if(seg[si]<val) return -1;
if(ss==se) return ss;
int md=ss+(se-ss)/2,lf=si*2+1,rt=si*2+2;
if(seg[lf]>=val) return go_for(val,lf,ss,md);
return go_for(val,rt,md+1,se);
}
int main(){
//freopen("haa.txt","r",stdin);
//freopen("myfile.txt","w",stdout);
int t;
scanf("%d",&t);
while(t--){
int m;
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)
scanf("%d",arr+i);
pre[0]=arr[0];
for(int i=1;i<n;++i)
pre[i]=pre[i-1]+arr[i];
build();
while(m--){
int x;
scanf("%d",&x);
int cur=go_for(x);
if(cur==-1&&pre[n-1]<=0){
printf("-1 ");
continue;
}
else if(cur!=-1){
printf("%d ",cur);
continue;
}
else{
int lo=1,hi=1e9;
while(lo<hi){
int md=lo+(hi-lo)/2;
if(md*1ll*pre[n-1]+seg[0]<x) lo=md+1;
else hi=md;
}
ll cnt=lo*1ll*n+go_for(x-lo*pre[n-1]);
printf("%lld ",cnt);
}
}
puts("");
}
return 0;
}
| 13 |
CPP
|
import bisect
from collections import defaultdict
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
arr = [int(i) for i in input().split()]
ops = [int(i) for i in input().split()]
prefix_sum = [0 for i in range(n)]
prefix_sum[0] = arr[0]
for i in range(1, n):
prefix_sum[i] = prefix_sum[i - 1] + arr[i]
prefix_pos = []
prefix_min_index = defaultdict(int)
for i in range(n):
if prefix_sum[i] > 0:
prefix_pos.append((prefix_sum[i],i))
prefix_pos.sort()
for i in range(len(prefix_pos) - 1,-1, -1):
if i < len(prefix_pos) - 1:
prefix_min_index[prefix_pos[i][0]] = min(prefix_pos[i][1], prefix_min_index[prefix_pos[i + 1][0]])
else:
prefix_min_index[prefix_pos[i][0]] = prefix_pos[i][1]
ans = []
for i in range(m):
tar = ops[i]
if len(prefix_pos) <= 0:
ans.append(-1)
continue
need = tar - prefix_pos[-1][0]
if need <= 0:
res = bisect.bisect_left(prefix_pos,(tar,0))
amount = prefix_pos[res][0]
ans.append(prefix_min_index[amount])
else:
if prefix_sum[-1] <= 0:
ans.append(-1)
continue
else:
times = need // prefix_sum[-1]
if need%prefix_sum[-1] != 0:
times += 1
need = tar - (times * prefix_sum[-1])
res = bisect.bisect_left(prefix_pos,(need,0))
amount = prefix_pos[res][0]
cost = times*n
ans.append(cost + prefix_min_index[amount])
print(' '.join(str(i) for i in ans))
| 13 |
PYTHON3
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i <= (int)n; ++i)
#define forin(i, a, b) for (int i = a; i <= (int)b; ++i)
#define rofin(i, a, b) for (int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define sync \
ios::sync_with_stdio(false); \
cin.tie(NULL)
#ifdef LOCAL
#define debug(i) cout << #i << ": " << i << endl
#else
#define debug(i)
#endif
using ll = long long;
using pii = pair<int, int>;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll inf = 1e17;
void solve() {
int n, m;
cin >> n >> m;
vll a(n + 1);
vpll prefix;
ll sum = 0;
forin(i, 1, n) {
cin >> a[i];
sum += a[i];
if (prefix.empty() || sum > prefix.back().first) {
prefix.emplace_back(sum, i);
}
}
forin(i, 1, m) {
ll x;
cin >> x;
if (prefix.back().first < x && sum <= 0) {
cout << -1 << ' ';
continue;
}
ll rounds = x <= prefix.back().first ? 0 : (x - prefix.back().first + sum - 1) / sum;
x -= rounds * sum;
ll ans = rounds * n;
pll search = { x, 0LL };
auto it = lower_bound(prefix.begin(), prefix.end(), search);
assert(it < prefix.end());
cout << ans + prefix[it - prefix.begin()].second - 1 << ' ';
}
cout << '\n';
}
int main() {
sync;
int t;
cin >> t;
while (t--) solve();
}
| 13 |
CPP
|
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);cout<<setprecision(25);
#define pb push_back
typedef long long int ll;
ll M=1000000007;
using namespace std;
int main()
{
IOS;
ll T;
cin>>T;
while(T--)
{
ll n,m,i,sum=0;
cin>>n>>m;
ll a[n],mx[n],pref[n];
for(i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
pref[0]=a[0];
mx[0]=a[0];
for(i=1;i<n;i++){
pref[i]=pref[i-1]+a[i];
mx[i]=max(mx[i-1],pref[i]);
}
for(i=0;i<m;i++)
{
ll q,ans=0;
cin>>q;
if(q>mx[n-1]){
if(pref[n-1]<=0){
cout<<-1<<" ";
continue;
}
else{
ans=(q-mx[n-1]+pref[n-1]-1)/pref[n-1];
q-=ans*pref[n-1];
}
}
ll idx=lower_bound(mx,mx+n,q)-mx;
cout<<(ans*n)+idx<<" ";
}
cout<<endl;
}
}
| 13 |
CPP
|
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+200;
typedef long long ll;
ll a[N],b[N];
ll sum[N];
int main()
{
int T;scanf("%d",&T);
while(T--)
{
ll mx=-1e18;memset(sum,0,sizeof sum);
int n,m;scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
for(int i=1;i<=n;i++){sum[i]=sum[i-1]+a[i],mx=max(mx,sum[i]);}
ll qq=sum[n];
for(int i=1;i<=n;i++){sum[i]=max(sum[i],sum[i-1]);}
while(m--)
{
ll x,w=0;scanf("%lld",&x);
if(x>mx){
if(qq<=0){
printf("-1 ");continue;
}
else {
w=(x-mx+qq-1)/qq;
x-=w*qq;
}
}
int pos=lower_bound(sum+1,sum+n+1,x)-sum;
printf("%lld ",w*n+pos-1);
}
printf("\n");
}
}
| 13 |
CPP
|
/*
** Author: Kartikey Tewari
** Time: 02-04-2021 17:40:25
*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll tt;
cin >> tt;
for (ll yy=0;yy<=tt-1;yy++)
{
ll n,m;
cin >> n >> m;
vector<ll> arr(n);
ll sum=0;
for (ll i=0;i<=n-1;i++)
{
cin >> arr[i];
sum+=arr[i];
}
vector<ll> query(m);
for (ll i=0;i<=m-1;i++)
{
cin >> query[i];
}
vector<ll> pre_sum(n);
ll val=0;
ll pre_sum_max=0;
for (ll i=0;i<=n-1;i++)
{
val+=arr[i];
pre_sum[i]=val;
pre_sum_max=max(pre_sum_max, pre_sum[i]);
}
vector<ll> pre_inc;
vector<ll> pre_index;
ll lead=pre_sum[0];
pre_inc.push_back(lead);
pre_index.push_back(0);
for (ll i=0;i<=n-1;i++)
{
if (pre_sum[i]>lead)
{
lead=pre_sum[i];
pre_inc.push_back(lead);
pre_index.push_back(i);
}
}
for (ll i=0;i<=m-1;i++)
{
if ((query[i]>pre_sum_max)&&(sum<=0))
{
cout << "-1 ";
}
else
{
ll min_round=0;
if (query[i]>pre_sum_max)
{
min_round=(query[i]-pre_sum_max)/sum;
if (((query[i]-pre_sum_max)%sum)!=0)
{
min_round++;
}
}
ll rem=query[i]-(min_round*sum);
auto it=lower_bound(pre_inc.begin(),pre_inc.end(),rem);
ll dval=distance(pre_inc.begin(),it);
ll ans=n*min_round;
if (dval==(ll)pre_index.size())
{
if (ans==0)
{
ans+=*pre_index.rbegin();
}
else
{
ans+=*pre_index.rbegin()+1;
}
}
else
{
ans+=pre_index[dval];
}
cout << ans << " ";
}
}
cout << endl;
}
return 0;
}
| 13 |
CPP
|
import sys
input=sys.stdin.readline
from bisect import bisect_left
from math import ceil
t=int(input())
for _ in range(t):
n,m=map(int,input().split())
a=list(map(int,input().split()))
x=list(map(int,input().split()))
max_cycle_sum=-float('inf')
cycle_sum=0
pos_max_cycle_sum=[]
for i in range(n):
cycle_sum+=a[i]
max_cycle_sum=max(cycle_sum,max_cycle_sum)
pos_max_cycle_sum.append(max_cycle_sum)
for i in range(m):
if(max_cycle_sum>=x[i]):
ans=bisect_left(pos_max_cycle_sum,x[i])
print(ans,end=" ")
continue
elif(cycle_sum<=0):
print(-1,end=" ")
continue
else:
cycles_completed=ceil((x[i]-max_cycle_sum)/cycle_sum)
ans=n*cycles_completed
remaining=x[i]-cycles_completed*cycle_sum
partial=bisect_left(pos_max_cycle_sum,remaining)
ans+=partial
print(ans,end=" ")
print()
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n,m;
long long sum;
long long a[N];
vector<pair<long long,int>> v;
int minp[N];
long long solve(long long x){
long long maxv = v[v.size() - 1].first;
if(maxv < x && sum <= 0) return -1;
if(x <= maxv){
int l = 0,r = v.size() - 1;
while(l < r){
int mid = (l + r) / 2;
if(v[mid].first < x) l = mid + 1;
else r = mid;
}
return minp[l] - 1;
}
long long cnt = 0;
if(sum > 0) cnt = (x - maxv) / sum;
x -= sum * cnt;
if(x > maxv){
cnt++;
x -= sum;
}
int l = 0,r = v.size() - 1;
while(l < r){
int mid = (l + r) / 2;
if(v[mid].first < x) l = mid + 1;
else r = mid;
}
return cnt * n + minp[l] - 1;
}
int main(){
int t;scanf("%d",&t);
int Kase = 0;
while(t--){
scanf("%d%d",&n,&m);
sum = 0;
for(int i = 1;i <= n; ++i){
scanf("%lld",a + i);
sum += a[i];
}
v.clear();
long long tmp = 0;
for(int i = 1;i <= n; ++i){
tmp += a[i];
v.push_back({tmp,i});
}
sort(v.begin(),v.end());
minp[v.size()] = n + 1;
for(int i = v.size() - 1;i >= 0 ;--i){
minp[i] = min(minp[i + 1],v[i].second);
}
// for(int i = 0;i < v.size(); ++i) cout << minp[i] << " ";
// cout << endl;
for(int i = 0;i < m; ++i){
long long x;scanf("%lld",&x);
printf("%lld ",solve(x));
}
//printf("case: %d",++Kase);
puts("");
}
return 0;
}
| 13 |
CPP
|
/// vonat1us
#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void fin() {
#ifdef AM
freopen(".in", "r", stdin);
#endif
}
const bool flag = 1;
const int N = 2e5+10;
ll n, p[N], t[N<<2];
void build(int u = 0, int l = 0, int r = n+1) {
if (r-l == 1) {
t[u] = p[l];
return;
}
int m = l+r >> 1;
build(u+u+1, l, m);
build(u+u+2, m, r);
t[u] = max(t[u+u+1], t[u+u+2]);
}
int get(ll x, int u = 0, int l = 0, int r = n+1) {
if (t[u] < x) {
return -1;
}
if (r-l == 1) {
return l;
}
int m = l+r >> 1;
if (t[u+u+1] >= x) {
return get(x, u+u+1, l, m);
} else {
return get(x, u+u+2, m, r);
}
}
void ma1n() {
int q;
cin >> n >> q;
for (int i = 0; i < n; ++i) {
cin >> p[i+1], p[i+1] += p[i];
}
build();
ll s = p[n];
ll mx = *max_element(p, p+n+1);
for (ll x; q--;) {
cin >> x;
ll ans = -1;
if (s <= 0) {
ans = get(x);
} else {
ll l = 0;
ll r = 1e9;
while (l <= r) {
ll m = l+r >> 1ll;
if (m > x/s) {
ans = m*n, r = m-1;
continue;
}
int pos = get(x-m*s);
if (~pos) {
ans = m*n + pos, r = m-1;
} else {
l = m+1;
}
}
}
cout << (~ans ? ans-1 : -1) << " ";
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr), fin();
int ts = 1;
if (flag) {
cin >> ts;
}
while (ts--) {
ma1n();
}
return 0;
}
| 13 |
CPP
|
import sys,functools,collections,bisect,math
input = sys.stdin.readline
#print = sys.stdout.write
t = int(input())
for _ in range(t):
n,m = map(int,input().strip().split())
a = list(map(int,input().strip().split()))
x = list(map(int,input().strip().split()))
for i in range(1,n):
a[i] += a[i-1]
anew = [(a[0],0)]
for i in range(n):
if anew[-1][0] < a[i]:
anew.append((a[i],i))
ma = anew[-1][0]
s = a[-1]
#print(anew)
ans = []
for i in range(m):
if s <= 0:
if ma >= x[i]:
h = 1
else:
ans.append(-1)
continue
else:
h = math.ceil(x[i]/s)
l = 0
while l<h:
mid = (h+l)//2
if s*mid+ma >= x[i]:
h = mid
else:
l = mid+1
preans = h*n
pre = s*h
#print(pre,preans)
ind = bisect.bisect_left(anew,(x[i]-pre,0))
ans.append(preans+anew[ind][1])
print(' '.join(str(i) for i in ans))
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define INF 1e18
#define N 1000005
using namespace std;
void solve()
{
ll n, m;
cin >> n >> m;
ll a[n];
ll sum = 0;
set<pair<ll, ll>> s;
ll pre[n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
sum += a[i];
}
ll mx = 0;
for (int i = 0; i < n; ++i)
{
if (i == 0)pre[i] = a[i];
else pre[i] = pre[i - 1] + a[i];
if (pre[i] > mx)
s.insert({pre[i], i});
mx = max(mx, pre[i]);
}
while (m--)
{
ll x;
cin >> x;
if (x <= mx)
{
ll pos = s.lower_bound({x, -1})->second;
cout << pos << " ";
}
else if (sum <= 0)
{
cout << -1 << " ";
}
else
{
ll round = (x - mx) / sum;
if (x - round * sum > mx)
round++;
x -= round * sum;
ll pos = s.lower_bound({x, -1})->second;
cout << pos + round*n << " ";
}
} cout << endl;
}
int32_t main()
{
IOS
ll T = 1;
cin >> T;
for (ll i = 1; i <= T; ++i)
{
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;
cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}
template<class T> ostream &operator<<(ostream& os, vector<T> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define re(n) for (int i = 0; i < n; ++i)
#define rep(i,a,b) for (int i = a; i < b; ++i)
#define eb emplace_back
//OutPut
void ps(ll x) {
cout << x << endl;
}
void ps(char x) {
cout << x << endl;
}
void ps(string x) {
cout << x << endl;
}
void ps(vi a) {
for (int i = 0; i < a.size(); ++i) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
}
void ps(vector<ll> a) {
for (int i = 0; i < a.size(); ++i) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
}
#define ps_end(x) {ps(x); return;}
const int md = 1e9 + 7; //998244353 ;
const int dir[4][2] = {{-1,0}, {1, 0}, {0, -1}, {0, 1}};
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
void setIO(string s){
ios_base::sync_with_stdio(false);
cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int maxn = 1e6 + 10;
int n, m, nq, nk;
string str;
void task() {
cin >> n; cin >> m;
vi a(n);
re(n) cin >> a[i];
ll init = a[0];
vector<ll> sum(n + 1);
re(n) sum[i + 1] = sum[i] + a[i];
vector<pair<ll, int>> p;
ll last = -1e18;
re(n) {
if (sum[i + 1] > last) {
p.pb({sum[i + 1], i});
last = sum[i + 1];
}
}
assert(p.size() >= 1);
debug(p);
vector<ll> ans(m);
for (int i = 0; i < m; ++i) {
ll x; cin >> x;
if (p.back().fi < x && sum[n] <= 0) {
ans[i] = -1;
continue;
}
ll diff = x - p.back().fi;
ll T = 0;
if (diff > 0 && sum[n] > 0) T = (diff - 1) / sum[n] + 1;
x -= sum[n] * T;
auto it = lower_bound(p.begin(), p.end(), make_pair(x, -1));
assert(it != p.end());
ans[i] = T * n + it->se;
}
ps(ans);
//Read the stuff at the bottom
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout<<fixed<<setprecision(20);
int T = 1;
cin >> T;
for (int ti = 1; ti <= T; ++ti) {
task();
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* write down
*/
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define nn "\n"
#define sci(x) scanf("%d", &x)
#define LL_INF (1LL << 62)
#define INF (1 << 30)
#define SetBit(x, k) (x |= (1LL << k))
#define ClearBit(x, k) (x &= ~(1LL << k))
#define CheckBit(x, k) (x & (1LL << k))
#define mod 1000000007
#define N 200005
int arr[N];
int tree[4*N];
void init(int b, int e, int node = 1)
{
if (b == e)
{
tree[node] = arr[b];
return;
}
int left = node * 2;
int right = node * 2 + 1;
int mid = (b + e) / 2;
init(b, mid, left);
init(mid + 1, e, right);
tree[node] = min(tree[left], tree[right]);
}
int query(int b, int e, int i, int j, int node = 1)
{
if (b >= i && e <= j)
return tree[node];
if (b > j || e < i)
return (INF);
int left = node * 2;
int right = node * 2 + 1;
int mid = (b + e) / 2;
return min(query(b, mid, i, j, left), query(mid + 1, e, i, j, right));
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
memset(arr, 0, sizeof(arr[0])*(n+3));
for(int i = 0; i < 4*n+3; i++){
tree[i] = INF;
}
ll x[n];
for(int i = 0; i < n; i++){
cin >> x[i];
if(i>0) x[i] += x[i-1];
}
vector<pll> v;
for(int i = 0; i < n; i++){
v.pb({x[i], i});
}
sort(v.begin(), v.end());
vector<ll> val, indx;
for(int i = 0; i < n; i++){
val.pb(v[i].ff);
indx.pb(v[i].ss);
arr[i+1] = v[i].ss;
}
init(1, n);
ll sum = x[n-1];
for(int i = 0; i < m; i++){
int x;
cin >> x;
if(val.back() >= x){
int p = lower_bound(val.begin(), val.end(), x) - val.begin();
int z = query(1, n, p+1, n);
cout << z << " ";
}
else {
if(sum <= 0) cout << -1 << " ";
else {
ll rem = x-val.back();
ll cnt = rem/sum;
if(rem%sum) cnt++;
ll ans = LL_INF;
ll need = x-cnt*sum;
// cout << need << ":" << val.back() << "***" << nn;
if(val.back() >= need){
int p = lower_bound(val.begin(), val.end(), need) - val.begin();
int z = query(1, n, p+1, n);
ans = cnt*n+z;
}
need = x-(cnt-1)*sum;
if(val.back() >= need){
int p = lower_bound(val.begin(), val.end(), need) - val.begin();
int z = query(1, n, p+1, n);
ans = min(ans, (cnt-1)*n+z);
}
cout << ans << " ";
}
}
}
cout << nn;
}
return 0;
}
| 13 |
CPP
|
from bisect import *
from math import ceil
for _ in range(int(input())):
n,m = map(int,input().split())
a = list(map(int,input().split()))
x = list(map(int,input().split()))
prefMax=[a[0]]*n
prefSum=[a[0]]*n
for i in range(1,n):
prefSum[i] = prefSum[i-1]+a[i]
prefMax[i] = max(prefMax[i-1],prefSum[i])
ans = []
for tar in x:
curr = -1
if tar<=prefMax[-1]:
curr=bisect_left(prefMax,tar)
else:
if prefSum[-1]>0:
tot = ceil((tar-prefMax[-1])/prefSum[-1])
curr = tot*n + (bisect_left(prefMax,tar-tot*prefSum[-1]) if tar!=tot*prefSum[-1] else -1)
ans.append(curr)
print(*ans)
| 13 |
PYTHON3
|
from os import path
import sys,time
# mod = int(1e9 + 7)
# import re
from math import ceil, floor,gcd,log,log2 ,factorial,sqrt
from collections import defaultdict ,Counter , OrderedDict , deque
# from itertools import combinations
# from string import ascii_lowercase ,ascii_uppercase
# from bisect import *
from functools import reduce
from operator import mul
maxx = float('inf')
#----------------------------INPUT FUNCTIONS------------------------------------------#
I = lambda :int(sys.stdin.buffer.readline())
tup= lambda : map(int , sys.stdin.buffer.readline().split())
lint = lambda :[int(x) for x in sys.stdin.buffer.readline().split()]
S = lambda: sys.stdin.readline().strip('\n')
grid = lambda r :[lint() for i in range(r)]
stpr = lambda x : sys.stdout.write(f'{x}' + '\n')
star = lambda x: print(' '.join(map(str, x)))
localsys = 0
start_time = time.time()
if (path.exists('input.txt')):
sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
#left shift --- num*(2**k) --(k - shift)
# st =ascii_lowercase
def bi(x):
l , h = 0 , n-1
res = n
while l <= h :
m = (l+h) >> 1
if pref_m[m] >= x :
res = m
h = m-1
else:
l = m+1
return -1 if res == n else res
for _ in range(I()):
n , m= tup()
a = lint()
b = lint()
pre = [a[i] for i in range(n)]
pref_m = [a[i] for i in range(n)]
for i in range(1 , n ):
pre[i]+=pre[i-1]
pref_m[i] = max(pre[i], pref_m[i-1])
if pre[-1] <= 0 :
for x in b:
print(bi(x),end = ' ')
else:
ma = max(pre)
for x in b:
t = max(0 , (x - ma + pre[-1] - 1)//pre[-1])
print(t*n + bi(x - t*pre[-1]) ,end = ' ')
print()
if localsys:
print("\n\nTime Elased :",time.time() - start_time,"seconds")
| 13 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fr first
#define sc second
#define pii pair<ll,ll>
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define rep(i,a,b) for(ll i=a;i<b;i++)
// const ll mod = 1000000007;
const ll mod = 998244353;
ll z = 1000000000;
#define PI 3.14159265
int gcd(int a, int b)
{
if (!a)
return b;
return gcd(b % a, a);
}
ll powe(ll x, ll y)
{
if (y == 0) return 1;
if (y == 1) return x;
ll t = powe(x, y / 2);
t = (t * t) % mod;
if (y % 2 == 1) t = (t * x) % mod;
return t;
}
ll binomialCoeff(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j - 1] +
C[i - 1][j];
}
}
return C[n][k];
}
// bool checkSubset(vi &nums, int sum)
// {
// vector<vector<bool>> dp(nums.size()+1, vector<bool> (sum+1));
// for(int i=0;i<=nums.size();i++)
// dp[i][0] = true;
// for(int i=0;i<= sums;i++)
// dp[0][i] = false;
// for(int i=1;i<=nums.size();i++)
// {
// for(int j=1;j<=sums;j++)
// {
// if(j<nums[i-1])
// dp[i][j] = dp[i-1][j];
// else
// dp[i][j] = dp[i-1][j] || dp[i-1][j - nums[i-1]];
// }
// }
// return dp[nums.size()][sum];
// }
vi primeFactors(ll n)
{
// Print the number of 2s that divide n
vi res;
while (n % 2 == 0)
{
res.pb(2);
n = n / 2;
}
// n must be odd at this point. So we can skip
// one element (Note i = i +2)
for (int i = 3; i <= sqrt(n); i = i + 2)
{
// While i divides n, print i and divide n
while (n % i == 0)
{
res.pb(i);
n = n / i;
}
}
// This condition is to handle the case when n
// is a prime number greater than 2
if (n > 2)
return {n};
return res;
}
void precal()
{
int invFact[400005], fact[400005], intermediate[400005];
invFact[1] = invFact[0] = 1;
fact[1] = fact[0] = 1;
intermediate[1] = intermediate[0] = 1;
rep(i, 2, 200001)
{
intermediate[i] = intermediate[mod % i] * (mod - mod / i) % mod;
}
rep(i, 2, 200001)
{
fact[i] = (fact[i - 1] * i) % mod;
invFact[i] = (intermediate[i] * invFact[i - 1]) % mod;
}
}
// ll dfs(vector<int> &x, vector<bool> &vis, int i)
// {
// ll len = 1;
// while (x[i] != 0)
// {
// if (vis[x[i]] == 1)
// return len + 1;
// vis[x[i]] = 1;
// i = x[i];
// len++;
// }
// return len;
// }
int dfs(vector<vector<int>> &graph, int u, vector<vector<int>> &reducedGraph)
{
if (graph[u].size() == 0)
return u;
if (graph[u].size() == 1)
{
int child = dfs(graph, graph[u][0], reducedGraph);
reducedGraph[u].pb(child);
return child;
}
for (int i = 0; i < graph[u].size(); i++)
{
int child = dfs(graph, graph[u][i], reducedGraph);
reducedGraph[u].pb(child);
}
return u;
}
ll calc(vector<vector<int>> &reducedGraph, int u, int w, map<pair<int, int>, int> &mp)
{
if (mp.find({u, w}) != mp.end())
return mp[ {u, w}];
int childs = reducedGraph[u].size();
if ( childs == 0)
return 0;
if (w % childs != 0)
return w;
ll val = 0;
for (int i = 0; i < reducedGraph[u].size(); i++)
{
val += calc(reducedGraph, reducedGraph[u][i], w / childs, mp);
}
return mp[ {u, w}] = val;
}
vector<bool> SieveOfEratosthenes(int n)
{
vector<bool> prime(n + 1, true);
for (int p = 2; p * p <= n; p++)
{
if (prime[p] == true)
{
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
prime[1] = false;
return prime;
}
int count(int a, int b)
{
int c = 0;
while (a * 2 < b)
{
a = a * 2;
c++;
}
return c;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int test = 1;
cin >> test;
while (test--)
{
ll n, m;
cin >> n >> m;
vector<ll> a(n), sum(n, 0);
ll maxa = INT_MIN;
rep(i, 0, n)
{
cin >> a[i];
}
sum[0] = a[0];
maxa = max(maxa, a[0]);
rep(i, 1, n)
{
sum[i] += (sum[i - 1] + a[i]);
maxa = max(maxa, sum[i]);
}
vector<ll> pref;
pref.pb(sum[0]);
ll pre = sum[0];
map<ll, ll> mp;
mp[sum[0]] = 0;
rep(i, 1, n)
{
if (sum[i] > pre)
{
pref.pb(sum[i]);
pre = sum[i];
mp[sum[i]] = i;
}
}
while (m--)
{
ll x;
cin >> x;
ll ans = 0;
if (x > maxa && sum[n - 1] <= 0)
cout << "-1 ";
else
{
if (x > maxa)
{
ll z = (x - maxa) / sum[n - 1];
while ((z * sum[n - 1]) + maxa < x)
z++;
x = x - (z * sum[n - 1]);
ans += (z * n);
// cout << "hi";
}
ll ind = (lower_bound(all(pref), x) - pref.begin());
cout << ans + mp[pref[ind]] << " ";
}
}
cout << "\n";
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
const char nl = '\n';
void solve() {
int n, m;
cin >> n >> m;
vll v(n);
for(auto &z : v)
cin >> z;
vi x(m);
for(auto &z : x)
cin >> z;
ll pref = 0;
ll maksi = 0;
vll prefMax(n);
for(int i = 0; i < n; ++i) {
pref += v[i];
ckmax(maksi, pref);
prefMax[i] = maksi;
}
ll sve = pref;
//dbg(prefMax);
for(int i = 0; i < m; ++i) {
if(sve <= 0) {
if(x[i] > prefMax.back())
cout << -1 << " ";
else {
cout << upper_bound(all(prefMax), x[i]-1) - prefMax.begin() << " ";
}
} else {
ll krug = max(0LL, (x[i] - prefMax.back() + sve - 1) / sve);
ll ans = krug * n;
//dbg(krug);
ans += upper_bound(all(prefMax), x[i] - krug*sve - 1) - prefMax.begin();
cout << ans << " ";
}
}
cout << nl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int testCases = 1;
cin >> testCases;
while(testCases--)
solve();
}
| 13 |
CPP
|
from collections import Counter
from bisect import bisect_right, bisect_left
from math import ceil
def solve(b,total,x,n):
if len(b) == 0:
return -1
if (x > b[-1] and total<=0):
return -1
if x <= b[-1]:
return bisect_left(b,x)
c = ceil((x-b[-1])/total)
idx = bisect_left(b,x-c*total)
return c*n + idx
t = int(input())
for i in range(t):
n,m = tuple(map(int,(input().split())))
a = list(map(int,input().split()))
x = list(map(int,input().split()))
total = sum(a)
b = [0]
c = 0
for e in a:
c+=e
b.append(max(c,b[-1]))
b = b[1:]
for xi in x:
print(solve(b,total,xi,n),end=" ")
print()
| 13 |
PYTHON3
|
#------------------Important Modules------------------#
from sys import stdin,stdout
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import *
input=stdin.readline
prin=stdout.write
from random import sample
t=int(input())
#t=1
from collections import Counter,deque
from math import sqrt,ceil,log2,gcd
#dist=[0]*(n+1)
class DisjSet:
def __init__(self, n):
# Constructor to create and
# initialize sets of n items
self.rank = [1] * n
self.parent = [i for i in range(n)]
# Finds set of given item x
def find(self, x):
# Finds the representative of the set
# that x is an element of
if (self.parent[x] != x):
# if x is not the parent of itself
# Then x is not the representative of
# its set,
self.parent[x] = self.find(self.parent[x])
# so we recursively call Find on its parent
# and move i's node directly under the
# representative of this set
return self.parent[x]
# Do union of two sets represented
# by x and y.
def union(self, x, y):
# Find current sets of x and y
xset = self.find(x)
yset = self.find(y)
# If they are already in same set
if xset == yset:
return
# Put smaller ranked item under
# bigger ranked item if ranks are
# different
if self.rank[xset] < self.rank[yset]:
self.parent[xset] = yset
elif self.rank[xset] > self.rank[yset]:
self.parent[yset] = xset
# If ranks are same, then move y under
# x (doesn't matter which one goes where)
# and increment rank of x's tree
else:
self.parent[yset] = xset
self.rank[xset] = self.rank[xset] + 1
# Driver code
def f(arr,i,j,d,dist):
if i==j:
return
nn=max(arr[i:j])
for tl in range(i,j):
if arr[tl]==nn:
dist[tl]=d
#print(tl,dist[tl])
f(arr,i,tl,d+1,dist)
f(arr,tl+1,j,d+1,dist)
#return dist
def ps(n):
cp=0
while n%2==0:
n=n//2
cp+=1
for ps in range(3,ceil(sqrt(n))+1,2):
while n%ps==0:
n=n//ps
cp+=1
if n!=1:
return False
return True
#count=0
#dp=[[0 for i in range(m)] for j in range(n)]
#[int(x) for x in input().strip().split()]
def find_gcd(x, y):
while(y):
x, y = y, x % y
return x
# Driver Code
def factorials(n,r):
#This calculates ncr mod 10**9+7
slr=n;dpr=r
qlr=1;qs=1
mod=10**9+7
for ip in range(n-r+1,n+1):
qlr=(qlr*ip)%mod
for ij in range(1,r+1):
qs=(qs*ij)%mod
#print(qlr,qs)
ans=(qlr*modInverse(qs))%mod
return ans
def modInverse(b):
qr=10**9+7
return pow(b, qr - 2,qr)
tt=[xa**3 for xa in range(0,10**4+1)]
qq=set(tt)
def digits(k,rp):
n=len(k)
pq=k[::-1]
jq=''
for ij in pq:
if ij=='1':
jq+='1'
elif ij=='2':
jq+='5'
elif ij=='4' or ij=='7' or ij=='3' or ij=='6' or ij=='9':
jq+='-'
elif ij=='5':
jq+='2'
elif ij=='8':
jq+='8'
elif ij=='0':
jq+='0'
if jq.find('-')!=-1:
return -1
else:
jl=int(jq)
if jl>=rp:
return -1
else:
return jq
def fr(a,b,h,m):
kl=int(b)
kl=(kl+1)%m
b='0'*(2-len(str(kl)))+str(kl)
if b=='0'*2:
kj=(int(a)+1)%h
a='0'*(2-len(str(kj)))+str(kj)
return [a,b]
#----------Input functions--------------------#
def ilist():
return [int(x) for x in input().strip().split()]
def outstrlist(array:list)->str:
array=[str(x) for x in array]
return ' '.join(array);
def islist():
return list(map(str,input().split().rstrip()))
def outfast(arr:list)->str:
ss=''
for ip in arr:
ss+=str(ip)+' '
return prin.write(ss);
#===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType
def iterative(f, stack=[]):
def wrapped_func(*args, **kwargs):
if stack: return f(*args, **kwargs)
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
continue
stack.pop()
if not stack: break
to = stack[-1].send(to)
return to
return wrapped_func
#### END ITERATE RECURSION ####
#===============================================================================================
for jj in range(t):
n,m=ilist();
arr=ilist();xrr=ilist();
sums=[0]*(n+1)
for i in range(1,n+1):
sums[i]=sums[i-1]+arr[i-1]
itt=sums[n];
#lqq=sums[1:n+1]
lp=[];rrr=max(sums[1:n+1])
xx=0;
p=[];dicts={}#The dict will store index of each element where sum increases
cc=0;
for i in range(1,n+1):
if sums[i]>xx:
p.append(sums[i])
dicts[cc]=i;
cc+=1;
xx=sums[i]
for pp in range(m):
if xrr[pp]>rrr and sums[n]<=0:
lp.append(-1)
continue
steps=0;
if sums[n]>0 and xrr[pp]>rrr:
steps=ceil((xrr[pp]-rrr)/sums[n])
#print(bl([],1,0,0))
ans=bl(p,xrr[pp]-sums[n]*steps,0,len(p))
lp.append(dicts[ans]-1+n*steps)
print(outstrlist(lp))
| 13 |
PYTHON3
|
from sys import stdin
input=stdin.buffer.readline
import math
def func(dp,start,end,x):
pos=-1
while start<=end:
mid=(start+end)//2
if dp[mid][0]>=x:
pos=mid
end=mid-1
else:
start=mid+1
return pos
t=int(input())
for i in range(t):
n,m=map(int,input().split())
arr=[int(x) for x in input().split()]
query=[int(x) for x in input().split()]
x=0
dp=[]
for i in range(n):
x=x+arr[i]
dp.append((x,i))
s=x
dp.sort()
stack=[-1]*n
mn=1000000
# print(dp)
for i in range(n-1,-1,-1):
mn=min(mn,dp[i][1])
stack[i]=mn
# print(stack)
ans=[]
for q in query:
if dp[-1][0]<=0:
ans.append(-1)
continue
if q<=dp[-1][0]:
x=func(dp,0,n-1,q)
ans.append(stack[x])
continue
if s<=0:
ans.append(-1)
continue
c=math.ceil((q-dp[-1][0])/s)
new_ans=c*n
q=q-c*s
x=func(dp,0,n-1,q)
ans.append(new_ans+stack[x])
print(*ans)
| 13 |
PYTHON3
|
from bisect import *
import math
a=int(input())
for i in range(a):
n,m=map(int,input().split())
z=list(map(int,input().split()))
x=list(map(int,input().split()))
for i in range(1,len(z)):
z[i]+=z[i-1]
maxa=[]
for i in range(len(z)):
if(i==0):
maxa.append(z[0])
else:
maxa.append(max(maxa[-1],z[i]))
for i in range(len(x)):
r=bisect_left(maxa,x[i])
if(r==len(maxa) and z[-1]<=0):
print(-1,end=" ")
else:
if(r<len(maxa)):
print(r,end=" ")
else:
left=x[i]-maxa[-1]
rounds=math.ceil(left/z[-1])
actual=x[i]-(rounds*z[-1])
r=bisect_left(maxa,actual)
total=rounds*(len(z))-1
print(total+r+1,end=" ")
print(' ')
| 13 |
PYTHON3
|
from bisect import bisect_left
for i in range(int(input())):
n, m = map(int,input().split());a = list(map(int,input().split()));p = [0]*(n+1);M = [0]*(n+1)
for i in range(n):p[i+1] = p[i] + a[i];M[i+1] = max(M[i], p[i+1])
s = p[-1];ans = []
for x in map(int,input().split()):
r = 0
if s > 0:t = max((x-M[-1]+s-1)//s,0);r += t*n;x -= t*s
ans.append('-1' if x > M[-1] else str(r + bisect_left(M,x) - 1))
print(' '.join(ans))
| 13 |
PYTHON3
|
#!/usr/bin/python3.6
import sys
input = sys.stdin.readline
from collections import Counter
import bisect
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
a = [int(item) for item in input().split()]
x = [int(item) for item in input().split()]
cumsum = [0]
cummax = [0]
for item in a:
cumsum.append(cumsum[-1] + item)
cummax.append(max(cummax[-1], cumsum[-1]))
diff = cumsum[-1]
ans = []
for item in x:
ret = 0
if diff <= 0 and item > cummax[-1]:
ans.append(-1)
continue
if item > cummax[-1]:
loop = ((item - cummax[-1] + diff - 1) // diff)
ret += loop * n
item -= diff * loop
ret += bisect.bisect_left(cummax, item) - 1
ans.append(ret)
print(*ans)
| 13 |
PYTHON3
|
import sys
max_int = 2147483648 # 2^31
min_int = -max_int
t = int(input())
for _t in range(t):
n, m = map(int, sys.stdin.readline().split())
a = map(int, sys.stdin.readline().split())
x = map(int, sys.stdin.readline().split())
mx = 0
s = 0
maxs = []
for i, aa in enumerate(a):
s += aa
if s > mx:
mx = s
maxs.append((s, i))
full = s
def search(v):
l = -1
r = len(maxs) - 1
while r - l > 1:
m = (r + l) // 2
if maxs[m][0] >= v:
r = m
else:
l = m
return maxs[r][1]
out = []
for xx in x:
tmp = 0
if not maxs:
out.append(-1)
continue
elif xx > maxs[-1][0]:
if full > 0:
tmp = (xx - maxs[-1][0] - 1) // full + 1
xx -= full * tmp
tmp *= n
else:
out.append(-1)
continue
# print(tmp, xx, search(xx))
out.append(tmp + search(xx))
print(' '.join(map(str, out)))
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
#define maxn 3e5+10
#define inf32 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int,int>pii;
const int MOD=1e9+7;
const int INF32=1<<30;
const ll INF64=1LL<<60;
void solve(){
int tc;cin >> tc;
while(tc--){
ll n,m;cin >> n >> m;
vector<ll>a(n),x(m);
for(int i = 0;i<n;i++) cin >> a[i];
for(int i = 0;i<m;i++) cin >> x[i];
vector<ll>pre(n+1,0);
for(int i = 1;i<=n;i++) pre[i] = pre[i-1]+a[i-1];
ll cycle = pre[n];
for(int i = 1;i<=n;i++) pre[i] = max(pre[i],pre[i-1]);
for(int i = 0;i<m;i++){
if(cycle<=0&&pre[n]<x[i]){
cout << -1 <<' ';continue;
}
ll l = 1,check = 0;ll r = 0;
if(cycle<=0) r = n-1;
else if(pre[n]>=1e9) r = n;
else r = 2e18/cycle+10;
while(l<=r){
ll mid = (l+r)/2;
ll check = (mid/n)*cycle+pre[mid%n];
if(mid>=n) check = max(check,(mid/n-1)*cycle+pre[n]);
if(check>=x[i]) r = mid-1;
else l = mid+1;
}
cout << l-1 <<' ';
}
cout <<'\n';
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
return 0;
}
| 13 |
CPP
|
import sys
input = sys.stdin.readline
from collections import *
def judge(i):
return S*c+gain[i]>=xi
def binary_search():
l, r = 0, n-1
while l<=r:
m = (l+r)//2
if judge(m):
r = m-1
else:
l = m+1
return l
for _ in range(int(input())):
n, m = map(int, input().split())
a = list(map(int, input().split()))
x = list(map(int, input().split()))
gain = [a[0]]
for i in range(1, n):
gain.append(gain[-1]+a[i])
M = max(gain)
for i in range(1, n):
gain[i] = max(gain[i], gain[i-1])
S = sum(a)
ans = []
for xi in x:
if S<=0:
if xi>M:
ans.append(-1)
else:
c = 0
ans.append(binary_search())
else:
c = max(0, (xi-M+S-1)//S)
i = binary_search()
ans.append(n-1+(c-1)*n+i+1)
print(*ans)
| 13 |
PYTHON3
|
import sys
import bisect
input=lambda: sys.stdin.readline().strip("\r\n")
from math import log
sa=lambda :input()
sb=lambda:int(input())
sc=lambda:input().split()
sd=lambda:list(map(int,input().split()))
se=lambda:float(input())
sf=lambda:list(input())
flsh=lambda: sys.stdout.flush()
mod=10**9+7
def hnbhai():
n,m=sd()
a=sd()
query=sd()
prefix=[0]*(n+1)
d={}
max_=[0]*(n+1)
for i in range(1,n+1):
prefix[i]=prefix[i-1]+a[i-1]
max_[i]=max(max_[i-1],prefix[i])
if d.get(prefix[i]) is not None:
continue
if prefix[i]>0:
d[prefix[i]]=i-1
#print(max_[i])
abe=[]
#print(max_)
#print(prefix)
for i in range(m):
op=0
ind=bisect.bisect_left(max_,query[i])
if ind!=len(max_):
abe.append(ind-1)
else:
if prefix[n]<=0:
abe.append(-1)
continue
if max_[-1]<query[i]:
ans=query[i]-max_[-1]
op=ans//prefix[n]
if ans%prefix[n]:
op+=1
query[i]-=op*prefix[n]
op=n*op
abe.append(op+bisect.bisect_left(max_,query[i])-1)
print(*abe)
for _ in range(sb()):
hnbhai()
| 13 |
PYTHON3
|
import bisect
t=int(input())
for i in range(t):
n,m=map(int,input().split())
a=list(map(int,input().split()))
x=list(map(int,input().split()))
pre=[0]*n
pre[0]=a[0]
cur=a[0]
for j in range(1,n):
cur+=a[j]
pre[j]=max(cur,pre[j-1])
ans=[0]*m
for j in range(m):
if cur<=0:
if pre[-1]<x[j]:
ans[j]=-1
else:
ans[j]=bisect.bisect_left(pre,x[j])
else:
if pre[-1]<x[j]:
req=x[j]-pre[-1]
d=(req)//cur
if req%cur:
d+=1
x[j]-=(d*cur)
ans[j]=n*d
ans[j]+=bisect.bisect_left(pre,x[j])
print(*ans)
| 13 |
PYTHON3
|
import sys
from sys import stdin
import bisect
tt = int(stdin.readline())
for loop in range(tt):
n,m = map(int,stdin.readline().split())
a = list(map(int,stdin.readline().split()))
xlis = list(map(int,stdin.readline().split()))
s = 0
inds = []
sums = []
for i in range(n):
s += a[i]
if len(inds) == 0:
if s > 0:
inds.append(i)
sums.append(s)
elif sums[-1] < s:
inds.append(i)
sums.append(s)
ans = []
if len(sums) == 0:
print (*[-1 for i in range(m)] )
continue
for x in xlis:
if s <= 0:
if sums[-1] < x:
ans.append(-1)
else:
ans.append( inds[ bisect.bisect_left(sums,x) ] )
else:
l = -1
r = x+1
while r-l != 1:
mid = (l+r)//2
if s*mid + sums[-1] >= x:
r = mid
else:
l = mid
nans = n * r
rem = x - r * s
ans.append ( nans + inds[ bisect.bisect_left(sums,rem) ] )
print (*ans)
| 13 |
PYTHON3
|
"""
Author - Satwik Tiwari .
16th Feb , 2021 - Tueday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from functools import cmp_to_key
# from itertools import *
from heapq import *
from math import gcd, factorial,floor,ceil,sqrt,log2
from copy import deepcopy
from collections import deque
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
#==============================================================================================
#fast I/O region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# inp = lambda: sys.stdin.readline().rstrip("\r\n")
#===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType
def iterative(f, stack=[]):
def wrapped_func(*args, **kwargs):
if stack: return f(*args, **kwargs)
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
continue
stack.pop()
if not stack: break
to = stack[-1].send(to)
return to
return wrapped_func
#### END ITERATE RECURSION ####
#===============================================================================================
#some shortcuts
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var)) #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def testcase(t):
for pp in range(t):
solve(pp)
def google(p):
print('Case #'+str(p)+': ',end='')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(x, y, p) :
y%=(p-1) #not so sure about this. used when y>p-1. if p is prime.
res = 1 # Initialize result
x = x % p # Update x if it is more , than or equal to p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) : # If y is odd, multiply, x with result
res = (res * x) % p
y = y >> 1 # y = y/2
x = (x * x) % p
return res
def ncr(n,r): return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))
def isPrime(n) :
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
inf = pow(10,20)
mod = 10**9+7
#===============================================================================================
# code here ;))
def solve(case):
n,m = sep()
a = lis()
pre = [0]*(n+1)
curr = 0
for i in range(n):
curr += a[i]
if(curr > pre[i]):
pre[i + 1] = curr
else:
pre[i + 1] = pre[i]
xx = lis()
maxi = max(pre)
ans = []
# print(curr)
# print(pre)
# if(curr <= 0):
# for i in range(m):
# ans.append(-1)
# else:
for i in range(m):
x = xx[i]
# if(x > maxi):
# temp = max(0,(x - maxi - 1)//curr + 1)
# ind = bl(pre,x - (curr)*temp)-1
# ans.append(temp*n + ind)
if(x <= maxi):
ind = bl(pre,x)-1
ans.append(ind)
elif(curr <= 0):
ans.append(-1)
else:
temp = max(0,(x - maxi - 1)//curr + 1)
ind = bl(pre,x - (curr)*temp)-1
ans.append(temp*n + ind)
print(' '.join(str(i) for i in ans))
# testcase(1)
testcase(int(inp()))
| 13 |
PYTHON3
|
/*
*
* Author: Hsueh-
* Date: 2021-03-05 21:34:52
*
* */
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...) \
do { \
cout << #x << " -> "; \
err(x); \
} while (0)
void err() { cout << endl; }
template <class T, class... Ts> void err(const T &arg, const Ts &...args) {
cout << arg << " ";
err(args...);
}
#define endl "\n"
#define all(A) A.begin(), A.end()
using ll = long long;
using db = double;
using pII = pair<int, int>;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
int n, m;
int a[N];
void RUN() {
cin >> n >> m;
map<ll, int> mp;
ll sum = 0, Max = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
if (sum > Max) {
Max = sum;
mp[sum] = i;
}
}
for (int i = 1; i <= m; ++i) {
ll x;
cin >> x;
auto it = mp.lower_bound(x);
ll res = 0;
if (it == mp.end() && sum <= 0) {
res = -1;
} else if (it == mp.end()) {
auto last = mp.end();
last--;
ll need = (x - last->first + sum - 1) / sum;
it = mp.lower_bound(x - need * sum);
res = it->second + need * n - 1;
} else {
res = it->second - 1;
}
cout << res << " \n"[i == m];
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(20);
int T;
cin >> T;
while (T--) {
RUN();
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int lim=1e6;int inf=1e8;
ll mod = 1e9+7;
#define ln '\n'
#define forstl(it,v) for(auto &it: v)
#define fi first
#define se second
#define dbg(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) { cerr<<endl; }
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << "\t"; err(++it, args...);
}
template<typename T1,typename T2>
ostream& operator <<(ostream& c,pair<T1,T2> v){
c<<"("<<v.fi<<","<<v.se<<")"; return c;
}
template <template <class...> class TT, class ...T>
ostream& operator<<(ostream& out,TT<T...>& c){
out<<"{ ";
forstl(x,c) out<<x<<" ";
out<<"}"; return out;
}
int main()
{
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t; cin>>t;
while(t--){
int n, m; cin>>n>>m;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
int x[m];
for(int i=0;i<m;i++) cin>>x[i];
pair<ll, int> cum[n];
cum[0] = make_pair(a[0], 0);
for(int i=1;i<n;i++) cum[i] = make_pair(cum[i-1].first+a[i], i);
ll loopsum = cum[n-1].first;
int endzeros = 0;
for(int i=n-1;i>=0;i--){
if(a[i]==0) endzeros++;
else break;
}
sort(cum, cum+n);
int minind[n];
minind[n-1] = cum[n-1].second;
for(int i = n-2;i>=0;i--){
minind[i] = min(minind[i+1], cum[i].second);
}
for(int i=0;i<m;i++){
if(x[i] > cum[n-1].first){
if(loopsum <= 0) cout<<-1<<" ";
else{
ll q = ceil((x[i]-cum[n-1].first)/((double)loopsum));
ll rem = x[i] - loopsum*q;
int ind = lower_bound(cum, cum+n, make_pair(rem, -1)) - cum;
ll ans = q*n + minind[ind];
cout<<ans<<" ";
}
}else{
int ind = lower_bound(cum, cum+n, make_pair((ll)x[i], -1)) - cum;
cout<<minind[ind]<<" ";
}
}
cout<<ln;
}
}
| 13 |
CPP
|
//**sn0wrus**//
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cout.tie(NULL); \
cin.tie(NULL);
#define write(a) \
for (auto x : a) \
{ \
cout << x << " "; \
} \
cout << endl;
#define read(a) \
for (auto &x : a) \
{ \
cin >> x; \
}
#define IN cin >>
#define OUT cout <<
//#define endl "\n"
#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define pb push_back
#define fi first;
#define se second;
using ll = long long int;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using plll = pair<ll,pll>;
using vll = vector<ll>;
using vi = vector<int>;
const ll mod = (ll)(1e9) + 7LL;
const ll M = 998244353LL;
const int dir8[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
const int dir4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
/*
for(int i=0;i<n-1;i++)
{
int a,b;
cin>>a>>b;
a--,b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
*/
bool comp(pll a,pll b)
{
if(a.first < b.first)
{
return true;
}
else if(a.first==b.first)
{
if(a.second < b.second)
{
return true;
}
}
return false;
}
ll fun (vector<pll>&pre, ll x)
{
ll n =pre.size();
ll l=0,r=n;
while(l<r)
{
ll mid = l+(r-l)/2;
if(pre[mid].first < x)
{
l=mid+1;
}
else{
r=mid;
}
}
return pre[l].second;
}
void solve()
{
ll n,m;
cin>>n>>m;
vector<ll>arr(n);
vector<ll>arr1(m);
for(int i=0;i<n;i++)cin>>arr[i];
for(int i=0;i<m;i++)cin>>arr1[i];
vector<pll>pre(n);
vector<pll>tmp;
ll mx=arr[0];
for(int i=0;i<n;i++)
{
if(i==0)
{
pre[i].first=arr[i];
}
else{
pre[i].first=pre[i-1].first+arr[i];
}
pre[i].second=i;
mx = max(mx,pre[i].first);
if(pre[i].first < mx)
{
}
else{
tmp.push_back(pre[i]);
}
}
ll sum = pre[n-1].first;
sort(all(pre),comp);
// for(auto i:pre)
// {
// cout<<i.first<<" ";
// }
// cout<<endl;
for(int i=0;i<m;i++)
{
ll ans;
// cout<<i<<endl;
ll x = arr1[i];
// cout<<"x"<<x<<endl;
ll last = x - mx;
// cout<<"last"<<last<<endl;
if(last <= 0)
{
ans=0;
}
else{
if(sum <= 0)
{
cout<<-1<<" ";
continue;
}
ans = (last+sum-1)/sum;
}
// cout<<"ans"<<ans<<endl;
ll curr = sum*ans;
// cout<<"curr"<<curr<<endl;
ans *=n;
ll t = x-curr;
// cout<<"t"<<t<<endl;
ll qq = fun(tmp,t);
// cout<<"qq"<<qq<<endl;
ans+=qq;
cout<<ans<<" ";
}
cout<<endl;
return;
}
int main()
{
fast;
ll tc = 1;
IN tc;
while (tc--)
{
solve();
}
return 0;
}
| 13 |
CPP
|
####################################################
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#######################################
from collections import defaultdict as dd
from bisect import bisect_left
for t in range(int(input())):
n,m=map(int,input().split())
l=list(map(int,input().split()))
q=list(map(int,input().split()))
b=sum(l)
d=dd(list)
a=0
x=0
c=0
for i in range(n):
c+=l[i]
d[c].append(i)
if c>a:
a=c
x=i
l1=[]
for i in d:
l1.append(i)
l1.sort()
y=n
l2=[n]*len(l1)
for i in range(len(l1)-1,-1,-1):
for j in d[l1[i]]:
y=min(y,j)
l2[i]=y
ans=[-1]*m
for i in range(m):
if a<q[i] and b<=0:
continue
if q[i]<=a:
ans[i]=l2[bisect_left(l1,q[i])]
else:
c=q[i]-a
e=c//b
f=c%b
if not f:
ans[i]=e*n+x
else:
p=b*(e+1)
r=(q[i]-p)
z=bisect_left(l1,r)
if z!=len(l1):
x1=(e+1)*n+l2[z]
else:
x1=10**18
e=q[i]//b
f=q[i]%b
if not f:
ans[i]=e*n-1
else:
z=bisect_left(l1,f)
ans[i]=min(x1,e*n+l2[z])
p=b*(e-1)
r=q[i]-p
z=bisect_left(l1,r)
if z!=len(l1):
x1=(e-1)*n+l2[z]
else:
x1=10**18
while ans[i]>x1 and q[i]-b*(e-1)<=a:
e-=1
p=b*(e-1)
r=q[i]-p
z=bisect_left(l1,r)
if z!=len(l1):
x1=(e-1)*n+l2[z]
ans[i]=min(ans[i],x1)
print(*ans)
| 13 |
PYTHON3
|
import heapq
def solve(n, a, x):
delta = sum(a)
if delta <= 0:
q = []
for i in range(len(x)):
heapq.heappush(q, (x[i], i))
s = 0
res = [-1] * len(x)
for i in range(n):
s += a[i]
while q and s >= q[0][0]:
res[q[0][1]] = i
heapq.heappop(q)
return res
mx = None
s = 0
for i in range(n):
s += a[i]
if mx is None or mx < s:
mx = s
offset = [0] * len(x)
for i in range(len(x)):
laps = (max(0, x[i] - mx) + delta - 1) // delta
offset[i] = laps * n
x[i] -= laps * delta
q = []
for i in range(len(x)):
heapq.heappush(q, (x[i], i))
s = 0
res = [-1] * len(x)
for i in range(n):
s += a[i]
while q and s >= q[0][0]:
res[q[0][1]] = i + offset[q[0][1]]
heapq.heappop(q)
return res
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
a = list(map(int, input().split()))
x = list(map(int, input().split()))
print(*solve(n, a, x))
| 13 |
PYTHON3
|
from collections import defaultdict
from itertools import accumulate
import sys
import bisect
input = sys.stdin.readline
'''
for CASES in range(int(input())):
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
sys.stdout.write(" ".join(map(str,ANS))+"\n")
'''
inf = 100000000000000000 # 1e17
mod = 998244353
for CASES in range(int(input())):
n, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
S=[0]
for a in A:
S.append(S[-1]+a)
S1=S.copy()
for i in range(1,len(S1)):
S1[i]=max(S1[i-1],S1[i])
# print(S)
MAX=max(S1)
ACU=S[-1]
for que in B:
times=0
if que>MAX and ACU<=0:
print(-1,end=" ")
continue
elif que>MAX and ACU>0:
times=(que-MAX+ACU-1)//ACU
print(times*n+bisect.bisect_left(S1,que-times*ACU)-1,end=" ")
print()
| 13 |
PYTHON3
|
from math import ceil
def bina(a):
global array
low,high = 0,len(array)
while low<high:
mid = low+((high-low)//2)
if array[mid]>=a:
high = mid
else:
low = mid+1
return high
for _ in range(int(input())):
global array
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mx = float("-inf")
s = 0
array = []
for i in a:
s+=i
mx = max(mx,s)
array.append(mx)
for i in range(m):
x = b[i]
if s<=0:
if x>mx:
print(-1,end = " ")
else:
print(bina(x),end = " ")
else:
sub = max(0,ceil((x-mx)/s))
print(n*sub + bina(x-(s*sub)),end = " ")
print()
| 13 |
PYTHON3
|
import sys
input = sys.stdin.readline
from collections import Counter
from itertools import accumulate
import bisect
for _ in range(int(input())):
n, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
pre = 0
cur = 0
C = [(0, -1)]
for i, a in enumerate(A):
cur += a
if cur > pre:
C.append((cur, i))
pre = cur
maxv = C[-1][0]
ans = [-1] * m
if not maxv:
print(*ans)
continue
for i, b in enumerate(B):
if b <= maxv:
idx = bisect.bisect_left(C, (b, -1))
ans[i] = C[idx][1]
else:
if cur <= 0: continue
rem = b - maxv
k = (rem + cur - 1) // cur
b -= k * cur
idx = bisect.bisect_left(C, (b, -1))
ans[i] = C[idx][1] + k * n
print(*ans)
| 13 |
PYTHON3
|
from bisect import bisect_left
for i in range(int(input())):
n, m = map(int,input().split());a = list(map(int,input().split()));p = [0]*(n+1);M = [0]*(n+1)
for i in range(n):p[i+1] = p[i] + a[i];M[i+1] = max(M[i], p[i+1])
s = p[-1];ans = []
for x in map(int,input().split()):
r = 0
if s > 0:t = max((x-M[-1]+s-1)//s,0);r += t*n;x -= t*s
if x > M[-1]:ans.append('-1')
else:
pos = bisect_left(M,x)
ans.append(str(r + pos - 1))
print(' '.join(ans))
| 13 |
PYTHON3
|
from bisect import bisect_left
import math
def main():
cases = int(input())
ans_list = []
for _ in range(cases):
n, m = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
x = list(map(int, input().split(' ')))
sums = []
cur = 0
max_sum = float('-inf')
for val in a:
cur += val
sums.append(cur)
max_sum = max(max_sum, cur)
cycle_sum = sums[-1]
sums = [(val, i) for i, val in enumerate(sums)]
sums.sort()
sorted_sums, indices = [], []
min_idx = float('inf')
for (cur_sum, idx) in sums:
sorted_sums.append(cur_sum)
for (cur_sum, idx) in reversed(sums):
min_idx = min(min_idx, idx)
indices.append(min_idx)
indices = indices[::-1]
query_answers = []
for q in x:
if q <= max_sum:
search_idx = bisect_left(sorted_sums, q)
query_answers.append(indices[search_idx])
elif cycle_sum <= 0:
query_answers.append(-1)
else:
cycles_required = int(math.ceil((q-max_sum)/cycle_sum))
search_idx = bisect_left(sorted_sums, q - cycles_required * cycle_sum)
query_answers.append(indices[search_idx] + cycles_required * n)
ans_list.append(' '.join(map(str, query_answers)))
print('\n'.join(ans_list))
# region fastio
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
| 13 |
PYTHON3
|
import os
import sys
from io import BytesIO, IOBase
import math
import itertools
import bisect
import heapq
def main():
pass
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def binary(n):
return (bin(n).replace("0b", ""))
def decimal(s):
return (int(s, 2))
def pow2(n):
p = 0
while (n > 1):
n //= 2
p += 1
return (p)
def primeFactors(n):
l = []
while n % 2 == 0:
l.append(2)
n = n / 2
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
l.append(i)
n = n / i
if n > 2:
l.append(int(n))
return (l)
def isPrime(n):
if (n == 1):
return (False)
else:
root = int(n ** 0.5)
root += 1
for i in range(2, root):
if (n % i == 0):
return (False)
return (True)
def maxPrimeFactors(n):
maxPrime = -1
while n % 2 == 0:
maxPrime = 2
n >>= 1
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
maxPrime = i
n = n / i
if n > 2:
maxPrime = n
return int(maxPrime)
def countcon(s, i):
c = 0
ch = s[i]
for i in range(i, len(s)):
if (s[i] == ch):
c += 1
else:
break
return (c)
def lis(arr):
n = len(arr)
lis = [1] * n
for i in range(1, n):
for j in range(0, i):
if arr[i] > arr[j] and lis[i] < lis[j] + 1:
lis[i] = lis[j] + 1
maximum = 0
for i in range(n):
maximum = max(maximum, lis[i])
return maximum
def isSubSequence(str1, str2):
m = len(str1)
n = len(str2)
j = 0
i = 0
while j < m and i < n:
if str1[j] == str2[i]:
j = j + 1
i = i + 1
return j == m
def maxfac(n):
root = int(n ** 0.5)
for i in range(2, root + 1):
if (n % i == 0):
return (n // i)
return (n)
def p2(n):
c=0
while(n%2==0):
n//=2
c+=1
return c
def seive(n):
primes=[True]*(n+1)
primes[1]=primes[0]=False
for i in range(2,n+1):
if(primes[i]):
for j in range(i+i,n+1,i):
primes[j]=False
p=[]
for i in range(0,n+1):
if(primes[i]):
p.append(i)
return(p)
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def denofactinverse(n,m):
fac=1
for i in range(1,n+1):
fac=(fac*i)%m
return (pow(fac,m-2,m))
def numofact(n,m):
fac = 1
for i in range(1, n + 1):
fac = (fac * i) % m
return(fac)
for xyz in range(0,int(input())):
n,m=map(int,input().split())
l=list(map(int,input().split()))
pre=[0]
reqpre=[0]
for i in l:
pre.append(pre[-1]+i)
reqpre.append(max(reqpre[-1],pre[-1]))
x=list(map(int,input().split()))
ans=[]
#print(pre)
#print(reqpre)
for i in x:
ca=0
if(0>=pre[-1] and i>reqpre[-1]):
ans.append(-1)
else:
if(pre[-1]!=0 and reqpre[-1]<i):
cycles=max(0,(i-reqpre[-1]+pre[-1]-1)//pre[-1])
else:
cycles=0
ca+=cycles*n
i-=cycles*pre[-1]
pos=bisect.bisect_left(reqpre,i)
ca+=pos-1
ans.append(ca)
print(*ans)
| 13 |
PYTHON3
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long int LL;
typedef pair<LL,LL> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;
void array_show(int *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
namespace sol{
void init(){
}
void solve(){
int n,m;
int i,j,k;
LL a,b,c;
LL x,y;
vector<LL> v1,vs;
vector<P> va;
cin>>n>>m;
b=0;
va.push_back(make_pair(0,-1));
for(i=0;i<n;i++){
cin>>a;
v1.push_back(a);
b+=a;
if(va.back().first<b)va.push_back(make_pair(b,i));
}
for(i=0;i<m;i++){
cin>>a;
LL s=-1;
auto itr=lower_bound(va.begin(),va.end(),make_pair(a,-2LL));
if(itr==va.end()){
if(b<=0){
vs.push_back(-1);
continue;
}
x=(a-va.back().first-1)/b+1;
s+=x*n,a-=x*b;
if(a<=0){
vs.push_back(s);
continue;
}
itr=lower_bound(va.begin(),va.end(),make_pair(a,-2LL));
}
assert(itr!=va.end());
s+=itr->second+1;
vs.push_back(s);
}
for(i=0;i<m;i++){
if(i)cout<<" ";
cout<<vs[i];
}
cout<<endl;
}
}
int main(){
int n,i;
sol::init();
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
for(i=0;i<n;i++){
sol::solve();
}
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=2e9;
const int maxn=2e5+10;
int t,n,m;
ll tot;
ll a[maxn],sum[maxn];
ll tw[maxn];
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
cin>>t;
while (t--)
{
cin>>n>>m;tot=0;tw[0]=-inf;
for (int i=1;i<=n;i++)
{
cin>>a[i];
tot+=a[i];
sum[i]=sum[i-1]+a[i];
tw[i]=max(tw[i-1],sum[i]);
}
for (int i=1;i<=m;i++)
{
int x;cin>>x;
if (tw[n]<x && sum[n]<=0) {cout<<-1<<' ';continue;}
ll res=0;
if (x<=tw[n]) res+=lower_bound(tw+1,tw+n+1,x)-tw;
else
{
res=(x-tw[n]+sum[n]-1)/sum[n];x-=res*sum[n];
res*=n;
res+=lower_bound(tw+1,tw+n+1,x)-tw;
}
cout<<res-1<<' ';
}
cout<<endl;
for (int i=1;i<=n;i++) a[i]=sum[i]=tw[i]=0;
}
return 0;
}
| 13 |
CPP
|
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
from math import inf, log2
class SegmentTree:
def __init__(self, array, func=max):
self.n = len(array)
self.size = 2**(int(log2(self.n-1))+1) if self.n != 1 else 1
self.func = func
self.default = 0 if self.func != min else inf
self.data = [self.default] * (2 * self.size)
self.process(array)
def process(self, array):
self.data[self.size : self.size+self.n] = array
for i in range(self.size-1, -1, -1):
self.data[i] = self.func(self.data[2*i], self.data[2*i+1])
def query(self, alpha, omega):
"""Returns the result of function over the range (inclusive)!"""
if alpha == omega:
return self.data[alpha + self.size]
res = self.default
alpha += self.size
omega += self.size + 1
while alpha < omega:
if alpha & 1:
res = self.func(res, self.data[alpha])
alpha += 1
if omega & 1:
omega -= 1
res = self.func(res, self.data[omega])
alpha >>= 1
omega >>= 1
return res
def update(self, index, value):
"""Updates the element at index to given value!"""
index += self.size
self.data[index] = value
index >>= 1
while index:
self.data[index] = self.func(self.data[2*index], self.data[2*index+1])
index >>= 1
# ------------------- fast io --------------------
from math import gcd, ceil
def prod(a, mod=10**9+7):
ans = 1
for each in a:
ans = (ans * each) % mod
return ans
def lcm(a, b): return a * b // gcd(a, b)
def binary(x, length=16):
y = bin(x)[2:]
return y if len(y) >= length else "0" * (length - len(y)) + y
class Node:
def __init__(self, v):
self.value = v
self.left = None
self.right = None
for _ in range(int(input()) if True else 1):
#n = int(input())
n, m = map(int, input().split())
#a, b = map(int, input().split())
#c, d = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
#s = input()
mx = max(a)
sm = sum(a)
vals = []
ans = a[0]
vals += [ans]
for i in range(1, n):
ans += a[i]
vals += [max(ans, vals[-1])]
ans = []
for x in b:
if sm <= 0 and x > vals[-1]:
ans += [-1]
continue
rotations = 0
if sm > 0:
rotations = max(int((x-vals[-1]) / sm)-2, 0) if sm else 0
alpha, omega = 0, n-1
if sm > 0:
x -= rotations * sm
while x > vals[-1]:
rotations += 1
x -= sm
else:
rotations = 0
while alpha < omega:
mid = (alpha + omega) // 2
if vals[mid] >= x:
omega = mid
else:
alpha = mid + 1
ans += [rotations*n + alpha]
print(*ans)
| 13 |
PYTHON3
|
#include <iostream>
#include <vector>
using namespace std;
class MergeSortTree {
private:
int n;
vector<vector<long long> > t;
inline int left(int i) {return i << 1;}
inline int right(int i) {return (i << 1) + 1;}
void merge(int idx) {
const vector<long long> &a = t[left(idx)];
const vector<long long> &b = t[right(idx)];
vector<long long> &merge_arr = t[idx];
merge_arr.resize(a.size() + b.size());
int ia = 0, ib = 0, i = 0;
while(ia < a.size() || ib < b.size()) {
if(ib == b.size()) merge_arr[i ++] = a[ia ++];
else if(ia == a.size()) merge_arr[i ++] = b[ib ++];
else {
if(a[ia] <= b[ib]) merge_arr[i ++] = a[ia ++];
else merge_arr[i ++] = b[ib ++];
}
}
}
void build_tree(const vector<long long> &a, int low, int high, int idx) {
if(low == high) {
t[idx].push_back(a[low]);
return;
}
int mid = (low + high) >> 1;
build_tree(a, low, mid, left(idx));
build_tree(a, mid + 1, high, right(idx));
merge(idx);
}
int get_leftmost_geq_idx(long long x, int low, int high, int idx) {
if(low == high) {
if(t[idx][0] >= x) return low;
else return -1;
}
int mid = (low + high) >> 1;
if(t[left(idx)].back() >= x)
return get_leftmost_geq_idx(x, low, mid, left(idx));
else
return get_leftmost_geq_idx(x, mid + 1, high, right(idx));
}
public:
MergeSortTree(const vector<long long> &a):
n(a.size()), t(4 * n) {build_tree(a, 0, n - 1, 1);}
inline int get_leftmost_geq_idx(long long x) {
return get_leftmost_geq_idx(x, 0, n - 1, 1);
}
};
inline void enable_fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void read_input(vector<long long> &prefix_sum, int &m) {
int n;
cin >> n >> m;
prefix_sum.resize(n);
cin >> prefix_sum[0];
for(int i = 1;i < n;i++) {
int x;
cin >> x;
prefix_sum[i] = prefix_sum[i - 1] + x;
}
}
inline long long ceil_div(long long a, long long b) {
return (a + b - 1) / b;
}
void solve_queries(const vector<long long> &prefix_sum, int &m) {
int n = prefix_sum.size();
MergeSortTree merge_sort_tree(prefix_sum);
long long max_prefix_sum = prefix_sum[0];
for(int i = 1;i < n;i++)
max_prefix_sum = max(max_prefix_sum, prefix_sum[i]);
long long total_sum = prefix_sum.back();
while(m --) {
long long x;
cin >> x;
long long num_seconds;
if(total_sum <= 0 || x <= max_prefix_sum || x < 0)
num_seconds = merge_sort_tree.get_leftmost_geq_idx(x);
else {
long long num_times = ceil_div(x - max_prefix_sum, total_sum);
x -= num_times * total_sum;
num_seconds = num_times * n + merge_sort_tree.get_leftmost_geq_idx(x);
}
printf("%lld ", num_seconds);
}
printf("\n");
}
int main() {
enable_fast_io();
int t;
cin >> t;
while(t --) {
vector<long long> prefix_sum;
int m;
read_input(prefix_sum, m);
solve_queries(prefix_sum, m);
}
return 0;
}
| 13 |
CPP
|
from collections import defaultdict,OrderedDict,Counter
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
# import numpy as np
from queue import Queue,PriorityQueue
from heapq import heapify,heappop,heappush
from statistics import median,mean
from math import gcd,sqrt,floor,factorial,ceil,log2,log10,log
import fractions
import copy
from copy import deepcopy
import sys
import io
# sys.setrecursionlimit(10**8)
import math
import os
import bisect
import collections
mod=pow(10,9)+7
import random
from random import random,randint,randrange
from time import time;
def ncr(n, r, p=mod):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def normalncr(n,r):
r=min(r,n-r)
count=1;
for i in range(n-r,n+1):
count*=i;
for i in range(1,r+1):
count//=i;
return count
inf=float("inf")
adj=defaultdict(set)
visited=defaultdict(int)
def addedge(a,b):
adj[a].add(b)
adj[b].add(a)
def bfs(v):
q=Queue()
q.put(v)
visited[v]=1
while q.qsize()>0:
s=q.get_nowait()
print(s)
for i in adj[s]:
if visited[i]==0:
q.put(i)
visited[i]=1
def dfs(v,visited):
if visited[v]==1:
return;
visited[v]=1
print(v)
for i in adj[v]:
dfs(i,visited)
# a9=pow(10,6)+10
# prime = [True for i in range(a9 + 1)]
# def SieveOfEratosthenes(n):
# p = 2
# while (p * p <= n):
# if (prime[p] == True):
# for i in range(p * p, n + 1, p):
# prime[i] = False
# p += 1
# SieveOfEratosthenes(a9)
# prime_number=[]
# for i in range(2,a9):
# if prime[i]:
# prime_number.append(i)
def reverse_bisect_right(a, x, lo=0, hi=None):
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if x > a[mid]:
hi = mid
else:
lo = mid+1
return lo
def reverse_bisect_left(a, x, lo=0, hi=None):
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if x >= a[mid]:
hi = mid
else:
lo = mid+1
return lo
def get_list():
return list(map(int,input().split()))
def get_str_list_in_int():
return [int(i) for i in list(input())]
def get_str_list():
return list(input())
def get_map():
return map(int,input().split())
def input_int():
return int(input())
def matrix(a,b):
return [[0 for i in range(b)] for j in range(a)]
def swap(a,b):
return b,a
def find_gcd(l):
a=l[0]
for i in range(len(l)):
a=gcd(a,l[i])
return a;
def is_prime(n):
sqrta=int(sqrt(n))
for i in range(2,sqrta+1):
if n%i==0:
return 0;
return 1;
def prime_factors(n):
sqrta = int(sqrt(n))
for i in range(2,sqrta+1):
if n%i==0:
return [i]+prime_factors(n//i)
return [n]
def p(a):
if type(a)==str:
print(a+"\n")
else:
print(str(a)+"\n")
def ps(a):
if type(a)==str:
print(a)
else:
print(str(a))
def kth_no_not_div_by_n(n,k):
return k+(k-1)//(n-1)
nc="NO"
yc="YES"
ns="No"
ys="Yes"
# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
# input=stdin.readline
# print=stdout.write
t=int(input())
for i in range(t):
n,m=get_map();
a=get_list();
x=get_list();
suma=sum(a)
prefix=[0 for i in range(n)]
maxa=[0 for i in range(n)]
for i in range(n):
prefix[i]=a[i]
maxa[i]=prefix[i]
if i:
prefix[i]+=prefix[i-1]
maxa[i]=max(prefix[i],maxa[i-1])
if suma<=0:
for i in x:
if i>maxa[-1]:
print(-1,end=" ")
else:
print(bisect_left(maxa,i),end=" ")
else:
for i in x:
count=0;
if i>maxa[-1]:
count=ceil((i-maxa[-1])/(suma))
i=i-count*suma
print(count*n+bisect_left(maxa,i),end=" ")
print('')
# 1
# 2 2
# 2 -1
# 2 1
# 1
# 9 5
# 5 5 5 5 5 -5 -5 -5 -5
# 26 27 28 29 30
# 45 45 45 45 45
| 13 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 200010;
int n, m;
LL a[N], s[N];
//
int cnt;
LL val[N];
int id[N];
//
LL ans[N];
void solve()
{
//printf("one Test\n");
//input
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]), s[i] = s[i - 1] + a[i];
//pre
cnt = 0;
for (int i = 1; i <= n; ++i)
if (s[i] > val[cnt])
id[++cnt] = i, val[cnt] = s[i];
//debug1
/*
printf("cnt=%d\nval : ", cnt);
for (int i = 1; i <= cnt; ++i)
printf("%lld ", val[i]);
printf("\n");
*/
//solve
for (int i = 1; i <= m; ++i) {
ans[i] = -1;
LL x;
scanf("%lld", &x);
if (cnt == 0) continue;
if (x <= val[cnt]) {
int k = lower_bound(val + 1, val + cnt + 1, x) - val;
ans[i] += id[k];
continue;
}
if (s[n] <= 0) continue;
LL tmp = (x - val[cnt] + s[n] - 1) / s[n];
ans[i] += n * tmp, x -= s[n] * tmp;
//while (x > val[cnt]) ans[i] += n, x -= s[n];
int k = lower_bound(val + 1, val + cnt + 1, x) - val;
ans[i] += id[k];
}
//output
//printf("ans:");
for (int i = 1; i < m; ++i)
printf("%lld ", ans[i]);
printf("%lld\n", ans[m]);
}
int main()
{
int T;
scanf("%d", &T);
while (T--) {
solve();
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
#include <unordered_map>
//Author: Maximilian Paris
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> prefix_sorted;
ll compare = 1e18;
struct sort_pred {
bool operator()(const std::pair<int, int>& left, const std::pair<int, int>& right) {
return left.second < right.second;
}
};
int main() {
int t; cin >> t;
while (t--) {
ll ans = 0;
int n, m;
cin >> n >> m;
prefix_sorted = vector<pair<ll, ll>>(n);
vector<ll> prefix(n) ;
ll max_sum = 0;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (i > 0)
prefix_sorted[i] = { x + prefix_sorted[i - 1].first,i}, prefix[i]= prefix_sorted[i].first;
else prefix_sorted[i] = {x,i }, prefix[i] = prefix_sorted[i].first;
max_sum = max(max_sum, prefix_sorted[i].first);
}
vector<ll> X(m);
for (int i = 0; i < m; i++)cin >> X[i];
int size_arr = n;
ll max_prefix = prefix_sorted[n - 1].first;
sort(prefix_sorted.begin(), prefix_sorted.end());
unordered_map<ll, ll> pos;
int j = 0;
for (int i = 0; i < n; i++) {
while (true) {
if (pos[prefix_sorted[i].first] == 0 && prefix_sorted[i].first <= prefix[j])
{
pos[prefix_sorted[i].first] = j + 1; break;
}
else if(prefix_sorted[i].first > prefix[j])j++;
else { break; }
}
}
for (int i = 0; i < m; i++) {
if (X[i] > max_sum && max_prefix <= 0)
cout << -1 << " ";
else if (X[i] <= max_sum) {
// int to = 0;
pair<ll, ll> b = { X[i],0};
int to=lower_bound(prefix_sorted.begin(), prefix_sorted.end(), b)- prefix_sorted.begin();
// for (int j = to; j < n; j++)ans = min(ans, prefix_sorted[j].second);
cout << pos[prefix_sorted[to].first]-1 << " ";
}
else {
ll cnt= (ll(ceil((double(X[i] - max_sum)) / double(max_prefix))));
ll check = X[i] - cnt* max_prefix; pair<ll, ll> b = {check,0 };
int k = lower_bound(prefix_sorted.begin(), prefix_sorted.end(), b) - prefix_sorted.begin();
//for (int j = k; j < n; j++)val = min(val, prefix_sorted[j].second);
ll ans = pos[prefix_sorted[k].first]-1 +cnt* size_arr;
// for (int j = 0; j < n; j++) {
// ans = min(ans, (ll(ceil((double(X[i] - prefix[j]))/double(max_prefix))))* size_arr +j);
// }
cout << ans<< " ";
}
}
cout << endl;
}
return 0x0;
}
| 13 |
CPP
|
from collections import defaultdict,OrderedDict,Counter
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
# import numpy as np
from queue import Queue,PriorityQueue
from heapq import heapify,heappop,heappush
from statistics import median,mean
from math import gcd,sqrt,floor,factorial,ceil,log2,log10,log
import fractions
import copy
from copy import deepcopy
import sys
import io
sys.setrecursionlimit(10**8)
import math
import os
import bisect
import collections
mod=pow(10,9)+7
import random
from random import random,randint,randrange
from time import time;
def ncr(n, r, p=mod):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def normalncr(n,r):
r=min(r,n-r)
count=1;
for i in range(n-r,n+1):
count*=i;
for i in range(1,r+1):
count//=i;
return count
inf=float("inf")
adj=defaultdict(set)
visited=defaultdict(int)
def addedge(a,b):
adj[a].add(b)
adj[b].add(a)
def bfs(v):
q=Queue()
q.put(v)
visited[v]=1
while q.qsize()>0:
s=q.get_nowait()
print(s)
for i in adj[s]:
if visited[i]==0:
q.put(i)
visited[i]=1
def dfs(v,visited):
if visited[v]==1:
return;
visited[v]=1
print(v)
for i in adj[v]:
dfs(i,visited)
# a9=pow(10,6)+10
# prime = [True for i in range(a9 + 1)]
# def SieveOfEratosthenes(n):
# p = 2
# while (p * p <= n):
# if (prime[p] == True):
# for i in range(p * p, n + 1, p):
# prime[i] = False
# p += 1
# SieveOfEratosthenes(a9)
# prime_number=[]
# for i in range(2,a9):
# if prime[i]:
# prime_number.append(i)
def reverse_bisect_right(a, x, lo=0, hi=None):
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if x > a[mid]:
hi = mid
else:
lo = mid+1
return lo
def reverse_bisect_left(a, x, lo=0, hi=None):
if lo < 0:
raise ValueError('lo must be non-negative')
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if x >= a[mid]:
hi = mid
else:
lo = mid+1
return lo
def get_list():
return list(map(int,input().split()))
def get_str_list_in_int():
return [int(i) for i in list(input())]
def get_str_list():
return list(input())
def get_map():
return map(int,input().split())
def input_int():
return int(input())
def matrix(a,b):
return [[0 for i in range(b)] for j in range(a)]
def swap(a,b):
return b,a
def find_gcd(l):
a=l[0]
for i in range(len(l)):
a=gcd(a,l[i])
return a;
def is_prime(n):
sqrta=int(sqrt(n))
for i in range(2,sqrta+1):
if n%i==0:
return 0;
return 1;
def prime_factors(n):
sqrta = int(sqrt(n))
for i in range(2,sqrta+1):
if n%i==0:
return [i]+prime_factors(n//i)
return [n]
def p(a):
if type(a)==str:
print(a+"\n")
else:
print(str(a)+"\n")
def ps(a):
if type(a)==str:
print(a)
else:
print(str(a))
def kth_no_not_div_by_n(n,k):
return k+(k-1)//(n-1)
nc="NO"
yc="YES"
ns="No"
ys="Yes"
# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
# input=stdin.readline
# print=stdout.write
t=int(input())
for i in range(t):
n,m=get_map();
a=get_list();
x=get_list();
suma=sum(a)
prefix=[0 for i in range(n)]
maxa=[0 for i in range(n)]
for i in range(n):
prefix[i]=a[i]
maxa[i]=prefix[i]
if i:
prefix[i]+=prefix[i-1]
maxa[i]=max(prefix[i],maxa[i-1])
if suma<=0:
for i in x:
if i>maxa[-1]:
print(-1,end=" ")
else:
print(bisect_left(maxa,i),end=" ")
else:
for i in x:
count=0;
if i>maxa[-1]:
count=ceil((i-maxa[-1])/(suma))
i=i-count*suma
print(count*n+bisect_left(maxa,i),end=" ")
print('')
# 1
# 2 2
# 2 -1
# 2 1
# 1
# 9 5
# 5 5 5 5 5 -5 -5 -5 -5
# 26 27 28 29 30
# 45 45 45 45 45
| 13 |
PYTHON3
|
import math,sys,bisect,heapq,os
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
from functools import lru_cache
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
def input(): return sys.stdin.readline().rstrip('\r\n')
#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
aj = lambda: list(map(int, input().split()))
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#MOD = 1000000000 + 7
def Y(c): print(["NO","YES"][c])
def y(c): print(["no","yes"][c])
def Yy(c): print(["No","Yes"][c])
def solve():
for _ in range(int(input())):
n,m= aj()
A = aj()
x = aj()
# print(A,x)
A = [0] + list(accumulate(A))
C = [0]
for i in range(1,len(A)):
C.append(max(C[-1],A[i]))
# print(C)
m = C[-1]
s = A[-1]
Ans = []
if m == 0:
Ans = [-1]*len(x)
else:
for i in x:
if i > m and s <= 0:
Ans.append(-1)
else:
a = 0
if s > 0 and i > m:
a += (i - m + s - 1)//s
k = bisect.bisect_left(C,i - a*s)
Ans.append(a*n + k - 1)
print(*Ans)
try:
#os.system("online_judge.py")
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
solve()
| 13 |
PYTHON3
|
#include<bits/stdc++.h>
#define read(arr, n) vector<int> arr(n); for(int i=0; i<n; i++) cin>>arr[i];
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fr(i, m, n) for(int i=m;i<n;i++)
#define frr(i, a, b) for(int i=a; i>b; i--)
#define w(tt) int tt; cin>>tt; while(tt--)
#define w1(tt) if(true)
#define vi(ty) vector<ty>
#define vvi(ty) vector<vector<ty>>
#define umap(ty) unordered_map<ty, ty>
#define umapp(ty, tyy) unordered_map<ty, tyy>
#define pii pair<int, int>
#define ll long long int
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define len(x) x.size()
#define pb push_back
#define F first
#define S second
#define I insert
#define mod 1000000007
using namespace std;
void file(){
#ifndef ONTLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void solve() // return 1 -> it did it's purpose properly.
{
ll n, q, cnt = 0, maxi = INT_MIN, prev = -1; cin>>n>>q;
map<ll, ll> hash;
fr(i, 0, n)
{
ll x; cin>>x; cnt += x;
if(cnt >= 0 && cnt > prev)
{hash[cnt] = i; prev = cnt;}
}
maxi = prev;
ll query[q];
fr(i, 0, q) cin>>query[i];
fr(i, 0, q)
{
ll x = query[i];
auto it = hash.lower_bound(x);
if(it != hash.end())
{
//cout << "&";
cout << it->S <<" ";
}
else if( it == hash.end() && cnt > 0)
{
ll temp = x - maxi;
ll t = ceil(temp/(cnt*1.0));
temp = x - t*cnt;
it = hash.lower_bound(temp);
//if(it==hash.end())
// cout<<"^"<<it->S<<"^";
cout << it->S + t*n << " ";
}
else
{cout<<-1<<" ";}
}
cout<<endl;
}
int main(){
fastio //file();
w(tt){
solve();
}
}
// -1 -1
// 1 1
| 13 |
CPP
|
import bisect
for _ in range(int(input())):
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dp = [0]*n
check_point = []
cnt = 0
for i in range(n):
if i==0:
dp[i] = a[i]
else:
dp[i] = dp[i-1] + a[i]
if cnt==0 and dp[i]>0:
check_point.append((dp[i], i))
cnt += 1
elif cnt!=0 and dp[i]>check_point[cnt-1][0]:
check_point.append((dp[i], i))
cnt += 1
for i in range(m):
ans = -1
if cnt!= 0:
if b[i]>check_point[cnt-1][0] and dp[n-1]>0:
tmp = b[i]
tmp -= check_point[cnt-1][0]
if tmp%dp[n-1] == 0:
ans = (tmp//dp[n-1])*n + check_point[cnt-1][1]
else:
to_find = b[i] - ((tmp//dp[n-1])+1)*dp[n-1]
pos = bisect.bisect_left(check_point, (to_find, 0))
ans = (tmp//dp[n-1] + 1)*n + check_point[pos][1]
elif b[i]>check_point[cnt-1][0]:
ans = -1
else:
pos = bisect.bisect_left(check_point, (b[i], 0))
ans = check_point[pos][1]
print(ans, end=' ')
print()
| 13 |
PYTHON3
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int inf=1000000000;
int g[300000],q[300000],w[300000];
long long h[300000],v[300000];
int i,k,m,n,o,t,l,r,mid;
long long M;
inline bool cmp(int x,int y)
{
return q[x]<q[y];
}
int main()
{
scanf("%d",&t);
for (o=1;o<=t;o++)
{
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
scanf("%d",&g[i]),h[i]=h[i-1]+g[i];
M=g[1];
for (i=1;i<=n;i++)
M=max(M,h[i]);
for (i=1;i<=m;i++)
scanf("%d",&q[i]),w[i]=i;
memset(v,0,sizeof(v));
if (h[n]>0)
for (i=1;i<=m;i++)
if (q[i]>M)
{
l=1,r=inf;
while (l<r)
{
mid=(l+r)/2;
if (q[i]-1LL*mid*h[n]<=M)
r=mid;
else
l=mid+1;
}
q[i]=q[i]-1LL*l*h[n];
v[i]=v[i]+1LL*l*n;
}
sort(w+1,w+m+1,cmp);
for (i=1,k=1;i<=m;i++)
if (q[w[i]]<=M)
{
while (h[k]<q[w[i]])
k++;
v[w[i]]=v[w[i]]+k-1;
}
else
v[w[i]]=-1;
for (i=1;i<=m;i++)
printf("%lld ",v[i]);
printf("\n");
}
return 0;
}
| 13 |
CPP
|
import sys
import math
import collections
import bisect
import itertools
import decimal
import heapq
# sys.setrecursionlimit(10000001)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))
def flush(): return sys.stdout.flush()
def nicf(): return int(sys.stdin.readline())
def nscf(): return map(int, sys.stdin.readline().split())
def nacf(): return list(map(int, sys.stdin.readline().split()))
def na1cf(): return list(map(lambda x: int(x)-1, sys.stdin.readline().split()))
# ===CODE==
def solve():
n, m = ns()
ta = na()
x = na()
a = []
mx = -1
total = 0
for i, ai in enumerate(ta):
total += ai
mx = max(mx, total)
a.append([total, i])
a.sort()
aval = [a0 for a0, a1 in a]
aidx = [a1 for a0, a1 in a]
mnidx = [-1]*n
for i in range(n-1, -1, -1):
if i == n-1:
mnidx[i] = aidx[i]
else:
mnidx[i] = min(mnidx[i+1], aidx[i])
res = []
for xi in x:
if xi <= mx:
idx = bisect.bisect_left(aval, xi)
res.append(mnidx[idx])
continue
if total <= 0:
res.append(-1)
continue
cycle = (xi-mx-1)//total+1
txi = xi-cycle*total
idx = bisect.bisect_left(aval, txi)
res.append(cycle*n+mnidx[idx])
print(*res)
def main():
t = ni()
for ti in range(t):
solve()
if __name__ == '__main__':
main()
| 13 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
int main()
{
int t; scanf("%d",&t);
while(t--)
{
int n,m; scanf("%d %d",&n,&m);
ll a[n]; for(int i=0;i<n;i++) scanf("%lld",&a[i]);
int b[m]; for(int i=0;i<m;i++) scanf("%d",&b[i]);
vector<ll>v;
vector<int>v1;
ll sum=a[0]; v.push_back(a[0]); v1.push_back(1);
ll prev=a[0]; ll y=a[0];
for(int i=1;i<n;i++){
sum+=a[i];
if(i==n-1) y=sum;
if(sum>prev){
v.push_back(sum);
v1.push_back(i+1);
prev=sum;
}
}
ll maxx=v[v.size()-1];
for(int i=0;i<m;i++)
{
if(b[i]<=maxx)
{
int c=lower_bound(v.begin(),v.end(),b[i])-v.begin();
printf("%d ",v1[c]-1);
}
else if(y>0){
int x=b[i]-((b[i]-maxx+y-1)/y)*y;
int c=lower_bound(v.begin(),v.end(),x)-v.begin();
ll ans=((b[i]-maxx+y-1)/y)*n+v1[c]-1;
printf("%lld ",ans);
}
else printf("-1 ");
}
printf("\n");
}
}
| 13 |
CPP
|
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
# ------------------------------warmup----------------------------
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# -------------------game starts now----------------------------------------------------import math
class TreeNode:
def __init__(self, k, v):
self.key = k
self.value = v
self.left = None
self.right = None
self.parent = None
self.height = 1
self.num_left = 1
self.num_total = 1
class AvlTree:
def __init__(self):
self._tree = None
def add(self, k, v):
if not self._tree:
self._tree = TreeNode(k, v)
return
node = self._add(k, v)
if node:
self._rebalance(node)
def _add(self, k, v):
node = self._tree
while node:
if k < node.key:
if node.left:
node = node.left
else:
node.left = TreeNode(k, v)
node.left.parent = node
return node.left
elif node.key < k:
if node.right:
node = node.right
else:
node.right = TreeNode(k, v)
node.right.parent = node
return node.right
else:
node.value = v
return
@staticmethod
def get_height(x):
return x.height if x else 0
@staticmethod
def get_num_total(x):
return x.num_total if x else 0
def _rebalance(self, node):
n = node
while n:
lh = self.get_height(n.left)
rh = self.get_height(n.right)
n.height = max(lh, rh) + 1
balance_factor = lh - rh
n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
n.num_left = 1 + self.get_num_total(n.left)
if balance_factor > 1:
if self.get_height(n.left.left) < self.get_height(n.left.right):
self._rotate_left(n.left)
self._rotate_right(n)
elif balance_factor < -1:
if self.get_height(n.right.right) < self.get_height(n.right.left):
self._rotate_right(n.right)
self._rotate_left(n)
else:
n = n.parent
def _remove_one(self, node):
"""
Side effect!!! Changes node. Node should have exactly one child
"""
replacement = node.left or node.right
if node.parent:
if AvlTree._is_left(node):
node.parent.left = replacement
else:
node.parent.right = replacement
replacement.parent = node.parent
node.parent = None
else:
self._tree = replacement
replacement.parent = None
node.left = None
node.right = None
node.parent = None
self._rebalance(replacement)
def _remove_leaf(self, node):
if node.parent:
if AvlTree._is_left(node):
node.parent.left = None
else:
node.parent.right = None
self._rebalance(node.parent)
else:
self._tree = None
node.parent = None
node.left = None
node.right = None
def remove(self, k):
node = self._get_node(k)
if not node:
return
if AvlTree._is_leaf(node):
self._remove_leaf(node)
return
if node.left and node.right:
nxt = AvlTree._get_next(node)
node.key = nxt.key
node.value = nxt.value
if self._is_leaf(nxt):
self._remove_leaf(nxt)
else:
self._remove_one(nxt)
self._rebalance(node)
else:
self._remove_one(node)
def get(self, k):
node = self._get_node(k)
return node.value if node else -1
def _get_node(self, k):
if not self._tree:
return None
node = self._tree
while node:
if k < node.key:
node = node.left
elif node.key < k:
node = node.right
else:
return node
return None
def get_at(self, pos):
x = pos + 1
node = self._tree
while node:
if x < node.num_left:
node = node.left
elif node.num_left < x:
x -= node.num_left
node = node.right
else:
return (node.key, node.value)
raise IndexError("Out of ranges")
@staticmethod
def _is_left(node):
return node.parent.left and node.parent.left == node
@staticmethod
def _is_leaf(node):
return node.left is None and node.right is None
def _rotate_right(self, node):
if not node.parent:
self._tree = node.left
node.left.parent = None
elif AvlTree._is_left(node):
node.parent.left = node.left
node.left.parent = node.parent
else:
node.parent.right = node.left
node.left.parent = node.parent
bk = node.left.right
node.left.right = node
node.parent = node.left
node.left = bk
if bk:
bk.parent = node
node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
node.num_left = 1 + self.get_num_total(node.left)
def _rotate_left(self, node):
if not node.parent:
self._tree = node.right
node.right.parent = None
elif AvlTree._is_left(node):
node.parent.left = node.right
node.right.parent = node.parent
else:
node.parent.right = node.right
node.right.parent = node.parent
bk = node.right.left
node.right.left = node
node.parent = node.right
node.right = bk
if bk:
bk.parent = node
node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
node.num_left = 1 + self.get_num_total(node.left)
@staticmethod
def _get_next(node):
if not node.right:
return node.parent
n = node.right
while n.left:
n = n.left
return n
# -----------------------------------------------binary seacrh tree---------------------------------------
class SegmentTree1:
def __init__(self, data, default=2**51, func=lambda a, b: a & b):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = data
for i in reversed(range(_size)):
self.data[i] = func(self.data[i + i], self.data[i + i + 1])
def __delitem__(self, idx):
self[idx] = self._default
def __getitem__(self, idx):
return self.data[idx + self._size]
def __setitem__(self, idx, value):
idx += self._size
self.data[idx] = value
idx >>= 1
while idx:
self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
idx >>= 1
def __len__(self):
return self._len
def query(self, start, stop):
if start == stop:
return self.__getitem__(start)
stop += 1
start += self._size
stop += self._size
res = self._default
while start < stop:
if start & 1:
res = self._func(res, self.data[start])
start += 1
if stop & 1:
stop -= 1
res = self._func(res, self.data[stop])
start >>= 1
stop >>= 1
return res
def __repr__(self):
return "SegmentTree({0})".format(self.data)
# -------------------game starts now----------------------------------------------------import math
class SegmentTree:
def __init__(self, data, default=0, func=lambda a, b: a + b):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = data
for i in reversed(range(_size)):
self.data[i] = func(self.data[i + i], self.data[i + i + 1])
def __delitem__(self, idx):
self[idx] = self._default
def __getitem__(self, idx):
return self.data[idx + self._size]
def __setitem__(self, idx, value):
idx += self._size
self.data[idx] = value
idx >>= 1
while idx:
self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
idx >>= 1
def __len__(self):
return self._len
def query(self, start, stop):
if start == stop:
return self.__getitem__(start)
stop += 1
start += self._size
stop += self._size
res = self._default
while start < stop:
if start & 1:
res = self._func(res, self.data[start])
start += 1
if stop & 1:
stop -= 1
res = self._func(res, self.data[stop])
start >>= 1
stop >>= 1
return res
def __repr__(self):
return "SegmentTree({0})".format(self.data)
# -------------------------------iye ha chutiya zindegi-------------------------------------
class Factorial:
def __init__(self, MOD):
self.MOD = MOD
self.factorials = [1, 1]
self.invModulos = [0, 1]
self.invFactorial_ = [1, 1]
def calc(self, n):
if n <= -1:
print("Invalid argument to calculate n!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.factorials):
return self.factorials[n]
nextArr = [0] * (n + 1 - len(self.factorials))
initialI = len(self.factorials)
prev = self.factorials[-1]
m = self.MOD
for i in range(initialI, n + 1):
prev = nextArr[i - initialI] = prev * i % m
self.factorials += nextArr
return self.factorials[n]
def inv(self, n):
if n <= -1:
print("Invalid argument to calculate n^(-1)")
print("n must be non-negative value. But the argument was " + str(n))
exit()
p = self.MOD
pi = n % p
if pi < len(self.invModulos):
return self.invModulos[pi]
nextArr = [0] * (n + 1 - len(self.invModulos))
initialI = len(self.invModulos)
for i in range(initialI, min(p, n + 1)):
next = -self.invModulos[p % i] * (p // i) % p
self.invModulos.append(next)
return self.invModulos[pi]
def invFactorial(self, n):
if n <= -1:
print("Invalid argument to calculate (n^(-1))!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.invFactorial_):
return self.invFactorial_[n]
self.inv(n) # To make sure already calculated n^-1
nextArr = [0] * (n + 1 - len(self.invFactorial_))
initialI = len(self.invFactorial_)
prev = self.invFactorial_[-1]
p = self.MOD
for i in range(initialI, n + 1):
prev = nextArr[i - initialI] = (prev * self.invModulos[i % p]) % p
self.invFactorial_ += nextArr
return self.invFactorial_[n]
class Combination:
def __init__(self, MOD):
self.MOD = MOD
self.factorial = Factorial(MOD)
def ncr(self, n, k):
if k < 0 or n < k:
return 0
k = min(k, n - k)
f = self.factorial
return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD
# --------------------------------------iye ha combinations ka zindegi---------------------------------
def powm(a, n, m):
if a == 1 or n == 0:
return 1
if n % 2 == 0:
s = powm(a, n // 2, m)
return s * s % m
else:
return a * powm(a, n - 1, m) % m
# --------------------------------------iye ha power ka zindegi---------------------------------
def sort_list(list1, list2):
zipped_pairs = zip(list2, list1)
z = [x for _, x in sorted(zipped_pairs)]
return z
# --------------------------------------------------product----------------------------------------
def product(l):
por = 1
for i in range(len(l)):
por *= l[i]
return por
# --------------------------------------------------binary----------------------------------------
def binarySearchCount(arr, n, key):
left = 0
right = n - 1
count = 0
while (left <= right):
mid = int((right + left) / 2)
# Check if middle element is
# less than or equal to key
if (arr[mid] < key):
count = mid + 1
left = mid + 1
# If key is smaller, ignore right half
else:
right = mid - 1
return count
# --------------------------------------------------binary----------------------------------------
def countdig(n):
c = 0
while (n > 0):
n //= 10
c += 1
return c
def binary(x, length):
y = bin(x)[2:]
return y if len(y) >= length else "0" * (length - len(y)) + y
def countGreater(arr, n, k):
l = 0
r = n - 1
# Stores the index of the left most element
# from the array which is greater than k
leftGreater = n
# Finds number of elements greater than k
while (l <= r):
m = int(l + (r - l) / 2)
if (arr[m] >= k):
leftGreater = m
r = m - 1
# If mid element is less than
# or equal to k update l
else:
l = m + 1
# Return the count of elements
# greater than k
return (n - leftGreater)
# --------------------------------------------------binary------------------------------------
for ik in range(int(input())):
n,m=map(int,input().split())
l=list(map(int,input().split()))
pre=[0]*(n+1)
s=0
for i in range(1,n+1):
pre[i]=pre[i-1]+l[i-1]
s+=l[i-1]
for i in range(1,n+1):
pre[i]=max(pre[i],pre[i-1])
ma=max(pre)
x=list(map(int,input().split()))
ans=[]
for i in range(m):
su=x[i]
if s<=0:
d=binarySearchCount(pre,len(pre),su)
if d==len(pre):
ans.append(-1)
else:
ans.append(d-1)
else:
t=su
t-=ma
t=max(t,0)
ans1=int(math.ceil(t/s))
su-=s*ans1
d = binarySearchCount(pre, len(pre), su)
if d == len(pre):
ans.append(-1)
else:
ans.append(d+ans1*n-1)
print(*ans)
| 13 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define lp3(i,s,n) for(int i = s;i < int(n); ++i)
#define lp(i, n) lp3(i,0,n)
#define pb push_back
#define debug(x) cout<<"[" << #x << " is: " << x << "] "<<endl;
#define file freopen("input.in","r",stdin);
#define fastIO std::ios::sync_with_stdio(false); cin.tie(0);
#define x first
#define y second
void solve(){
int n, m;
cin>>n>>m;
int all = 0;
vector<int> v(n);
vector<pair<int, int>> up;
lp(i, n){
cin>>v[i];
all+=v[i];
if(all > 0 && (up.empty() || all>up.back().x))
up.push_back({all, i});
}
while(m--){
//debug(m)
int k; cin>>k;
if(up.empty() || k > up.back().x && all <= 0)
cout<<-1<<" ";
else{
int ans = 0;
if(all > 0 && k > up.back().x ){
int z = (k-up.back().x+all-1)/all;
k -= z*all;
ans = z * n;
}
if(k == 0){
cout<<ans-1<<" ";
continue;
}
int lo = 0, hi = int(up.size())-1;
int best = 0;
while(lo <= hi){
int md = lo + (hi - lo)/2;
if(up[md].x >= k){
hi = md-1;
best = up[md].y;
}
else{
lo = md+1;
}
}
cout<<best+ans<<" ";
}
}
cout<<endl;
}
int32_t main() { fastIO
int t; cin>>t;
while(t--){
solve();
}
return 0;
}
| 13 |
CPP
|
from sys import stdin
from math import ceil
from bisect import bisect_left as bl
input = stdin.readline
def greater(num, arr):
ind = bl(arr, num)
return arr[ind]
for test in range(int(input())):
n, m = map(int, input().strip().split())
lst = list(map(int, input().strip().split()))
x = list(map(int, input().strip().split()))
dct = {}
s = 0
ans = [-1] * m
temp = 0
for i in range(n):
s += lst[i]
temp = max(temp, s)
try:
dct[temp]
except KeyError:
dct.update({s: i})
sum_lst = list(dct.keys())
# print(s, dct, sum_lst)
s_max = sum_lst[-1]
if s_max > 0:
for i in range(m):
if x[i] <= s_max:
num = greater(x[i], sum_lst)
ans[i] = dct[num]
else:
if s > 0:
store = ceil((x[i] - s_max) / s)
check = x[i] - store * s
num = greater(check, sum_lst)
ans[i] = dct[num] + store * n
# print(store, check, ind)
print(*ans)
| 13 |
PYTHON3
|
import sys,os,io ; from sys import stdin
from bisect import bisect_left , bisect_right
if(os.path.exists('input.txt')):
sys.stdin = open("input.txt","r") ; sys.stdout = open("output.txt","w")
else:
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
si = lambda : input()
ii = lambda : int(input())
li = lambda:list(map(int,input().split()))
t = 1
t = int(input())
def divideCeil(n,x):
if (n%x==0):
return n//x
return n//x+1
for _ in range(t):
n,m = li()
a = li()
xl = li()
mx = []
curSum = 0
mxind = []
for i in range(n):
curSum+=a[i]
if mx==[] or mx[-1]<curSum:
mx.append(curSum)
mxind.append(i)
res = []
for x in xl:
if (x>mx[-1] and curSum<=0):
res.append(-1)
else:
temp = 0
if (x>mx[-1]):
dif = x-mx[-1]
temp = divideCeil(dif,curSum)
toFind = x-temp*curSum
ind = bisect_left(mx,toFind)
res.append(temp*n+mxind[ind])
print(*res)
| 13 |
PYTHON3
|
import bisect
t = int(input())
for _ in range(t):
n,m = map(int,input().split())
A = list(map(int,input().split()))
X = list(map(int,input().split()))
upd = [0]
updl = [0]
m = 0
cum = 0
for i,a in enumerate(A):
cum += a
if m < cum:
m = cum
upd.append(m)
updl.append(i)
ans = []
for x in X:
if x > m and cum <= 0:
ans.append(-1)
continue
if x <= m:
ind = bisect.bisect_right(upd, x)
if upd[ind-1] >= x:
ans.append(updl[ind-1])
else:
ans.append(updl[ind])
else:
c = (x-m+cum-1)//cum
base = c*n
x = x-cum*c
ind = bisect.bisect_right(upd, x)
if upd[ind-1] >= x:
ans.append(base+updl[ind-1])
else:
ans.append(base+updl[ind])
print(*ans)
| 13 |
PYTHON3
|
import bisect
import math
for _ in range(int(input())):
n,m=map(int,input().split())
lis=list(map(int,input().split()))
x=list(map(int,input().split()))
prefix=[]
dic={}
sum1=0
for i in range(len(lis)):
sum1+=lis[i]
if prefix and sum1<prefix[-1]:
continue
prefix.append(sum1)
if sum1 not in dic:
dic[sum1]=i
l2=[]
for i in range(len(prefix)):
l2.append(prefix[i])
l2.sort()
output=[]
for i in x:
if lis[0]>=i:
output.append(0)
continue
if l2[-1]<i and sum1<=0:
output.append(-1)
continue
if sum1>0 and l2[-1]<i:
temp = i-l2[-1]
rotations=math.ceil(temp/sum1)
find=i-rotations*sum1
output.append(len(lis)*rotations+dic[l2[bisect.bisect_left(l2,find)]])
continue
if l2[-1]>=i:
output.append(dic[l2[bisect.bisect_left(l2,i)]])
for i in output:
print(i,end=" ")
print()
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
string to_string(char x) {
string re;
re += '\'';
re += x;
re += '\'';
return re;
}
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string)s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define LOCAL
//#undef LOCAL
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define fi first
#define se second
#define ins insert
#define pb push_back
#define em emplace
#define eb emplace_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0)
#define fk(i, a, b) for (int i = (a); i < (b); ++i)
#define fb(i, a, b) for (int i = (a); i <= (b); ++i)
#define fan(i, a, b) for (int i = (a); i >= (b); --i)
#define foreach(i, x) for (auto& i : x)
#define frei freopen("i", "r", stdin)
#define freo freopen("o", "w", stdout)
using namespace std;
using i32 = int;
using ll = long long;
using i64 = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using si = set<int>;
using sl = set<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
template <typename T>
using S = set<T>;
template <typename T>
using V = vector<T>;
template <typename T>
using Q = queue<T>;
template <typename T>
using DQ = deque<T>;
template <typename T>
using ST = stack<T>;
template <typename T, typename _T>
using M = map<T, _T>;
template <typename T>
using DP = priority_queue<T, vector<T>, less<T>>;
template <typename T>
using XP = priority_queue<T, vector<T>, greater<T>>;
const char end1 = '\n';
template <typename T>
ll Min(T a) {
return (ll)a;
}
template <typename Head, typename... Tail>
ll Min(Head H, Tail... T) {
return min((ll)H, Min(T...));
}
template <typename T>
ll Max(T a) {
return (ll)a;
}
template <typename Head, typename... Tail>
ll Max(Head H, Tail... T) {
return max((ll)H, Max(T...));
}
template <typename T>
ll Gcd(T a) {
return a;
}
template <typename Head, typename... Tail>
ll Gcd(Head H, Tail... T) {
return __gcd((ll)H, Gcd(T...));
}
int main() {
IOS;
int t;
cin >> t;
while (t--) {
ll n, m;
cin >> n >> m;
vl v(n + 1);
fb (i, 1, n) {
cin >> v[i];
}
vl sum(n + 1, 0);
vl mx(n + 1, 0);
fb (i, 1, n) {
sum[i] = sum[i - 1] + v[i];
if (i == 1) mx[i] = sum[i];
else mx[i] = max(mx[i - 1], sum[i]);
}
vl ans;
while (m--) {
ll x;
cin >> x;
auto re = lower_bound(all(mx), x);
if (re == mx.end()) {
if (sum.back() <= 0) {
ans.pb(-1);
}
else {
ll sheng = x - mx.back();
ll lun = sheng / sum.back();
if (sheng % sum.back()) ++lun;
sheng = x - lun * sum.back();
auto re2 = lower_bound(all(mx), sheng);
ans.pb(lun * n + (long long )(re2 - mx.begin() - 1));
}
}
else {
ans.pb(re - mx.begin() - 1);
}
}
foreach (i, ans) {
cout << i << ' ';
}
cout << end1;
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const ll Inf = 1LL << 62;
ll ar[Max];
ll pos[Max];
ll x[Max];
void Solve() {
ll n, m;
cin >> n >> m;
ll sum = 0, mx = -Inf;
for (ll i = 1; i <= n; i++) {
cin >> ar[i];
sum += ar[i];
mx = max(mx, sum);
pos[i] = mx;
}
for (ll i = 1; i <= m; i++) {
cin >> x[i];
}
for (ll i = 1; i <= m; i++) {
if (x[i] <= mx) {
ll l = 1, r = n, ans = -1;
while (l <= r) {
ll mid = (l + r) >> 1;
if (pos[mid] >= x[i]) {
ans = mid - 1;
r = mid - 1;
} else {
l = mid + 1;
}
}
cout << ans << " ";
} else if(sum <= 0) {
cout << "-1" << " ";
} else {
ll res = Inf;
ll mm = x[i];
mm -= mx;
ll now = mm / sum;
for (ll j = now - 1; j <= now + 1; j++) {
if(j < 1) {
continue;
}
ll now = j * n - 1;
ll l = 1, r = n, ans = -1;
while (l <= r) {
ll mid = (l + r) >> 1;
if (pos[mid] + j * sum >= x[i]) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
if (ans != -1) {
res = min(res, now + ans);
}
}
now = x[i] / sum;
for (ll j = now - 1; j <= now + 1; j++) {
if(j < 1) {
continue;
}
ll now = j * n - 1;
ll l = 1, r = n, ans = -1;
while (l <= r) {
ll mid = (l + r) >> 1;
if (pos[mid] + j * sum >= x[i]) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
if (ans != -1) {
res = min(res, now + ans);
}
}
if (res == Inf) {
res = -1;
}
cout << res << " ";
}
}
cout << endl;
}
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio();
cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
Solve();
}
return 0;
}
| 13 |
CPP
|
//To debug : g++ -g file.cpp -o code
//to flush output : fflush(stdout) or cout.flush()
//cout<<setprecision(p)<<fixed<<var
//use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll
//take care of precedence rule of operators
//do not forget to change the sizes of arrays and value of contants and other things after debugging
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,n) for(i=a;i<n;++i)
#define irep(i,n,a) for(i=n;i>a;--i)
#define mod 1000000007
#define pb push_back
#define big 9223372036854775807
#define big1 LONG_MAX
#define big2 ll_MAX
#define big3 1000000000
#define sma1 LONG_MIN
#define sma2 ll_MIN
#define sma3 -1000000000
#define mp make_pair
#define dub double
#define ivec vector<ll>
#define lvec vector<long long>
#define cvec vector<char>
#define svec vector<string>
#define mt make_tuple
#define MOD 998244353
#define ld long double
#define pi acos(-1.0)
#define SZ(x) (ll)(x.size())
//comment the below if not required
/*
#define ss second.second
#define ff first.first
#define f first
#define s second
#define sf second.first
#define fs first.second
*/
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
//cout<<"Case #"<<c<<": "<<ans<<"\n" ;
const ll N = 2e5+1;
ll n,m;
ll M[N],a[N],ps[N],ans[N],val,res,i,sz;
vector<pair<ll,ll>> v;
int main()
{
IOS;
ll t,s,temp,l,r,mid,mx;
cin>>t;
while(t--)
{
cin>>n>>m;
s = 0;
v.clear();
rep(i,1,n+1){
cin>>a[i];
s+=a[i];
if(s>0)
v.pb({s,i});
}
rep(i,1,m+1){
cin>>M[i];
}
sort(v.begin(),v.end());
sz = SZ(v);
if(sz==0)
{
rep(i,1,m+1)
cout<<-1<<" ";
cout<<"\n";
continue;
}
mx = v[sz-1].first;
temp = LLONG_MAX;
for(i=sz-1;i>=0;--i)
{
temp = min(temp,v[i].second);
ps[i]=temp;
}
for(i=1;i<=m;++i)
{
ans[i] = 0;
if(M[i]>mx)
{
if(s<=0)
{
ans[i]=-1;
continue;
}
temp = (M[i]-mx+s-1)/s;
ans[i] = temp*n;
M[i] -= temp*s;
}
l = 0 , r = sz-1;
res = LLONG_MAX;
while(l<=r)
{
mid = (l+r)/2;
if(v[mid].first>=M[i])
{
res = ps[mid];
r = mid-1;
}
else
{
l = mid+1;
}
}
ans[i] += res-1;
}
for(i=1;i<=m;++i)
cout<<ans[i]<<" ";
cout<<"\n";
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ps push
#define in insert
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
#define nl cout<<"\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b/gcd(a, b))
int xm[4] = {-1, 1, 0, 0};
int ym[4] = {0, 0, -1, 1};
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll POW = 9973;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin>>t;
while(t--){
int n, m;
cin>>n>>m;
ll ar[n];
vector<ll> sm(n, 0);
vector<ll> mx(n, 0);
for(int i=0; i<n; i++) cin>>ar[i];
for(int i=0; i<n; i++){
if(i) {
sm[i] = sm[i-1];
mx[i] = mx[i-1];
}
sm[i] += ar[i];
mx[i] = max(mx[i], sm[i]);
}
for(int i=0; i<m; i++){
ll x; cin>>x;
ll ans = -1;
if(sm[n-1]>0 && (x-mx[n-1])>0){
ans += n * (((x-mx[n-1]+sm[n-1]-1)/sm[n-1]));
x -= sm[n-1] * ((x-mx[n-1]+sm[n-1]-1)/sm[n-1]);
}
if(x==0) {cout<<ans<<" "; continue;}
auto it = lower_bound(all(mx), x);
if(it==mx.end()) cout<<-1<<" ";
else cout<<ans + (it - mx.begin())+1<<" ";
}
nl;
}
}
| 13 |
CPP
|
from bisect import bisect_left
for i in range(int(input())):
n, m = map(int,input().split())
a = list(map(int,input().split()))
p = [0]*(n+1)
M = [0]*(n+1)
for i in range(n):
p[i+1] = p[i] + a[i]
M[i+1] = max(M[i], p[i+1])
s = p[-1]
ans = []
for x in map(int,input().split()):
r = 0
if s > 0:
t = max((x-M[-1]+s-1)//s,0)
r += t*n
x -= t*s
if x > M[-1]:
ans.append('-1')
else:
pos = bisect_left(M,x)
ans.append(str(r + pos - 1))
print(' '.join(ans))
| 13 |
PYTHON3
|
from bisect import bisect_left
import math
for _ in range(int(input())):
n,m=map(int,input().split())
a=list(map(int,input().split()))
x=list(map(int,input().split()))
curSum=0
mx=[]
mxindx=[]
for i in range(n):
curSum+=a[i]
if mx==[] or mx[-1]<curSum:
mx.append(curSum)
mxindx.append(i)
stack=[]
for i in range(m):
if x[i]>mx[-1] and curSum<=0:
stack.append(-1)
else:
temp=0
if(x[i]>mx[-1]):
diff=x[i]-mx[-1]
temp=math.ceil(diff/curSum)
stack.append(temp*n+mxindx[bisect_left(mx,x[i]-curSum*temp)])
print(*stack)
| 13 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
ll allSum = 0;
vector<ll> pref;
vector<int> ind;
int curInd = 0;
for (ll &e : a) {
cin >> e;
allSum += e;
if (pref.empty() || allSum > pref.back()) {
pref.push_back(allSum);
ind.push_back(curInd);
}
curInd++;
}
for (int q = 0; q < m; q++) {
ll x;
cin >> x;
if (pref.back() < x && allSum <= 0) {
cout << -1 << " ";
continue;
}
ll needTimes = 0;
if (pref.back() < x) {
needTimes = (x - pref.back() + allSum - 1) / allSum;
}
x -= needTimes * allSum;
cout << needTimes * n + ind[lower_bound(pref.begin(), pref.end(), x) - pref.begin()] << " ";
}
cout << "\n";
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "trace.h"
#else
#define trace(args...)
#endif
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
const int inf = 1e9 + 7;
struct seg_tree {
vector<ll> t;
int n;
void init(int m) {
n = m;
t.assign(4 * n, 0);
}
int query_aux(int v, int tl, int tr, int l, int r, ll x) {
if (l > r || t[v] < x) return -1;
if (tl == tr) return tl;
int tm = (tl + tr) / 2;
int res = query_aux(v * 2, tl, tm, l, min(r, tm), x);
if (res == -1) res = query_aux(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, x);
return res;
}
void update_aux(int v, int tl, int tr, int pos, ll new_val) {
if (tl == tr) {
t[v] = new_val;
return;
}
int tm = (tl + tr) / 2;
if (pos <= tm)
update_aux(v * 2, tl, tm, pos, new_val);
else
update_aux(v * 2 + 1, tm + 1, tr, pos, new_val);
t[v] = max(t[v * 2], t[v * 2 + 1]);
}
void update(int i, ll x) {
return update_aux(1, 0, n - 1, i, x);
}
int query(int l, int r, ll x) {
return query_aux(1, 0, n - 1, l, r, x);
}
};
void solve(int test) {
seg_tree stree;
int n, m;
cin >> n >> m;
vector<ll> a(n + 1, 0);
stree.init(n + 1);
stree.update(0, 0);
ll mx = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
stree.update(i, a[i]);
mx = max(mx, a[i]);
}
trace(a);
for (int i = 0, x; i < m; i++) {
cin >> x;
int res = stree.query(0, n, x);
if (res == -1) {
if (a[n] <= 0) {
cout << -1;
} else {
int q = 1 + (x - mx - 1) / a[n];
x -= q * a[n];
res = stree.query(0, n, x);
ll ans = 1LL * q * n;
ans += (res - 1);
cout << ans;
}
} else {
cout << (res - 1);
}
cout << ' ';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
// cout << "Case #" << i << ": ";
solve(i);
cout << '\n';
}
}
| 13 |
CPP
|
#include<bits/stdc++.h>
using namespace std;
//https://blog.csdn.net/Phoenix_ZengHao/article/details/113833938
typedef long long LL;
const int maxn=2e5+50;
LL n,m,T;
LL a[maxn],sum[maxn],maxx[maxn],ans[maxn];
int main()
{
cin>>T;
while(T--)
{
cin>>n>>m;
memset(maxx,0,sizeof(maxx));
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
maxx[i]=max(maxx[i-1],sum[i]);
}
for(int i=1;i<=m;i++)
{
LL x;
cin>>x;
if(x<=maxx[n])
{
LL t=lower_bound(maxx+1,maxx+1+n,x)-maxx;
cout<<t-1<<' ';
}
else
{
if(sum[n]<=0)
{
cout<<-1<<' ';
}
else
{
LL d=x-maxx[n];
LL tot=ceil(d*1.0/sum[n]);
x=x-tot*sum[n];
LL t=lower_bound(maxx+1,maxx+1+n,x)-maxx;
t=t+tot*n-1;
cout<<t<<' ';
}
}
}
cout<<'\n';
}
return 0;
}
| 13 |
CPP
|
#include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define fWrite freopen ("out.txt","w",stdout);
#define TC int t;cin >> t;FOR(tc,1,t)
#define LL long long
#define ULL unsigned long long
#define ff first
#define ss second
#define pb push_back
#define pii pair<LL,int>
#define all(a) a.begin(),a.end()
#define MEM(a,x) memset(a,x,sizeof(a))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,b) for(int i=0;i<b;i++)
const int N = 2e5 + 5;
int n,m;
int tree[4*N];
LL arr[N];
vector<pii>csum;
inline void build(int L,int R,int pos)
{
if(L==R)
{
tree[pos] = csum[L].ss;
return;
}
int mid=(L+R)/2;
build(L,mid,pos*2+1);
build(mid+1,R,pos*2+2);
tree[pos]=min(tree[pos*2+1],tree[pos*2+2]);
return;
}
inline int query(int ql,int qr,int L,int R,int pos)
{
if(ql>R or qr<L)
return 1e9;
else if(ql<=L and qr>=R)
return tree[pos];
int mid=(L+R)/2;
int p=query(ql,qr,L,mid,2*pos+1);
int q=query(ql,qr,mid+1,R,2*pos+2);
return min(p,q);
}
int call(LL x){
int idx = lower_bound(all(csum),pii(x,-1)) - csum.begin();
return query(idx,n-1,0,n-1,0);
}
int main()
{
Fast
TC{
cin >> n >> m;
LL sum = 0, mx = -1e18;
csum.clear();
REP(i,n) {
cin >> arr[i];
sum += arr[i];
csum.pb({sum,i});
if(sum>mx) {
mx = sum;
}
}
sort(all(csum));
REP(i,4*n) tree[i] = 1e8;
build(0,n-1,0);
FOR(i,1,m){
LL x;
cin >> x;
if(x<=mx){
cout << call(x) << ' ';
}
else{
if(sum<=0) cout << -1 << ' ';
else{
LL diff = (x - mx);
if(diff%sum==0) diff = (diff/sum);
else diff = (diff/sum) + 1;
x -= diff * sum;
//cout << "=== " << mx << ' ' << sum << ' ' << x << '\n';
cout << n * diff + call(x) << ' ';
}
}
}
cout << '\n';
}
}
| 13 |
CPP
|
#include <bits/stdc++.h>
// #include <atcoder/all>
//using namespace atcoder;
//tabaicho see https://boostjp.github.io/tips/multiprec-int.html
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// cpp_int
// int128_t
// int256_t
// int512_t
// int1024_t
// uint128_t
// uint256_t
// uint512_t
// uint1024_t
#define int long long
#define inf 1000000007
// #define inf 998244353
#define pa pair<int,int>
#define ll long long
#define PI 3.14159265358979323846
#define mp make_pair
#define pb push_back
#define EPS (1e-8)
using namespace std;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int Gcd(int v,int b){
if(v==0) return b;
if(b==0) return v;
if(v>b) return Gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return Gcd(v,b%v);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
ostream& operator<<(ostream& os, const vector<int>& VEC){
for(auto v:VEC)os<<v<<" ";
return os;
}
ostream& operator<<(ostream& os, const pa& PAI){
os<<PAI.first<<" : "<<PAI.second;
return os;
}
ostream& operator<<(ostream& os, const pa3& PAI){
os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z;
return os;
}
ostream& operator<<(ostream& os, const pa4& PAI){
os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z<<" : "<<PAI.w;
return os;
}
ostream& operator<<(ostream& os, const vector<pa>& VEC){
for(auto v:VEC)os<<v<<" ";
return os;
}
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
int pr[2100000];
int inv[2100000];
int comb(int nn,int rr){
if(rr<0 || rr>nn || nn<0) return 0;
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=((ll)pr[i-1]*i)%mod;
}
inv[ert]=beki(pr[ert],mod-2,mod);
for(int i=ert-1;i>=0;i--){
inv[i]=(ll)inv[i+1]*(i+1)%mod;
}
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
// mt19937(clock_per_sec);
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
void solve(){
int n;
cin>>n;
int q;
cin>>q;
vector<int>ve(n);
for(auto &v:ve)cin>>v;
vector<int>rui=ve;
for(int i=1;i<n;i++)rui[i]+=rui[i-1];
int T=rui.back();
for(int i=1;i<n;i++)rui[i]=max(rui[i],rui[i-1]);
while(q--){
int x;
cin>>x;
if(rui.back()>=x){
cout<<lower_bound(rui.begin(),rui.end(),x)-rui.begin()<<" ";
continue;
}
if(T<=0){
cout<<-1<<" ";
continue;
}
int sa=x-rui.back();
int kai=sa/T+!!(sa%T);
int ans=n*kai;
x-=T*kai;
cout<<lower_bound(rui.begin(),rui.end(),x)-rui.begin()+ans<<" ";
}
cout<<endl;
}
signed main(){
mod=inf;
cin.tie(0);
//solve1();
ios::sync_with_stdio(false);
int n=1;
cin>>n;
for(int i=0;i<n;i++)solve();
return 0;
}
| 13 |
CPP
|
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#------------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#------------------------------------------------------------------------
def RL(): return map(int, sys.stdin.readline().rstrip().split())
def RLL(): return list(map(int, sys.stdin.readline().rstrip().split()))
def N(): return int(input())
def A(n):return [0]*n
def AI(n,x): return [x]*n
def G(n): return [[] for i in range(n)]
def GP(it): return [[ch,len(list(g))] for ch,g in groupby(it)]
#------------------------------------------------------------------------
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
mod=10**9+7
farr=[1]
ifa=[]
def fact(x,mod=0):
if mod:
while x>=len(farr):
farr.append(farr[-1]*len(farr)%mod)
else:
while x>=len(farr):
farr.append(farr[-1]*len(farr))
return farr[x]
def ifact(x,mod):
global ifa
fact(x,mod)
ifa.append(pow(farr[-1],mod-2,mod))
for i in range(x,0,-1):
ifa.append(ifa[-1]*i%mod)
ifa.reverse()
def per(i,j,mod=0):
if i<j: return 0
if not mod:
return fact(i)//fact(i-j)
return farr[i]*ifa[i-j]%mod
def com(i,j,mod=0):
if i<j: return 0
if not mod:
return per(i,j)//fact(j)
return per(i,j,mod)*ifa[j]%mod
def catalan(n):
return com(2*n,n)//(n+1)
def isprime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
def floorsum(a,b,c,n):#sum((a*i+b)//c for i in range(n+1))
if a==0:return b//c*(n+1)
if a>=c or b>=c: return floorsum(a%c,b%c,c,n)+b//c*(n+1)+a//c*n*(n+1)//2
m=(a*n+b)//c
return n*m-floorsum(c,c-b-1,a,m-1)
def inverse(a,m):
a%=m
if a<=1: return a
return ((1-inverse(m,a)*m)//a)%m
def lowbit(n):
return n&-n
class BIT:
def __init__(self,arr):
self.arr=arr
self.n=len(arr)-1
def update(self,x,v):
while x<=self.n:
self.arr[x]+=v
x+=x&-x
def query(self,x):
ans=0
while x:
ans+=self.arr[x]
x&=x-1
return ans
class ST:
def __init__(self,arr):#n!=0
n=len(arr)
mx=n.bit_length()#ๅไธๅฐ
self.st=[[0]*mx for i in range(n)]
for i in range(n):
self.st[i][0]=arr[i]
for j in range(1,mx):
for i in range(n-(1<<j)+1):
self.st[i][j]=max(self.st[i][j-1],self.st[i+(1<<j-1)][j-1])
def query(self,l,r):
if l>r:return -inf
s=(r+1-l).bit_length()-1
return max(self.st[l][s],self.st[r-(1<<s)+1][s])
'''
class DSU:#ๅฎน้+่ทฏๅพๅ็ผฉ
def __init__(self,n):
self.c=[-1]*n
def same(self,x,y):
return self.find(x)==self.find(y)
def find(self,x):
if self.c[x]<0:
return x
self.c[x]=self.find(self.c[x])
return self.c[x]
def union(self,u,v):
u,v=self.find(u),self.find(v)
if u==v:
return False
if self.c[u]>self.c[v]:
u,v=v,u
self.c[u]+=self.c[v]
self.c[v]=u
return True
def size(self,x): return -self.c[self.find(x)]'''
class UFS:#็งฉ+่ทฏๅพ
def __init__(self,n):
self.parent=[i for i in range(n)]
self.ranks=[0]*n
def find(self,x):
if x!=self.parent[x]:
self.parent[x]=self.find(self.parent[x])
return self.parent[x]
def union(self,u,v):
pu,pv=self.find(u),self.find(v)
if pu==pv:
return False
if self.ranks[pu]>=self.ranks[pv]:
self.parent[pv]=pu
if self.ranks[pv]==self.ranks[pu]:
self.ranks[pu]+=1
else:
self.parent[pu]=pv
def Prime(n):
c=0
prime=[]
flag=[0]*(n+1)
for i in range(2,n+1):
if not flag[i]:
prime.append(i)
c+=1
for j in range(c):
if i*prime[j]>n: break
flag[i*prime[j]]=prime[j]
if i%prime[j]==0: break
return flag
def dij(s,graph):
d={}
d[s]=0
heap=[(0,s)]
seen=set()
while heap:
dis,u=heappop(heap)
if u in seen:
continue
seen.add(u)
for v,w in graph[u]:
if v not in d or d[v]>d[u]+w:
d[v]=d[u]+w
heappush(heap,(d[v],v))
return d
def lcm(a,b): return a*b//gcd(a,b)
def lis(nums):
res=[]
for k in nums:
i=bisect.bisect_left(res,k)
if i==len(res):
res.append(k)
else:
res[i]=k
return len(res)
def RP(nums):#้ๅบๅฏน
n = len(nums)
s=set(nums)
d={}
for i,k in enumerate(sorted(s),1):
d[k]=i
bi=BIT([0]*(len(s)+1))
ans=0
for i in range(n-1,-1,-1):
ans+=bi.query(d[nums[i]]-1)
bi.update(d[nums[i]],1)
return ans
class DLN:
def __init__(self,val):
self.val=val
self.pre=None
self.next=None
def nb(i,j,n,m):
for ni,nj in [[i+1,j],[i-1,j],[i,j-1],[i,j+1]]:
if 0<=ni<n and 0<=nj<m:
yield ni,nj
def topo(n):
q=deque()
res=[]
for i in range(1,n+1):
if ind[i]==0:
q.append(i)
res.append(i)
while q:
u=q.popleft()
for v in g[u]:
ind[v]-=1
if ind[v]==0:
q.append(v)
res.append(v)
return res
@bootstrap
def gdfs(r,p):
if len(g[r])==1 and p!=-1:
yield None
for ch in g[r]:
if ch!=p:
yield gdfs(ch,r)
yield None
t=N()
for i in range(t):
n,m=RL()
a=RLL()
x=RLL()
pre=0
stack=[[0,-1]]
for i,ch in enumerate(a):
pre+=ch
if pre<=stack[-1][0]:
continue
stack.append([pre,i])
ans=A(m)
for i in range(m):
ind=bisect_left(stack,[x[i],-1])
if ind>=len(stack):
if pre<=0:
ans[i]=-1
else:
per=(x[i]-stack[-1][0]+pre-1)//pre
x[i]-=per*pre
ind=bisect_left(stack,[x[i],-1])
ans[i]=per*n+stack[ind][1]
else:
ans[i]=stack[ind][1]
print(*ans)
'''
sys.setrecursionlimit(200000)
import threading
threading.stack_size(10**8)
t=threading.Thr
ead(target=main)
t.start()
t.join()
'''
'''
sys.setrecursionlimit(200000)
import threading
threading.stack_size(10**8)
t=threading.Thread(target=main)
t.start()
t.join()
'''
| 13 |
PYTHON3
|
import sys, math, itertools, random, bisect
from collections import defaultdict
INF = sys.maxsize
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
mod = 10**9 + 7
for _ in range(int(input())):
n,m = get_ints()
a = get_array()
x = get_array()
b = [[a[0],0]]
cur = a[0]
mx = a[0]
for i in range(1,n):
if cur + a[i] > b[-1][0]:
b.append([cur + a[i], i])
cur += a[i]
mx = max(mx, cur)
length = len(b)
res = []
for ele in x:
if ele<=mx:
l = 0
r = length - 1
while l<=r:
m = (l+r)//2
if b[m][0]>=ele: r = m-1
else: l=m+1
res.append(b[l][1])
else:
if cur>0:
y = (ele - mx)//cur
ele -= y*cur
if ele>mx:
y += 1
ele -= cur
l = 0
r = length - 1
while l<=r:
m = (l+r)//2
if b[m][0]>=ele: r = m-1
else: l=m+1
res.append(b[l][1] + y*n)
else:
res.append(-1)
print(*res)
| 13 |
PYTHON3
|
from itertools import accumulate
import bisect
def solve():
n, m = map(int, input().split())
a = list(map(int, input().split()))
x = list(map(int, input().split()))
p = list(accumulate(a))
s = p[-1]
max_val = max(p)
for i in range(1, n):
p[i] = max(p[i], p[i-1])
res = []
for xi in x:
if s <= 0 and xi > max_val:
res.append(-1)
continue
cnt = 0
if xi > max_val:
c = (xi-max_val +s-1) // s
cnt += c * n
xi -= c * s
idx = bisect.bisect_left(p, xi)
res.append(cnt + idx)
return res
t = int(input())
for _ in range(t):
print(*solve())
| 13 |
PYTHON3
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <list>
#include <map>
#include <set>
#include <limits>
#include <random>
#include <functional>
#include <unordered_set>
#include <unordered_map>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int N = 100010;
const int M = 200010;
const int MOD = 1000000007;
const int INF = 1009000999;
const ll LINF = (1ll << 60) + 1337;
const ld EPS = 0.00000001;
void build(vi& a, vi & ans, int l, int r, int depth = 0) {
if (l >= r) return;
int id = max_element(a.begin() + l, a.begin() + r) - a.begin();
ans[id] = depth;
build(a, ans, l, id, depth + 1);
build(a, ans, id + 1, r, depth + 1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _DEBUG
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif
//#ifndef _DEBUG
// freopen("cubroot.in", "r", stdin); freopen("cubroot.out", "w", stdout);
//#endif
int tt;
cin >> tt;
while (tt--) {
int n, m;
cin >> n >> m;
vl a(n);
vl ps(n + 1, 0);
map<ll, ll> imin;
map<ll, ll> ss;
for (int i = 0; i < n; i++) {
cin >> a[i];
ps[i + 1] = ps[i] + a[i];
if (imin.find(ps[i + 1]) == imin.end()) imin[ps[i + 1]] = i;
}
ll pref = INF;
for (auto i = imin.rbegin(); i != imin.rend(); i++) {
ss[i->first] = min(pref, i->second);
pref = min(pref, i->second);
}
while (m--) {
ll x;
cin >> x;
if (ss.lower_bound(x) == ss.end()) {
if (ps[n] <= 0) cout << "-1 ";
else {
ll rotate = (x - ss.rbegin()->first) / ps[n] + ((x - ss.rbegin()->first) % ps[n] ? 1ll : 0ll);
ll res = rotate * n;
ll ost = x - rotate * ps[n];
//if (imin.lower_bound(ost) == imin.end()) {
// res += n;
// ost -= ps[n];
//}
res += ss.lower_bound(ost)->second;
cout << res << " ";
}
}
else {
cout << ss.lower_bound(x)->second << " ";
}
}
cout << "\n";
}
}
/*
Important stuff
- int overflow
- array bounds
- special cases (n=1, max n) maybe adhoc problem
- doubles are read for a long time (4 * 10 ^ 5 danger GNU vs MS ICPC 2020 1/4)
- don't get stuck on one approach
- don't get stuck on one problem
- recheck submissions if near the end of the tournament and there is nothing to do
- do something instead of nothing and stay organized
*/
| 13 |
CPP
|
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main()
{
int t; cin >> t;
int vivod = 0;
for (int i = 0; i < t; ++i){
int n, m; cin >> n >> m;
vector<pair<long long, long long>> prirost;
vector <long long> mas(n);
long long prirost_max = 0, prirost_cikl=0;
for (int x = 0; x < n; ++x){
cin >> mas[x];
prirost_cikl += mas[x];
prirost_max = (prirost_max > prirost_cikl ? prirost_max : prirost_cikl);
if (prirost_cikl > 0){
if (prirost.size() == 0) prirost.push_back(make_pair(prirost_cikl, x));
else if (prirost_cikl > prirost[prirost.size() - 1].first) prirost.push_back(make_pair(prirost_cikl, x));
}
}
for (int x = 0; x < m; ++x){
long long a, ch=0; cin >> a;
if (prirost_max < a and prirost_cikl<= 0) cout << -1 << " ";
else{
a -= prirost_max;
if (a > 0){ch += (a / prirost_cikl); ch += (a % prirost_cikl != 0 ? 1 : 0);}
a -= (ch * prirost_cikl);
a += prirost_max;
int nach = 0, konec = prirost.size(), ser = 0;
while(konec - nach > 1){
ser = (nach + konec) / 2;
if (a >= prirost[ser].first) nach = ser;
else konec = ser;
}
ser = (nach + konec) / 2;
while (ser > 0 and a <= prirost[ser - 1].first) ser-=1;
while (a > prirost[ser].first and ser < prirost.size()) ser += 1;
ch *= n;
int ch1 = ch;
if (prirost.size()) ch += prirost[ser].second;
if (t == 2000 and ch == 15 and prirost_max>100000 and vivod + 1 == 12701) cout << mas[1] << " ";
else cout << ch << " ";
}
vivod++;
}
cout << endl;
}
return 0;
}
| 13 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define lui long unsigned int
const int N =2e5+5;
const int MOD = 998244353;
const ll M = 1e18;
ll qpow(ll a, ll b, ll m)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int t=1; cin>>t;
while(t--){
int n, m; cin>>n>>m;
ll sum = 0, mx = -1e18;
map<ll, int>mm;
int a, idx;
for(int i=1; i<=n; i++){
cin>>a;
sum += a;
if(sum>mx)
mx = sum, idx = i;
if(sum>0 && mm[sum] == 0){
mm[sum] = i;
}
}
if(mm.size()>1){
auto it = mm.end();
it--; it--;
while(1){
auto it1 = it; it1++;
(*it).s = min((*it).s, (*it1).s);
if(it == mm.begin())
break;
it--;
}
}
int x;
while(m--){
cin>>x;
if(mx<=0 ||(sum<=0 && x>mx)) cout<<-1<<" ";
else if((sum<=0 && x<=mx) || x<=mx) {
auto it = mm.lower_bound(x);
int ans = (*it).s - 1;
cout<<ans<<" ";
}
else{
ll ans = 0;
ll diff = x-mx;
ll k = ceil((float)diff/sum);
ans = k*n;
x = x - sum*k;
if(x){
auto it = mm.lower_bound(x);
ans += (*it).s;
}
// else ans -= n-idx;
ans--;
cout<<ans<<" ";
}
}
cout<<endl;
}
}
| 13 |
CPP
|
import sys
import math
from collections import defaultdict,Counter,deque
import bisect
# input=sys.stdin.readline
# def print(x):
# sys.stdout.write(str(x)+"\n")
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# sys.stdout=open("CP3/output.txt",'w')
# sys.stdin=open("CP3/input.txt",'r')
# mod=pow(10,9)+7
t=int(input())
for i in range(t):
n,m=map(int,input().split())
a=list(map(int,input().split()))
x=list(map(int,input().split()))
pre=[0]*n
pre[0]=a[0]
cur=a[0]
for j in range(1,n):
cur+=a[j]
pre[j]=max(cur,pre[j-1])
ans=[0]*m
for j in range(m):
if cur<=0:
if pre[-1]<x[j]:
ans[j]=-1
else:
ans[j]=bisect.bisect_left(pre,x[j])
else:
if pre[-1]<x[j]:
req=x[j]-pre[-1]
d=(req)//cur
if req%cur:
d+=1
x[j]-=(d*cur)
ans[j]=n*d
ans[j]+=bisect.bisect_left(pre,x[j])
print(*ans)
| 13 |
PYTHON3
|
/*
Author: Manish Kumar
Username: manicodebits
created: 23:43:03 16-02-2021
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589
#define MOD 1000000007
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(0)
#define deb(x) cout<<"[ "<<#x<<" = "<<x<<"] "
void solve(){
int n,m;cin>>n>>m;
vector<int> arr(n);
for(int i=0;i<n;i++)
cin>>arr[i];
int sum=0;
int prev=-1;
int mx=INT_MIN;
vector<int> prefix,prefix_index;
for(int i=0;i<n;i++)
{
sum+=arr[i];
if(sum>prev)
{
prev=sum;
prefix.push_back(sum);
prefix_index.push_back(i);
}
mx=max(mx,sum);
}
while(m--)
{
int x;cin>>x;
if(x>mx && sum<=0)
cout<<"-1 ";
else{
int cnt=0;
if(x>mx)
{
int round=(x-mx+(sum-1))/sum;
x-=round*sum;
cnt+=(n)*round;
}
int lowerBound=lower_bound(prefix.begin(),prefix.end(),x)-prefix.begin();
cout<<cnt+prefix_index[lowerBound]<<" ";
}
}
cout<<"\n";
}
signed main(){
FAST_IO;
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}
| 13 |
CPP
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
typedef long long ll;
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 5e5 + 3e2;
const int M = 2600;
ll pref[N], mx[N];
void solve(int TC) {
int n, m;
cin >> n >> m;
mx[0] = -INF;
for (int i = 1; i <= n; i++){
int x;
cin >> x;
pref[i] = pref[i - 1] + x;
mx[i] = max(mx[i - 1], pref[i]);
}
ll sum = pref[n];
while (m--){
ll x;
cin >> x;
ll k = 0;
ll l = 0, r = (sum == 0 ? 1e9 : 1e18 / sum);
while (l <= r){
ll mid = (l + r) >> 1;
if (sum * mid + mx[n] >= x){
k = mid;
r = mid - 1;
} else l = mid + 1;
}
ll y = x;
x -= k * sum;
int idx = 0;
l = 0, r = n;
while (l <= r){
ll mid = (l + r) >> 1;
if (mx[mid] >= x){
idx = mid;
r = mid - 1;
} else l = mid + 1;
}
cout << (1ll * k * sum + pref[idx] >= y ? 1ll * k * n + idx - 1 : -1) << ' ';
}
cout << endl;
}
int main() {
startTime = clock();
cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(false);
bool llololcal = false;
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
llololcal = true;
#endif
int TC = 1;
cin >> TC;
for (int test = 1; test <= TC; test++) {
debug(test);
solve(test);
}
if (llololcal) cerr << endl << "Time: " << getCurrentTime() * 1000 << " ms" << endl;
return 0;
}
| 13 |
CPP
|
from os import path
import sys,time
from math import ceil, floor,gcd,log,log2 ,factorial
from collections import defaultdict ,Counter , OrderedDict , deque
from heapq import heapify , heappush , heappop
from bisect import *
# from functools import reduce
from operator import mul
from itertools import permutations
maxx, mod = float('inf') , int(1e9 + 7)
localsys ,start_time = 0 , time.time()
if (path.exists('input.txt')):
localsys = 1;sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
#left shift --- num*(2**k) --(k - shift)
input = sys.stdin.readline
N = int(2e5 + 10)
dp =[1]*N
for i in range(10 , N):
dp[i] = (dp[i-9] + dp[i-10])%mod
for _ in range(int(input())):
n , m = map(int , input().split()) ; ans =0
while n :
i = n%10 ; n//=10
ans = (ans + dp[i + m])%mod
print(ans)
if localsys:
print("\n\n\nTime Elased :",time.time() - start_time,"seconds")
| 9 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) { cerr << head; dump(); }
template <typename Head, typename... Tail> void dump(Head &&head, Tail &&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do { cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
/////////////////////////////////////////////////////////////////////
template<int mod>
struct ModInt {
ll x;
ModInt(ll x=0):x((x%mod+mod)%mod){}
ModInt operator-() const { return ModInt(-x); }
ModInt& operator+=(const ModInt a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
ModInt& operator-=(const ModInt a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
ModInt& operator*=(const ModInt a) { (x *= a.x) %= mod; return *this; }
ModInt operator+(const ModInt a) const { return ModInt(*this)+=a; }
ModInt operator-(const ModInt a) const { return ModInt(*this)-=a; }
ModInt operator*(const ModInt a) const { return ModInt(*this)*=a; }
ModInt pow(ll t) const {
if (!t) return 1;
ModInt a = *this, r = 1;
while (t) {
if (t & 1) r *= a;
a *= a;
t >>= 1;
}
return r;
}
ModInt inv() const {
ll a = x;
ll b = mod;
ll c = 1, d = 0;
while (b) {
ll t = a/b;
a -= t*b; swap(a, b);
c -= t*d; swap(c, d);
}
c %= mod;
if (c < 0) c += mod;
return c;
}
ModInt& operator/=(const ModInt a) { return (*this) *= a.inv(); }
ModInt operator/(const ModInt a) const { return ModInt(*this)/=a; }
bool operator==(const ModInt a) const { return x == a.x; }
bool operator!=(const ModInt a) const { return x != a.x; }
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
ll t;
is >> t;
a = ModInt(t);
return (is);
}
};
const ll mod = 1000000007;
using mint = ModInt<mod>;
vector<mint> res(200030);
void solve()
{
int n,m;
scanf("%d %d", &n, &m);
ll ans = 0;
while (n>0) {
int t = n%10;
ans += res[m+t].x;
n /= 10;
}
std::printf("%lld\n", ans%mod);
}
int main()
{
vector<vector<mint>> dp(200030, vector<mint>(10));
dp[0][0] = 1;
rep(j, 200011) {
rep(k, 9) dp[j+1][k+1] += dp[j][k];
dp[j+1][0] += dp[j][9];
dp[j+1][1] += dp[j][9];
rep(k, 10) {
res[j+1] += dp[j+1][k];
}
}
int t; cin>>t;
while(t--) solve();
return 0;
}
| 9 |
CPP
|
//#pragma GCC optimize ("Ofast")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdarg>
#include <cassert>
#include <climits>
#include <cstring>
#include <complex>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <bitset>
#include<stack>
#include <type_traits>
// ะขัั-ััั-ััั-ััั-ััั-ััั-ััั-ััั-ััั, ัะฐะฝััะตะผ ัะตะฑััะฐ
using namespace std;
vector<long long> calc(200004);
long long mod = 1000000007;
int main() {
std::ios_base::sync_with_stdio(false);
int t;
cin >> t;
for (int i = 0; i <= 8; ++i)
calc[i] = 2;
calc[9] = 3;
for (long long i = 10; i <= 200000; ++i)
calc[i] = (calc[i - 9] % mod + calc[i - 10] % mod) % mod;
while (t--) {
int n, m;
cin >> n >> m;
long long t2 = n;
long long res = 0;
while (t2 > 0) {
int t1 = (t2 % 10);
if (10 - t1 <= m)
res = (res % mod + calc[m - (10 - t1)] % mod) % mod;
else
res = (res % mod + 1) % mod;
t2 = (t2 / 10);
}
cout << res % mod << "\n";
}
}
/*
aafaeacabbfbebccecffef
1-2
0-1 1
101011
()(())
((()))
11
1001101101
()()((()))
(())()()()
*/
| 9 |
CPP
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
const ll mod = 1000000007;
vector<ll> cnt(200005);
void preprosy(){
vector<ll> mp(10, 0); mp[9] = 1;
for(ll i = 0; i < 200005; i++){
vector<ll> t = mp;
for(ll j = 0; j < 10; j++){
cnt[i] = (cnt[i] + mp[j]) % mod;
mp[j] = t[(j + 9) % 10];
if(j == 1) mp[j] = (mp[j] + t[9]) % mod;
}
}
}
string s;
ll n;
void brute(){
vector<ll> mp(10, 0);
for(char x : s) mp[x - '0']++;
for(ll i = 0; i < n; i++){
vector<ll> t = mp;
for(ll j = 0; j < 10; j++){
mp[j] = t[(j + 9) % 10];
if(j == 1) mp[j] = (mp[j] + t[9]) % mod;
}
}
ll ans = 0;
for(ll i = 0; i < 10; i++) ans += mp[i];
cout << ans << "\n";
}
void solve(){
cin >> s;
cin >> n;
if(n <= 9) {brute(); return;}
vector<ll> mp(10, 0); for(char x : s) mp[x - '0']++;
ll ans = 0;
for(ll i = 0; i < 10; i++){
ans = (ans + (mp[i] * cnt[n - (9 - i)] % mod)) % mod;
}
cout << ans << "\n";
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
preprosy();
ll t;
cin >> t;
while(t--){
solve();
}
return 0;
}
| 9 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vec vector <int>
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i,x,n) for(int i=x;i<n;i++)
#define rf(i,x,n) for(int i = x; i >= x; i--)
#define all(c) c.begin(),c.end()
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
const int MAX = LLONG_MAX, MOD = 1e9 + 7;
const int MIN = LLONG_MIN;
const long double PI = 3.1415926535;
const int N = 1000;
int fac(int no){
if(no == 0 or no == 1)
return 1;
int ans = no;
while(no > 1){
no--;
ans = ((ans%MOD)*(no%MOD))%MOD;
}
return ans;
}
void solve(int *dp){
string n;
int m;
cin >> n >> m;
int ans = 0;
f(i,0,n.length()){
if(m+n[i]-'0' < 10)
ans = (ans+1)%MOD;
else{
ans = (ans+dp[m+n[i]-'0'-10])%MOD;
}
}
cout << ans << endl;
}
int32_t main()
{
fast();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt","w",stdout);
#endif
int t = 1;
cin >> t;
int size = 2*(1e5) + 1;
int dp[size];
f(i,0,9)
dp[i] = 2;
dp[9] = 3;
f(i,10,size)
dp[i] = (dp[i-10] + dp[i-9])%MOD;
while(t--){
solve(dp);
}
return 0;
}
| 9 |
CPP
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define all(x) (x).begin(), (x).end()
#define len(s) (int)((s).size())
#define str(ch) string(1, ch)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using graph = vector<vector<int>>;
long long calc[200001];
void solve() {
int n, m;
cin >> n >> m;
long long ans = 0;
int cnt[10];
memset(cnt, 0, sizeof(cnt));
while(n) cnt[n % 10]++, n /= 10;
for(int i = 0; i < 10; i++) {
if((9 - i) < m)
ans += calc[m - (10 - i)] * cnt[i], ans %= (int)1e9 + 7;
else
ans += cnt[i];
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long cnt[10];
for(int i = 0; i < 10; i++)
cnt[i] = 0;
for(int i = 0; i <= 200000; i++)
calc[i] = 0;
cnt[9] = 1;
for(int i = 0; i <= 200000; i++) {
long long ncnt[10];
memset(ncnt, 0, sizeof(ncnt));
for(int j = 0; j < 10; j++) {
if(j == 9) {
ncnt[0] += cnt[9];
ncnt[0] %= (int)1e9 + 7;
ncnt[1] += cnt[9];
ncnt[1] %= (int)1e9 + 7;
continue;
}
ncnt[j + 1] += cnt[j];
ncnt[j + 1] %= (int)1e9 + 7;
}
for(int j = 0; j < 10; j++) {
cnt[j] = ncnt[j];
calc[i] += cnt[j];
calc[i] %= (int)1e9 + 7;
}
}
int tt;
cin >> tt;
while(tt--) solve();
return 0;
}
| 9 |
CPP
|
from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import bisect_left as bl, bisect_right as br, bisect
mod = pow(10, 9) + 7
mod2 = 998244353
def inp(): return stdin.readline().strip()
def iinp(): return int(inp())
def out(var, end="\n"): stdout.write(str(var)+"\n")
def outa(*var, end="\n"): stdout.write(' '.join(map(str, var)) + end)
def lmp(): return list(mp())
def mp(): return map(int, inp().split())
def smp(): return map(str, inp().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]
def remadd(x, y): return 1 if x%y else 0
def ceil(a,b): return (a+b-1)//b
def isprime(x):
if x<=1: return False
if x in (2, 3): return True
if x%2 == 0: return False
for i in range(3, int(sqrt(x))+1, 2):
if x%i == 0: return False
return True
K = 200011
ml0 = l1d(K, -1)
for i in range(10):
ml0[i] = 1
for i in range(10, K):
ml0[i] = (ml0[i-9]+ml0[i-10])%mod
for _ in range(int(inp())):
n, k = mp()
c = 0
while n:
c = (c+ml0[k+n%10])%mod
n//=10
print(c)
| 9 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
#define f(i,k,n) for(ll i=k;i<n;i++)
#define all(s) s.begin(),s.end()
#define vec vector<ll>
#define pb push_back
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll maci=200002;
const ll mod=1e9+7;
ll dp[10][maci];
int main(){
IOS;
ll t=1;cin>>t;
f(i,0,10) dp[i][0]=1;
f(i,1,maci){
f(j,0,9){
dp[j][i]=dp[j+1][i-1];
}
dp[9][i]=(dp[0][i-1]%mod+dp[1][i-1]%mod)%mod;
}
while(t--){
ll n,m,ans=0;
cin>>n>>m;
while(n>0){
ll p=n%10;
n/=10;
ans+=dp[p][m];
ans=ans%mod;
}
cout<<ans<<endl;
}
return 0;
}
| 9 |
CPP
|
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define _USE_MATH_DEFINES
# define M_PI 3.14159265358979323846 /* pi */
#define ll long long
#define ld long double
#define vbe(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for(int i=0;i<sz(v);++i)
#define lp(i, n) for(int i=0;i<(int)(n);++i)
#define lpi(i, j, n) for(int i=(j);i<(int)(n);++i)
#define lpd(i, j, n) for(int i=(j);i>=(int)(n);--i)
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cin.tie(0);
#define INFLL 1e18
#define INF 1e9
#define MOD 1000000007
ll GCD(ll a, ll b) { return (a) ? GCD(b % a, a) : b; }
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
ll fastpow(ll b, ll p) { if (!p) return 1; ll ret = fastpow(b, p >> 1); ret *= ret; if (p & 1) ret *= b; return ret; }
const int mxN = 3e5;
ll dp[mxN];
ll gaser(ll n)
{
if (n < 10) return 1;
ll &ret = dp[n];
if (ret != 0) return ret;
return ret = (gaser(n - 9)%MOD + gaser(n - 10)%MOD)%MOD;
}
void solve()
{
int n, m;
cin >> n >> m;
string str = to_string(n);
ll ans = 0;
lp(i, str.length())
{
ans = (ans % MOD + gaser(str[i] - '0'+m) % MOD) %MOD;
}
cout <<ans;
}
int main()
{
FASTIO;
//freopen("input.txt", "r", stdin);
int t;
cin >> t;
while (t--)
{
solve();
cout << "\n";
}
}
| 9 |
CPP
|
import sys
import os.path
from collections import *
import math
import bisect
if (os.path.exists('input.txt')):
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
else:
input = sys.stdin.readline
dp = [0] * (2 * 10**5 + 10)
for i in range(10):
dp[i] = 1
N = 2 * 10**5 + 10
mod = 10**9 + 7
for i in range(10,N):
dp[i] = (dp[i - 10] + dp[i - 9])%mod
tt = int(input())
while tt:
tt -= 1
n,m = [int(x) for x in input().split()]
res = 0
while n:
x = n%10
res = (res + dp[x + m])%mod
n //= 10
print(res)
| 9 |
PYTHON3
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
ll t;
cin>>t;
ll cnt[10];
ll dp[200005];
dp[0] = 1;
cnt[9] = 1;
for(ll i=0;i<9;i++)
{
cnt[i] = 0;
}
for(ll i=1;i<=200000;i++)
{
dp[i] = dp[i-1]+cnt[9];
dp[i] = dp[i]%1000000007;
ll temp[10];
for(ll j=0;j<10;j++)
{
temp[j] = cnt[j];
temp[j] = temp[j]%1000000007;
cnt[j] = cnt[j]%1000000007;
}
cnt[0] = temp[9];
cnt[1] = temp[0]+temp[9];
for(ll j=2;j<=9;j++)
{
cnt[j] = temp[j-1];
}
}
for(ll test=0;test<t;test++)
{
ll n,m;
cin>>n>>m;
ll temp = n;
ll cn[10];
memset(cn,0,sizeof(cn));
while(temp>0)
{
cn[temp%10]++;
temp/=10;
}
ll ans = 0;
for(ll i=0;i<10;i++)
{
if(m-9+i<0)
{
ans+= cn[i];
continue;
}
ans+= cn[i]*dp[(m-9+i)];
ans = ans%1000000007;
}
cout<<ans<<"\n";
}
}
| 9 |
CPP
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f[200005][11];
ll ans[200005][11];
ll g[11];
const ll mod=1e9+7;
void solve(){
for(int i=0;i<=9;i++){
for(int j=0;j<=9;j++) f[0][j]=0;
f[0][i]=1;
for(int j=1;j<=200000;j++){
for(int k=2;k<=9;k++)
f[j][k]=f[j-1][k-1];
f[j][1]=(f[j-1][9]+f[j-1][0])%mod;
f[j][0]=f[j-1][9];
ans[j][i]=0;
for(int k=0;k<=9;k++)
ans[j][i]=(ans[j][i]+f[j][k])%mod;
}
}
}
int main(){
std::ios::sync_with_stdio(false);
solve();
int t;
cin>>t;
while(t--){
memset(g,0,sizeof(g));
ll n,m;
cin>>n>>m;
while(n){
g[n%10]++;
n/=10;
}
ll res=0;
for(int i=0;i<=9;i++)
res=(res+g[i]*ans[m][i]%mod)%mod;
cout<<res<<endl;
}
}
| 9 |
CPP
|
import sys
input = sys.stdin.readline
dp = []
M = 10 ** 9 + 7
for i in range(200010):
if i < 10:
dp.append(1)
else:
dp.append((dp[i - 9] + dp[i - 10]) % M)
for _ in range(int(input())):
n, m = input().split()
m = int(m)
ans = 0
for i in n:
ans = (ans + dp[m + int(i)]) % M
print(ans)
| 9 |
PYTHON3
|
#include<bits/stdc++.h>
#define int long long
#define ld long double
#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
using namespace std;
const int mod=1e9+7;
// const int mod=998244353;
// const int mod=1e9+9;
const int INF=4e18+10;
// const int INF=4e18+10;
typedef pair<int, int> pii;
int power(int a, int b, int in_mod)
{
int ans=1;
int prod=a;
while(b)
{
if(b%2)
ans=(ans*prod)%in_mod;
prod=(prod*prod)%in_mod;
b/=2;
}
return ans;
}
int mod_inv(int q, int in_mod)
{
return power(q, in_mod-2,in_mod);
}
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}
int fact(int n,int in_mod){
int f=1;
for(int i=1;i<=n;i++) f=(f*i)%in_mod;
return f;
}
int ncr(int n,int r,int in_mod){
return (((fact(n,in_mod)*mod_inv(fact(r,in_mod),in_mod))%in_mod)*mod_inv(fact(n-r,in_mod),in_mod))%in_mod;
}
int val[10][200005];
const int M = 200005;
void solve()
{
//write code here
string s;
cin>>s;
int m;
cin>>m;
int cnt[10]={};
for(int i=0;i<s.size();i++){
cnt[s[i]-'0']++;
}
int ans=0;
for(int i=0;i<10;i++){
ans+=(val[i][m]*cnt[i])%mod;
ans%=mod;
}
cout<<ans<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(10);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
auto clk=clock();
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// -------------------------------------Code starts here---------------------------------------------------------------------
for(int d=0;d<10;d++){
int cnt[10]={};
cnt[d]=1;
for(int i=1;i<M;i++){
int temp[10]={};
for(int j=0;j<9;j++){
temp[j+1]=cnt[j]%mod;
}
temp[0]+=cnt[9];
temp[0]%=mod;
temp[1]+=cnt[9];
temp[1]%=mod;
int tot=0;
for(int j=0;j<10;j++) {
cnt[j]=temp[j];
tot+=cnt[j];
tot%=mod;
}
val[d][i]=tot;
}
}
int t=1;
cin>>t;
for(int test=1;test<=t;test++)
{
// cout<<"Case #"<<test<<": ";
// cout<<endl;
solve();
// cout<<endl;
}
// -------------------------------------Code ends here------------------------------------------------------------------
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((long double)clk)/CLOCKS_PER_SEC << "\n";
return 0;
}
/*
1.do not use bitshift (1<<int) because it gives value in int and not in long long
2.check that for loops of i,j,k are properly declared
3.donot delete elements from map,set while looping in it
4.in a map's vector ,ie,map<int,vector<int>> mp,when you sort each vector in a loop it may not get sorted outside the scope of the loop so take care
*/
| 9 |
CPP
|
from sys import stdin
input=stdin.readline
mod=10**9+7
def add(a,b):return ((a%mod) + (b%mod))%mod
dp=[1]*(2*(10**5) + 10)
for i in range(10,2* (10**5) + 10):
dp[i]=add(dp[i-9],dp[i-10])
def answer():
ans=0
for i in str(n):
ans=add(ans,dp[m+int(i)])
return ans
for T in range(int(input())):
n,m=map(int,input().strip().split())
print(answer())
| 9 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.