提出 #48787567
ソースコード 拡げる
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//template
using ll = long long;
using ull = unsigned long long;
const int inf = INT_MAX/2;
const ll infl = LONG_MAX/2;
#define OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME
#define REP1(i, b) for (ll i = 0, i##_len = ll(b); i < i##_len; i++)
#define REP2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i < i##_len; i++)
#define REP3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i < i##_len; i += ll(c))
#define rep(...) OVERLOAD(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define REPS1(i, b) for (ll i = 0, i##_len = ll(b); i <= i##_len; i++)
#define REPS2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i <= i##_len; i++)
#define REPS3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i <= i##_len; i += ll(c))
#define reps(...) OVERLOAD(__VA_ARGS__, REPS3, REPS2, REPS1)(__VA_ARGS__)
#define RREP1(i, a) for (ll i = ll(a); i >= 0; i--)
#define RREP2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i >= i##_len; i--)
#define RREP3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i >= i##_len; i -= ll(c))
#define rrep(...) OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)
#define vrep(i, vec) for (auto &i: vec)
#define all(x) (x).begin(), (x).end()
#define Yes(bool) if(bool) {println("Yes");} else {println("No");}
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117;
template<class T> double rad(const T theta) { return theta*pi/180; }
ll mpow(ll x, ll n) { ll ret = 1; while (n > 0) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; }
void printd() { cout << '\n'; } template<class T, class... Ts> void printd(const T& a, const Ts&... b) { cout << setprecision(20) << a; if (sizeof...(b) != 0) {cout << ' ';}; printd(b...); }
void println() { cout << '\n'; } template<class T, class... Ts> void println(const T& a, const Ts&... b) { cout << a; if (sizeof...(b) != 0) {cout << ' ';}; println(b...); }
void print() {} template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; if (sizeof...(b) != 0) {cout << ' ';}; print(b...); }
template<class T> void printv(const T vec) { int i = 0; int s = vec.size(); vrep(v, vec) { print(v); i++; if (i != s) print(' '); } println(); }
template<class T> void printvv(const T vec) { vrep(v, vec) { printv(v); } }
void in() {} template<class T, class... Ts> void in(T& a, Ts&... b) { cin >> a; in(b...); }
int main() {
ll N, Q;
in(N, Q);
vector<ll> R(N);
vector<ll> s(N+1, 0);
rep(i, N) in(R[i]);
sort(all(R));
rep(i, N) s[i+1] = s[i]+R[i];
rep(i, Q) {
ll X;
in(X);
auto p = upper_bound(all(s), X) - s.begin();
println(p-1);
}
return 0;
}
提出情報
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
400 / 400 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
sample00.txt, sample01.txt, sample02.txt |
| All |
sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| sample00.txt |
AC |
1 ms |
3516 KiB |
| sample01.txt |
AC |
1 ms |
3704 KiB |
| sample02.txt |
AC |
1 ms |
3568 KiB |
| testcase00.txt |
AC |
330 ms |
6364 KiB |
| testcase01.txt |
AC |
341 ms |
6336 KiB |
| testcase02.txt |
AC |
335 ms |
6004 KiB |
| testcase03.txt |
AC |
340 ms |
6328 KiB |
| testcase04.txt |
AC |
320 ms |
6096 KiB |
| testcase05.txt |
AC |
341 ms |
6280 KiB |
| testcase06.txt |
AC |
340 ms |
6300 KiB |
| testcase07.txt |
AC |
340 ms |
6316 KiB |
| testcase08.txt |
AC |
271 ms |
6008 KiB |
| testcase09.txt |
AC |
300 ms |
6320 KiB |
| testcase10.txt |
AC |
317 ms |
6020 KiB |
| testcase11.txt |
AC |
320 ms |
6360 KiB |
| testcase12.txt |
AC |
311 ms |
6112 KiB |
| testcase13.txt |
AC |
320 ms |
6268 KiB |
| testcase14.txt |
AC |
312 ms |
6080 KiB |
| testcase15.txt |
AC |
330 ms |
6280 KiB |
| testcase16.txt |
AC |
313 ms |
6284 KiB |
| testcase17.txt |
AC |
329 ms |
6340 KiB |
| testcase18.txt |
AC |
305 ms |
6348 KiB |
| testcase19.txt |
AC |
328 ms |
6276 KiB |
| testcase20.txt |
AC |
322 ms |
6164 KiB |
| testcase21.txt |
AC |
330 ms |
6316 KiB |
| testcase22.txt |
AC |
325 ms |
6264 KiB |
| testcase23.txt |
AC |
329 ms |
6348 KiB |