1594 | 2022. 11. 28 18:46:49 | kicsiboglar | Zenehallgatás | cpp11 | Accepted 50/50 | 46ms | 6928 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long n,m,k,i,a,sum,j;
int main()
{
ios::sync_with_stdio(false);
cin>>n>>m;
vector <int> x(n+2,0);
vector <int>::iterator it;
x[0]=0;
for (i=1;i<=n;++i)
{
cin>>a;
x[i]=x[i-1]+a;
sum+=a;
}
vector <pair<int,int> > y(m+1,{0,0});
vector <int> megold(m+1);
for (i=1;i<=m;++i)
{
cin>>k;
k=k%sum;
/* it=lower_bound(x.begin()+1,x.end(),k);
cout<<it-x.begin()<<" ";*/
y[i]={k,i};
}
sort(y.begin()+1,y.end());
i=1;
j=1;
while (i<=n&&j<=m)
{
if (y[j].first<=x[i])
{
megold[y[j].second]=i;
j++;
}
else i++;
}
for (i=1;i<=m;++i) cout<<megold[i]<<" ";
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Accepted | 0/0 | 3ms | 1824 KiB | |||
2 | Accepted | 0/0 | 46ms | 5112 KiB | |||
3 | Accepted | 2/2 | 2ms | 2116 KiB | |||
4 | Accepted | 2/2 | 2ms | 2120 KiB | |||
5 | Accepted | 2/2 | 3ms | 2248 KiB | |||
6 | Accepted | 3/3 | 3ms | 2604 KiB | |||
7 | Accepted | 3/3 | 3ms | 2644 KiB | |||
8 | Accepted | 3/3 | 2ms | 2608 KiB | |||
9 | Accepted | 2/2 | 46ms | 5648 KiB | |||
10 | Accepted | 2/2 | 46ms | 5888 KiB | |||
11 | Accepted | 2/2 | 46ms | 5968 KiB | |||
12 | Accepted | 2/2 | 46ms | 5960 KiB | |||
13 | Accepted | 2/2 | 46ms | 6164 KiB | |||
14 | Accepted | 2/2 | 46ms | 6372 KiB | |||
15 | Accepted | 2/2 | 46ms | 6368 KiB | |||
16 | Accepted | 2/2 | 46ms | 6696 KiB | |||
17 | Accepted | 2/2 | 46ms | 6712 KiB | |||
18 | Accepted | 2/2 | 46ms | 6916 KiB | |||
19 | Accepted | 2/2 | 45ms | 6928 KiB | |||
20 | Accepted | 2/2 | 45ms | 6912 KiB | |||
21 | Accepted | 2/2 | 45ms | 6912 KiB | |||
22 | Accepted | 3/3 | 46ms | 6908 KiB | |||
23 | Accepted | 3/3 | 45ms | 6908 KiB | |||
24 | Accepted | 3/3 | 45ms | 6928 KiB |