142082025-01-10 09:30:00GundischBalazsZenehallgatáscpp17Time limit exceeded 15/50300ms820 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> szamok;
    szamok.resize(n);
    long long osszeg = 0;
    for(int i = 0; i < n; i++){
        cin >> szamok[i];
        osszeg+=szamok[i];
    }
    int x,p=1;
    for (int i = 0; i < k; i++){
        cin >> x;
        if(p >= 10){
            x = x - p*osszeg;
        }
        while(x > osszeg){
            x = x - osszeg;
            p=p*10;
        }
        int hossz = szamok[0],j = 1;
        while(hossz < x){
            hossz+=szamok[j];
            j++;
        }
        cout << j << " ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0284ms816 KiB
3Accepted2/24ms500 KiB
4Accepted2/24ms316 KiB
5Accepted2/24ms316 KiB
6Accepted3/314ms316 KiB
7Accepted3/323ms508 KiB
8Accepted3/394ms316 KiB
9Time limit exceeded0/2300ms804 KiB
10Time limit exceeded0/2224ms804 KiB
11Time limit exceeded0/2225ms820 KiB
12Time limit exceeded0/2282ms820 KiB
13Time limit exceeded0/2215ms820 KiB
14Time limit exceeded0/2287ms820 KiB
15Time limit exceeded0/2280ms820 KiB
16Time limit exceeded0/2284ms808 KiB
17Time limit exceeded0/2277ms820 KiB
18Time limit exceeded0/2291ms820 KiB
19Time limit exceeded0/2287ms820 KiB
20Time limit exceeded0/2270ms820 KiB
21Time limit exceeded0/2286ms820 KiB
22Time limit exceeded0/3291ms820 KiB
23Time limit exceeded0/3284ms800 KiB
24Time limit exceeded0/3282ms820 KiB