This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
ll n, q;
ll p[100009];
ll pre[100009];
ll inf = 10000005LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
cin >> n >> q;
ll tot = 1;
for(ll i = 0; i < n; ++i){
cin >> p[i];
}
reverse(p, p+n);
for(ll i = 1; i < n; ++i){
p[i] *= p[i-1];
p[i] = min(p[i], inf);
}
while(q--){
ll x;
cin >> x;
ll l = 0, r = n;
while(l < r){
ll mid = (l+r)/2;
if(p[mid] > x)
r = mid;
else
l = mid+1;
}
if(l == n)
cout << "oo\n";
else
cout << l+2 << "\n";
}
}
Compilation message (stderr)
brunhilda.cpp: In function 'int main()':
brunhilda.cpp:27:8: warning: unused variable 'tot' [-Wunused-variable]
27 | ll tot = 1;
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |