text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int mod = 1e9 + 7;
long long Mod(long long x) { return x >= mod ? x - mod : x; }
long long read() {
long long x = 0;
int f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
return x * f;
}
void print(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) print(x / 10);
putchar(x % 10 + '0');
}
const int N = 100010;
map<int, vector<int> > v[N];
set<int> s[N];
int fa[N];
int getf(int u) { return fa[u] == u ? u : fa[u] = getf(fa[u]); }
void merge(int u, int v) {
u = getf(u), v = getf(v);
if (u != v) {
if (s[u].size() < s[v].size()) swap(u, v);
for (int i : s[v]) s[u].insert(i);
fa[v] = u;
}
}
void add_edge() {
int x = read(), y = read(), w = read();
s[getf(x)].insert(y), s[getf(y)].insert(x);
v[x][w].push_back(y), merge(y, v[x][w][0]);
v[y][w].push_back(x), merge(x, v[y][w][0]);
}
void query() {
int x = read(), y = read();
if (getf(x) == getf(y) || s[getf(x)].count(y))
puts("Yes");
else
puts("No");
}
int n, m, q;
int main() {
n = read(), m = read(), read(), q = read();
for (int i = 1; i <= n; i++) fa[i] = i;
while (m--) add_edge();
while (q--) {
char s[10];
scanf("%s", s);
if (s[0] == '?')
query();
else
add_edge();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct bian {
int to, nxt, va;
} bi[400040];
int n, m, c, q, siz, head[100010], num, tot, f[100010], id[100010], idnum,
d[100010];
int query[100010][4];
bitset<700> lt[100010];
map<int, int> mp[100010];
void add(int from, int to, int va) {
bi[++num].nxt = head[from];
head[from] = num;
bi[num].to = to;
bi[num].va = va;
}
int find(int x) {
if (x != f[x]) return f[x] = find(f[x]);
return x;
}
int main() {
scanf("%d %d %d %d", &n, &m, &c, &q);
int x, y, z;
for (int i = 1; i <= m; ++i) {
scanf("%d %d %d", &x, &y, &z);
add(x, y, z);
++d[x];
add(y, x, z);
++d[y];
}
tot = 2 * m;
char op;
for (int i = 1; i <= q; ++i) {
scanf(" %c", &op);
if (op == '+') {
scanf("%d %d %d", &x, &y, &z);
query[i][1] = x, query[i][2] = y, query[i][3] = z;
++d[x], ++d[y];
tot += 2;
} else {
scanf("%d %d", &x, &y);
query[i][0] = 1, query[i][1] = x, query[i][2] = y;
}
}
siz = sqrt(tot);
for (int i = 1; i <= n; ++i) f[i] = i;
for (int i = 1; i <= n; ++i)
if (d[i] >= siz) {
id[i] = ++idnum;
for (int j = head[i]; j; j = bi[j].nxt) lt[bi[j].to].set(idnum);
}
for (int i = 1; i <= n; ++i)
for (int j = head[i]; j; j = bi[j].nxt) {
if (mp[i].count(bi[j].va)) {
x = find(bi[j].to), y = find(mp[i][bi[j].va]);
if (x != y) lt[y] |= lt[x], f[x] = y;
} else
mp[i][bi[j].va] = bi[j].to;
}
for (int i = 1; i <= q; ++i) {
if (query[i][0]) {
x = query[i][1], y = query[i][2];
if (find(x) == find(y)) {
printf("Yes\n");
continue;
}
bool flag = 0;
if (d[y] < siz) {
for (int j = head[y]; j; j = bi[j].nxt)
if (find(x) == find(bi[j].to)) {
flag = 1;
break;
}
} else
flag = lt[find(x)][id[y]];
if (flag)
printf("Yes\n");
else
printf("No\n");
} else {
x = query[i][1], y = query[i][2], z = query[i][3];
add(x, y, z), add(y, x, z);
if (id[y]) lt[find(x)].set(id[y]);
if (id[x]) lt[find(y)].set(id[x]);
if (mp[x][z]) {
if (find(mp[x][z]) != find(y)) {
lt[find(y)] |= lt[find(mp[x][z])];
f[find(mp[x][z])] = find(y);
}
} else
mp[x][z] = y;
swap(x, y);
if (mp[x][z]) {
if (find(mp[x][z]) != find(y)) {
lt[find(y)] |= lt[find(mp[x][z])];
f[find(mp[x][z])] = find(y);
}
} else
mp[x][z] = y;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q, a[200000];
set<int> b[200000];
map<int, int> v[200000];
int find(int x) {
if (a[x] == x) return x;
a[x] = find(a[x]);
return a[x];
}
void merge(int x, int y) {
if (x == y) return;
if (x == 0 || y == 0) return;
if (b[x].size() > b[y].size()) swap(x, y);
for (int i : b[x]) b[y].insert(i);
a[x] = y;
}
void add(int x, int y, int z) {
int xx = find(x), yy = find(y);
b[xx].insert(y);
b[yy].insert(x);
merge(find(x), find(v[y][z]));
merge(find(y), find(v[x][z]));
v[x][z] = y;
v[y][z] = x;
}
int check(int x, int y) {
if (find(x) == find(y)) return 1;
return b[find(x)].count(y);
}
int main() {
scanf("%d%d%d%d", &n, &m, &q, &q);
for (int i = 1; i <= n; i++) a[i] = i;
for (int i = 1; i <= m; i++) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
add(x, y, z);
}
for (int i = 1; i <= q; i++) {
int x, y, z;
char ch = ' ';
while (ch != '+' && ch != '?') scanf("%c", &ch);
if (ch == '+') {
scanf("%d%d%d", &x, &y, &z);
add(x, y, z);
} else {
scanf("%d%d", &x, &y);
if (check(x, y))
puts("Yes");
else
puts("No");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, m;
cin >> n >> m;
long long a[n], i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long time[101] = {0};
long long sum = 0;
for (i = 0; i < n; i++) {
sum += a[i];
long long ans = 0;
if (sum <= m) {
cout << ans << " ";
time[a[i]]++;
continue;
}
long long sum1 = sum;
for (long long t = 100; t >= 1; t--) {
if (sum1 - t * time[t] <= m) {
if ((sum1 - m) % t == 0)
ans += (sum1 - m) / t;
else
ans += (sum1 - m) / t + 1;
break;
}
ans += time[t];
sum1 -= t * time[t];
}
cout << ans << " ";
time[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char to_upper(char x) {
if (97 <= int(x) && int(x) <= 126)
return char(x - 32);
else if (65 <= int(x) && int(x) <= 90)
return x;
}
char to_lower(char x) {
if (97 <= int(x) && int(x) <= 126)
return x;
else if (65 <= int(x) && int(x) <= 90)
return char(x + 32);
}
int numerize(char x) {
if (48 <= int(x) && int(x) <= 57)
return int(x - '0');
else if (97 <= int(x) && int(x) <= 126)
return int(x - 96);
else if (65 <= int(x) && int(x) <= 90)
return int(x - 64);
}
long long n, m, t[300000], sum[300000], f[300];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> t[i];
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + t[i];
long long time = sum[i];
long long need = time - m;
long long ans = 0;
for (int i = 100; i >= 1; i--) {
if (need <= 0) break;
long long z = f[i];
long long x;
if (i * z >= need) {
x = need / i;
ans += x;
if (need % i > 0) ans++;
break;
} else {
ans += z;
need -= i * z;
}
}
cout << ans << " ";
f[t[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
int sum = 0;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
sum += v;
int c = 0;
int l = sum;
for (int j = 100; l > M; j--) {
int r = (l - M + j - 1) / j;
int k = min(r, cnt[j]);
c += k;
l -= k * j;
}
cout << c << ' ';
cnt[v]++;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, lim, t[200005];
long long tim[105];
long long pref[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long i, j;
cin >> n >> lim;
memset(tim, 0, sizeof tim);
for (i = 0; i < n; i++) {
cin >> t[i];
if (i)
pref[i] = pref[i - 1] + t[i];
else
pref[i] = t[i];
}
for (i = 0; i < n; i++) {
long long issepehle = pref[i] - t[i];
if (issepehle + t[i] <= lim) {
tim[t[i]]++;
cout << 0 << " ";
continue;
}
long long cnt = 0;
for (j = 100; j > 0; j--) {
if (issepehle + t[i] - (tim[j] * j) > lim) {
cnt += tim[j];
issepehle -= (tim[j] * j);
} else {
cnt += (((issepehle + t[i] - lim) / j));
cnt += ((issepehle + t[i] - lim) % j != 0);
break;
}
}
tim[t[i]]++;
cout << cnt << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n), p(n), v;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += a[i];
p[i] = c;
}
int k = 0, l, x;
vector<int> u(101, 0);
for (int i = 0; i < n; i++) {
l = 0;
if (p[i] <= m) {
v.push_back(0);
} else {
k = p[i];
x = k - m;
for (int j = 100; j > 0; j--) {
if (x <= (j * u[j])) {
l += (x + (j - 1)) / j;
v.push_back(l);
break;
} else {
x -= (j * u[j]);
l += u[j];
}
}
}
u[a[i]]++;
}
for (auto &ele : v) {
cout << ele << " ";
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
long long int a[N], pref[N], h[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n, sum;
cin >> n >> sum;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
if (pref[i] <= sum) {
cout << 0 << " ";
} else {
long long int diff = pref[i] - sum;
long long int ans = 0, ct = 0;
for (int j = 100; j >= 1; j--) {
if (h[j]) {
if ((ct + (j * h[j])) <= diff) {
ct += (j * h[j]);
ans += h[j];
} else {
long long int tt = ((diff - ct) + (j - 1)) / j;
ans += tt;
ct += tt * j;
}
}
if (ct >= diff) break;
}
cout << ans << " ";
}
h[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t[200005], prefix_sum[200005], ans[200005], f[105];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i <= 100; i++) f[i] = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
if (i == 0)
prefix_sum[i] = t[i];
else
prefix_sum[i] = t[i] + prefix_sum[i - 1];
}
for (int i = 0; i < n; i++) {
if (prefix_sum[i] <= m) {
ans[i] = 0;
} else {
ans[i] = 0;
for (int j = 100; j >= 1; j--) {
if (prefix_sum[i] - j * f[j] <= m) {
int temp = (prefix_sum[i] - m) / j;
if (prefix_sum[i] - temp * j == m)
ans[i] += temp;
else {
ans[i] += (temp + 1);
}
break;
} else {
ans[i] += f[j];
prefix_sum[i] -= (j * f[j]);
}
}
}
f[t[i]]++;
}
for (int i = 0; i < n; i++) cout << ans[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long double PI = 4 * atan((long double)1);
void Init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int frq[107];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x, tp = m, ct = 0;
cin >> x;
tp -= x;
for (int j = 1; j <= 100; j++) {
if (frq[j] * j >= tp) {
ct += (tp / j);
break;
} else {
tp -= (frq[j] * j);
ct += frq[j];
}
}
frq[x]++;
cout << (i - ct);
(i == n - 1) ? cout << endl : cout << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T lcm(T a, T b) {
return a / __gcd(a, b) * b;
}
template <class T>
inline T bigmod(T p, T e, T M) {
T ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class string>
long long int strton(string s) {
long long int won;
stringstream ss;
ss << s;
ss >> won;
return won;
}
template <class T>
string ntostr(T n) {
stringstream ss;
ss << n;
return ss.str();
}
template <class T>
inline T mod(T n, T m) {
return (n % m + m) % m;
}
template <class T>
bool isprime(T n) {
if (n % 2 == 0) {
if (n == 2)
return true;
else
return false;
}
T m = sqrt(n);
for (T i = 3; i <= m; i += 2) {
if (n % i == 0) return false;
}
return true;
}
bool isvowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
return true;
return false;
}
double triangle_area1(double a, double b, double c) {
double s = (a + b + c) * 0.5;
return sqrt(s * (s - a) * (s - b) * (s - c));
}
double triangle_area2(double x1, double y1, double x2, double y2, double x3,
double y3) {
return 0.5 * abs(x1 * y2 + x2 * y3 + x3 * y1 - x2 * y1 - x3 * y2 - x1 * y3);
}
double circle_area(double r, double theta) {
return (theta * (2.0 * acos(0.0)) * r * r) / (2 * (2.0 * acos(0.0)));
}
double quad_area(double x1, double y1, double x2, double y2, double x3,
double y3, double x4, double y4) {
return 0.5 * abs(x1 * y2 + x2 * y3 + x3 * y4 + x4 * y1 - x2 * y1 - x3 * y2 -
x4 * y3 - x1 * y4);
}
double cosangle(double a, double b, double c) {
return acos((double)(b * b + c * c - a * a) / (double)(2 * b * c));
}
long long int Set(long long int N, long long int pos) {
return N = N | (1ll << pos);
}
long long int reset(long long int N, long long int pos) {
return N = N & ~(1ll << pos);
}
bool check(long long int N, long long int pos) {
return (bool)(N & (1ll << pos));
}
long long int n, m, a, sm = 0, cnt[105];
int main() {
scanf("%lld%lld", &n, &m);
for (long long int i = 0; i < n; i++) {
scanf("%lld", &a);
sm += a;
long long int rem = sm - m, ans = 0;
for (long long int j = 100; j > 0; j--) {
if (cnt[j] == 0) continue;
if (rem <= 0) break;
long long int x = rem / j;
if (rem % j) x++;
long long int y = min(cnt[j], x);
ans += y;
rem -= y * j;
}
if (i) printf(" ");
printf("%lld", ans);
cnt[a]++;
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
vector<long long> v;
cout << 0 << " ";
long long sum = arr[0];
v.push_back(arr[0]);
vector<long long> a;
long long c = 0;
for (long long i = 1; i < n; i++) {
sum = sum + arr[i];
if (sum <= m) {
cout << c << " ";
v.push_back(arr[i]);
push_heap(v.begin(), v.end());
} else {
while (sum > m) {
sum = sum - v[0];
pop_heap(v.begin(), v.end());
long long k = v.back();
v.pop_back();
a.push_back(k);
push_heap(a.begin(), a.end(), greater<int>());
c++;
}
cout << c << " ";
if (!a.empty()) {
if (arr[i] < a[0]) {
v.push_back(arr[i]);
push_heap(v.begin(), v.end());
} else {
sum = sum - arr[i];
while (!a.empty()) {
sum = sum + a[0];
if (sum > m) {
sum = sum - a[0];
break;
}
pop_heap(a.begin(), a.end(), greater<int>());
long long k = a.back();
a.pop_back();
v.push_back(k);
push_heap(v.begin(), v.end());
c--;
}
a.push_back(arr[i]);
push_heap(a.begin(), a.end(), greater<int>());
c++;
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200100];
long long w[200];
int main() {
ios::sync_with_stdio(false);
long long n, t;
cin >> n >> t;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
multiset<long long> al;
long long tot = 0;
for (int i = 0; i < n; i++) {
tot += a[i];
if (tot <= t) {
cout << 0 << " ";
} else {
long long fmn = tot - t;
long long sol = 0;
for (long long j = 100; j >= 1 && fmn > 0; j--) {
if (w[j] > 0) {
long long b = fmn / j;
if (fmn % j != 0) b++;
if (b <= w[j]) {
sol += b;
fmn -= (b * j);
break;
} else {
fmn -= (w[j] * j);
sol += w[j];
}
}
}
cout << sol << " ";
}
w[a[i]]++;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long t[n];
for (long long i = 0; i < n; i++) {
cin >> t[i];
}
long long ans[n];
long long sum = 0;
priority_queue<long long> p;
priority_queue<long long, vector<long long>, greater<long long> > w;
for (long long i = 0; i < n; i++) {
if (sum + t[i] <= m) {
p.push(t[i]);
sum = sum + t[i];
ans[i] = i + 1 - p.size();
} else {
while (sum > (m - t[i])) {
w.push(p.top());
sum = sum - p.top();
p.pop();
}
ans[i] = i - p.size();
w.push(t[i]);
while (sum <= m) {
if (sum + w.top() > m)
break;
else {
sum = sum + w.top();
p.push(w.top());
w.pop();
}
}
}
cout << ans[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long m;
vector<long long> v;
multiset<long long> ms;
long long cur = 0;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
v.resize(n);
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i < n; i++) {
cur += v[i];
if (cur <= m) {
cout << (i + 1) - ms.size() - 1 << " ";
ms.insert(v[i]);
continue;
}
vector<long long> tmp;
multiset<long long>::iterator it;
while (cur > m) {
it = ms.end();
it--;
tmp.push_back(*it);
cur -= *it;
ms.erase(it);
}
cout << (i + 1) - ms.size() - 1 << " ";
for (int i = 0; i < tmp.size(); i++) ms.insert(tmp[i]), cur += tmp[i];
ms.insert(v[i]);
while (cur >= m) {
it = ms.end();
it--;
cur -= *it;
ms.erase(it);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], id[N], ans[N];
int sum[4 * N], num[4 * N];
int n, m;
int getid(int x) { return lower_bound(b + 1, b + 1 + n, x) - b; }
int qu(int id, int l, int r, int ql, int qr, int ty) {
if (ql <= l && r <= qr) {
if (ty == 1)
return sum[id];
else
return num[id];
}
int mid = l + r >> 1;
int ans = 0;
if (ql <= mid) ans += qu(id << 1, l, mid, ql, qr, ty);
if (qr > mid) ans += qu(id << 1 | 1, mid + 1, r, ql, qr, ty);
return ans;
}
void up(int id, int l, int r, int pos, int val) {
if (l == r) {
num[id]++;
sum[id] += val;
return;
}
int mid = l + r >> 1;
if (pos <= mid)
up(id << 1, l, mid, pos, val);
else
up(id << 1 | 1, mid + 1, r, pos, val);
sum[id] = sum[id << 1] + sum[id << 1 | 1];
num[id] = num[id << 1] + num[id << 1 | 1];
}
int main() {
cin >> n >> m;
for (int i = 1; i <= (n); ++i) {
cin >> a[i];
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
for (int i = 1; i <= (n); ++i) id[i] = getid(a[i]);
int ss = 0;
for (int i = 1; i <= (n); ++i) {
if (ss + a[i] > m) {
int l = 1, r = n;
int id1 = -1;
int tt = 0;
int t1 = 0, t2 = 0;
while (l <= r) {
int mid = l + r >> 1;
int qunum = qu(1, 1, n, mid, n, 1);
if (ss - qunum + a[i] <= m) {
l = mid + 1;
tt = qunum;
id1 = mid;
} else
r = mid - 1;
}
t2 = qu(1, 1, n, id1, n, 2);
int j = b[id1];
t1 = ceil(1.0 * ((ss - tt + a[i]) - m) / j);
ans[i] = t1 + t2;
}
up(1, 1, n, id[i], a[i]);
ss += a[i];
}
for (int i = 1; i <= (n); ++i) printf("%d ", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int a[200010], num[200010], dig[111];
int main() {
int n, m;
cin >> n >> m;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
if (sum <= m)
num[i] = 0;
else {
long long ans = sum - m;
int p = 0;
set<int>::reverse_iterator it;
for (it = s.rbegin(); it != s.rend(); it++) {
if (dig[*it] * (*it) < ans) {
p += dig[*it];
ans -= dig[*it] * (*it);
} else {
if (ans % (*it) == 0)
p += ans / (*it);
else
p += ((ans / (*it)) + 1);
num[i] = p;
break;
}
}
}
s.insert(a[i]);
dig[a[i]]++;
}
for (int i = 1; i <= n; i++) {
if (i == 1)
cout << num[i];
else
cout << " " << num[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> m1(n);
vector<int> kol(101, 0);
for (int i = 0; i < n; i++) {
cin >> m1[i];
}
vector<int> ans(n, 0);
for (int i = 0; i < n; i++) {
int val = m1[i];
if (m - val >= 0) {
m -= val;
kol[val]++;
continue;
}
int col = 0;
int raz = val - m;
m -= val;
int sum = 0;
for (int j = 100; j > 0; j--) {
if (sum + j * kol[j] < raz) {
col += kol[j];
sum += j * kol[j];
continue;
}
int ch = raz - sum;
if (ch == 0) {
ans[i] = col + kol[j];
break;
}
col += ch % j == 0 ? ch / j : ch / j + 1;
ans[i] = col;
break;
}
kol[val]++;
}
for (auto el : ans) {
cout << el << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arrt[101] = {0};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
priority_queue<int> pq;
int n, m;
cin >> n >> m;
int res[n];
int sum = 0;
for (int p = 0; p < n; p++) {
int k;
cin >> k;
res[p] = 0;
sum += k;
int s = sum;
if (sum > m) {
int i = 100;
while (i >= 1 && s - arrt[i] * i > m) {
s = s - arrt[i] * i;
res[p] = res[p] + arrt[i];
i--;
}
if (i > 0) {
s -= m;
if (s % i != 0) res[p]++;
res[p] += s / i;
}
}
arrt[k]++;
}
for (int i = 0; i < n; i++) cout << res[i] << " ";
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, i, j, a[200005], sum, siz, temp, cnt, x, diff, mx;
map<long long int, long long int> ma;
scanf("%lld %lld ", &n, &m);
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
for (i = 1; i <= 100; i++) ma[i] = 0;
sum = 0;
cnt = 0;
for (i = 0; i < n; i++) {
sum = sum + a[i];
if (sum <= m) {
printf("0 ");
ma[a[i]]++;
} else {
temp = sum;
cnt = 0;
for (j = 100; j >= 1 && temp > m; j--) {
if (ma[j] == 0)
continue;
else {
diff = temp - m;
mx = j * ma[j];
if (mx < diff) {
temp = temp - j * ma[j];
cnt = cnt + ma[j];
} else {
x = diff / j;
temp = temp - x * j;
cnt = cnt + x;
if (x < ma[j] && temp > m) {
temp = temp - j;
cnt++;
}
}
}
}
printf("%lld ", cnt);
ma[a[i]]++;
}
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int arr[n];
int cnt[101] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long long int t = 0;
int i = 0;
while (i < n && t + arr[i] < m) {
t += arr[i];
cnt[arr[i]]++;
cout << "0"
<< " ";
i++;
}
while (i < n) {
t += arr[i];
int extra = t - m;
int temp[101] = {0};
for (int j = 100; j > 0; j--) {
temp[j] = cnt[j];
}
int j = 100;
int ans = 0;
while (extra > 0) {
if (temp[j] > 0) {
if (extra - (j * temp[j]) >= 0) {
extra = extra - (j * temp[j]);
ans += temp[j];
temp[j] = 0;
} else {
ans += (extra / j);
if (extra % j > 0) {
ans += 1;
}
extra = extra - ans * j;
}
} else
j--;
}
cnt[arr[i]]++;
cout << ans << " ";
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 110;
int freq[MX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int cnt = 0, sum = 0;
for (int j = 1; j < MX; j++) {
if (sum + freq[j] * j + x <= m) {
sum += freq[j] * j;
cnt += freq[j];
} else {
int k = max(0, m - x - sum) / j;
assert(sum + k * j + x <= m);
sum += k * j;
cnt += k;
break;
}
}
cout << i - cnt << " ";
freq[x]++;
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 212345;
const int P = 1000000007;
const int INF = 1123456;
const double EPS = 1e-6;
const double PI = 3.14159265358979;
long long freq[112];
long long elem[MAX];
int n, m;
int compute(long long sum) {
int total = 0;
for (int i = 100; i >= 1 && sum > m; i--) {
long long d = sum - m;
long long t = d / i;
if (i * t < d) t++;
total += min(freq[i], t);
sum -= min(freq[i], t) * i;
}
return total;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lld", &elem[i]);
}
long long sum = 0;
memset(freq, 0, sizeof(freq));
for (int i = 0; i < n; i++) {
if (i) printf(" ");
sum += elem[i];
printf("%d", compute(sum));
freq[elem[i]]++;
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
if (!b) return a;
return GCD(b, a % b);
}
long long Count_Digit(long long x) {
if (!x) return 0;
return Count_Digit(x / 10) + 1;
}
int a[101] = {0};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n, m, t, sum = 0, k, p;
cin >> n >> m;
for (long long i = 0; i < n; i++) {
cin >> t;
sum += t;
if (sum > m) {
k = 0;
p = sum;
int j = 100;
while (p > m) {
int q = ceil(float(p - m) / float(j));
if (q <= a[j]) {
k += q;
break;
} else {
k += a[j];
p -= j * a[j];
}
j--;
}
cout << k << " ";
} else
cout << 0 << " ";
a[t]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, num, arr[110], T;
int main() {
scanf("%d %d", &n, &T);
for (int i = 1; i <= n; i++) {
scanf("%d", &num);
int x = T - num;
int sum = 0, cnt = 0;
for (int j = 1; j <= 100; j++) {
if (sum + j <= x && arr[j] > 0) {
int p = min(((x - sum) / j), arr[j]);
sum += p * j;
cnt += p;
} else {
}
}
printf("%d ", i - 1 - cnt);
arr[num]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long add(long long a, long long b) { return (a + b) % MOD; }
long long sub(long long a, long long b) { return ((a - b) % MOD + MOD) % MOD; }
long long mul(long long a, long long b) { return (a * b) % MOD; }
long long a[800000], tim[200];
set<long long> se;
long long n, m;
bool check(long long x, long long s) {
long long mid = x;
long long p = -1, sum = 0;
for (int i = 100; i >= 1; i--) {
if (tim[i] <= x)
x -= tim[i];
else if (tim[i] > x && p == -1) {
p = tim[i] - x;
x = -1;
sum += p * i;
} else if (p != -1) {
sum += i * tim[i];
}
}
if (m - sum >= a[s]) return true;
return false;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
long long l = 0, r = i + 1, mid, ans = LLONG_MAX;
while (l <= r) {
mid = (l + r) >> 1;
if (check(mid, i)) {
r = mid - 1;
ans = min(ans, mid);
} else
l = mid + 1;
}
cout << ans << " ";
tim[a[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
const int N = 101;
long long times[N];
long long getsteps(long long curr, long long m, long long n, long long cnt) {
long long res = 0;
long long s = 0, e = cnt;
while (s <= e) {
long long mid = s + (e - s) / 2;
if (curr - mid * n <= m) {
res = mid;
e = mid - 1;
} else {
s = mid + 1;
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
long long sum = 0, curr;
for (long long i = 0; i < n; i++) {
long long step = 0;
sum += a[i];
if (sum > m) {
curr = sum;
for (long long i = N - 1; i >= 0; i--) {
long long power = i * times[i];
if (curr - power > m) {
curr -= power;
step += times[i];
} else {
step += getsteps(curr, m, i, times[i]);
break;
}
}
}
times[a[i]]++;
cout << step << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int maxnn = 1e6 + 5;
int mod = 1e9 + 7;
int inf = 0x3f3f3f3f;
long long ese = 1e-6;
vector<int> vec[30];
map<int, int> mmp;
set<int>::iterator it;
struct Node {
long long n, num;
string s;
} Ans[maxn];
int pos[1000];
int sum[maxn << 2], a[maxn], b[maxn];
int cnt[maxn << 2];
int lowbit(int x) { return x & (-x); }
int getsum(int x) {
int ans = 0;
for (int i = x; i > 0; i -= lowbit(i)) ans += cnt[i];
return ans;
}
void updata1(int x, int val, int n) {
for (int i = x; i <= n + 5; i += lowbit(i)) cnt[i] += val;
}
void updata2(int rt, int l, int r, int x, int val) {
if (l == r) {
sum[rt] += val;
++cnt[rt];
return;
}
int mid = (l + r) >> 1;
if (x <= mid)
updata2(rt << 1, l, mid, x, val);
else
updata2(rt << 1 | 1, mid + 1, r, x, val);
sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
cnt[rt] = cnt[rt << 1] + cnt[rt << 1 | 1];
return;
}
int ANS = 0;
void query(int rt, int l, int r, int val) {
if (sum[rt] == val) {
ANS += cnt[rt];
return;
}
if (l == r) {
if (cnt[rt] == 0) return;
int tmp = sum[rt] / cnt[rt];
int x = 0, y = cnt[rt];
while (x <= y) {
int mid = (x + y) >> 1;
if (val < mid * tmp)
y = mid - 1;
else if (val > mid * tmp)
x = mid + 1;
else {
ANS += mid;
return;
}
}
ANS += y;
return;
}
int mid = (r + l) >> 1;
if (sum[rt << 1] > val)
query(rt << 1, l, mid, val);
else {
query(rt << 1 | 1, mid + 1, r, val - sum[rt << 1]);
ANS += cnt[rt << 1];
}
return;
}
long long mulit(long long base, long long k) {
long long ans = 1;
while (k) {
if (k & 1) ans = base * ans % mod;
base = base * base % mod;
k >>= 1;
}
return ans % mod;
}
int main() {
std::ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int tot = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
for (int i = 1; i <= n; ++i)
if (pos[b[i]] == 0) pos[b[i]] = ++tot;
for (int i = 1; i <= n; ++i) {
ANS = 0;
query(1, 1, tot, m - a[i]);
cout << i - ANS - 1 << " ";
updata2(1, 1, tot, pos[a[i]], a[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n, m, sum[107], i, j, id, x, tot, res, now, ans[N];
int main() {
cin >> n >> m;
for (id = 1; id <= n; ++id) {
cin >> x;
tot = now;
int& res = ans[id];
for (i = 100; i >= 1 && tot + x > m; --i)
if (sum[i]) {
if (tot - sum[i] * i + x > m) {
res += sum[i];
tot -= sum[i] * i;
} else {
j = tot + x - m;
res += j / i + (j % i != 0);
break;
}
}
now += x;
sum[x]++;
}
for (i = 1; i <= n; ++i) printf("%d ", ans[i]);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, M;
cin >> n >> M;
int a[n];
int fre[101] = {0};
map<long long int, int> mp;
for (int i = 0; i < n; i++) cin >> a[i];
vector<long long int> ans;
for (int i = 0; i < n; i++) {
if (i == 0) {
mp[a[i]]++;
ans.push_back(0);
} else {
bool f = 0;
long long int p = M - a[i];
long long int cou = 0;
for (auto j = mp.begin(); j != mp.end(); j++) {
int c = j->second;
long long int r = j->first;
if (p - (c * r) >= 0) {
p -= (c * r);
cou += c;
continue;
} else {
while (1) {
if (c > 0 && (p - r) >= 0) {
p -= r;
c--;
cou++;
} else
break;
}
}
if (c != 0) {
f = 1;
ans.push_back(i - cou);
break;
}
}
if (!f) ans.push_back(0);
mp[a[i]]++;
}
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, m;
cin >> n >> m;
long long int arr[n + 3];
for (long long int i = 0; i < n; i++) cin >> arr[i];
long long int sum = 0;
priority_queue<long long int> ank;
long long int cnt = 0;
for (long long int i = 0; i < n; i++) {
sum += arr[i];
vector<long long int> bha;
if (sum <= m) {
cout << cnt << " ";
ank.push(arr[i]);
continue;
}
while (sum > m) {
long long int k = ank.top();
bha.push_back(k);
sum -= k;
cnt++;
ank.pop();
}
ank.push(arr[i]);
cout << cnt << " ";
for (long long int i = 0; i < bha.size(); i++) {
ank.push(bha[i]);
sum += bha[i];
cnt--;
}
while (sum > m) {
long long int k = ank.top();
bha.push_back(k);
sum -= k;
cnt++;
ank.pop();
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void _dbg(const char* _s, T _h) {
cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char* _s, T _h, Ts... _t) {
int _b = 0;
while (((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',') cerr << *_s++;
cerr << " = " << _h << ",";
_dbg(_s + 1, _t...);
}
int main() {
cin.tie(nullptr);
cout.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int pref = 0;
vector<int> cnt(101, 0);
for (int i = 0; i < n; ++i) {
int cur;
cin >> cur;
pref += cur;
if (pref <= m) {
cout << "0 ";
cnt[cur]++;
continue;
}
int res = 0;
int k = 100;
int tmp = pref;
while (tmp - cnt[k] * k > m) {
res += cnt[k];
tmp -= cnt[k] * k;
--k;
}
res += (tmp - m + k - 1) / k;
cout << res << ' ';
cnt[cur]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void setIO(string name = "") {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
if ((int)(name).size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int n, m, t[MAXN], sum;
int ct[105];
bool check(int i, int k) {
int cur = sum;
for (int j = 100; j >= 1; j--) {
if (ct[j]) {
int times = min(ct[j], k);
cur -= times * j;
k -= times;
}
}
return cur + t[i] <= m;
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> t[i];
}
for (int i = 1; i <= n; i++) {
int l = 0, r = i - 1;
int x = inf;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(i, mid)) {
r = mid - 1;
x = min(x, mid);
} else {
l = mid + 1;
}
}
cout << x << ' ';
sum += t[i];
ct[t[i]]++;
}
}
int main() {
setIO();
int tt = 1;
while (tt--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
long long n, m, a[maxn], b[maxn], ans, sum;
priority_queue<long long> T;
multiset<long long> H;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> m;
long long now = 0, num = 0, bf;
for (long long i = 1; i <= n; i++) {
long long x;
cin >> x;
now += x;
if (num) {
long long tt = T.top();
long long mmin = *H.begin();
if (tt > mmin) {
now -= tt;
now += mmin;
H.erase(H.begin());
H.insert(tt);
T.pop();
T.push(mmin);
while (1) {
mmin = *H.begin();
if (now + mmin <= m) {
H.erase(H.begin());
now += mmin;
T.push(mmin);
num--;
} else
break;
}
}
}
if (now <= m)
cout << num << " ";
else {
while (1) {
num++;
long long ttt = T.top();
now -= ttt;
H.insert(ttt);
T.pop();
if (now <= m) break;
}
cout << num << " ";
}
T.push(x);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, x = 0, c = 0, y, k, sum = 0, sum2, ans = 0, p;
cin >> n >> m;
vector<long long> v;
long long b[101] = {0};
for (j = 0; j < n; j++) {
x = 0;
c = 0;
ans = 0;
k = 0;
cin >> p;
sum += p;
if (sum <= m)
cout << "0 ";
else {
sum2 = sum;
for (i = 100; i > 0; i--) {
if (b[i] > 0) {
y = (sum2 - m) / i;
if ((sum2 - m) % i != 0) y++;
ans += min(y, b[i]);
if (y <= b[i]) {
break;
} else {
sum2 -= i * b[i];
}
}
}
cout << ans << " ";
}
b[p]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
class dop {
public:
long long int n, m, p, q, r, x;
vector<long long int> a, b;
void get();
};
void dop::get() {
cin >> n >> m;
for (long long int i = 0; i < n; i++) {
cin >> p;
a.push_back(p);
}
for (long long int i = 0; i < 100; i++) {
b.push_back(0);
}
for (long long int i = 0; i < n; i++) {
if (m >= ((i * 100) + a[i])) {
cout << 0 << " ";
b[a[i] - 1]++;
continue;
}
q = 0;
r = 0;
p = m - a[i];
for (long long int j = 0; j < 100; j++) {
if ((q + (b[j] * (j + 1))) <= p) {
q += b[j] * (j + 1);
r += b[j];
} else {
x = (p - q) / (j + 1);
q += (x * (j + 1));
r += x;
break;
}
}
b[a[i] - 1]++;
cout << i - r << " ";
}
cout << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
dop obj[t];
for (long long int i = 0; i < t; i++) {
obj[i].get();
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
long long n, M;
long long t[101];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> M;
for (int i = 1; i <= n; i++) {
long long a;
cin >> a;
long long sum = 0;
int kol = 0;
for (long long j = 1; j <= 100; j++)
if (sum + t[j] * j <= M - a) {
sum += t[j] * j;
kol += t[j];
} else {
kol += ((M - a - sum) / j);
sum = M - a;
break;
}
cout << i - 1 - kol << " ";
t[a]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, M;
cin >> n >> M;
vector<long long> t(n);
long long sum = 0;
vector<long long> mas(1 + 100);
for (int i = 0; i < n; i++) cin >> t[i];
for (int i = 0; i < n; i++) {
long long cnt = 0, d = sum + t[i] - M;
if (d > 0) {
for (int j = 100; j >= 1; j--) {
if (d <= j * mas[j]) {
cnt += (d + j - 1) / j;
break;
}
d -= (j * mas[j]);
cnt += mas[j];
}
}
mas[t[i]]++;
sum += t[i];
cout << cnt << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, n, t, cnt = 0, ans, q, t2;
t = 1;
while (t--) {
ans = 0;
cnt = 0;
cin >> n >> q;
priority_queue<long long, vector<long long>, greater<long long>> p2;
priority_queue<long long> p1;
long long a[n], a2[n];
j = 0;
k = INT_MIN;
for (i = 0; i < n; i++) {
cin >> a[i];
while (p1.size() > 0 && p2.size() > 0 && p2.top() < p1.top()) {
long long val1 = p2.top();
long long val2 = p1.top();
p1.pop();
p2.pop();
j -= val2;
j += val1;
p2.push(val2);
p1.push(val1);
}
while (j + a[i] > q && j > 0) {
j -= p1.top();
p2.push(p1.top());
p1.pop();
}
while (p2.size() > 0 && j + a[i] + p2.top() <= q) {
j += p2.top();
p1.push(p2.top());
p2.pop();
}
if (j + a[i] <= q) {
j += a[i];
p1.push(a[i]);
}
cout << p2.size() << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[110] = {0};
int main() {
int n, m, d;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &d);
int sum = m - d;
int ans = i - 1;
for (int j = 1; j <= 100; j++) {
int num = min(sum / j, a[j]);
sum -= num * j;
ans -= num;
}
a[d]++;
printf("%d%c", ans, i == n ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int qtd[110];
int main() {
int n, m;
scanf("%d %d", &n, &m);
int sum = 0;
for (int i = 0; i < n; i++) {
if (i) printf(" ");
int x;
scanf("%d", &x);
sum += x;
int resp = 0;
if (sum > m) {
int dif = sum - m;
for (int i = 100; i >= 1; i--) {
if (qtd[i] * i >= dif) {
resp += ((dif / i) + ((dif % i != 0) ? 1 : 0));
break;
} else {
resp += qtd[i];
dif -= (qtd[i] * i);
}
}
}
printf("%d", resp);
qtd[x]++;
}
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long ceil_div(long long a, long long b) {
return a / b + (a % b != 0);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long M;
cin >> n >> M;
vector<long long> ts(n);
for (auto &e : ts) {
cin >> e;
}
vector<long long> tot(101, 0);
long long sum = 0;
for (auto e : ts) {
long long _s = sum;
int res = 0;
for (long long i = 100; i > 0; i--) {
if (_s + e > M) {
long long take = min(tot[i], ceil_div((_s + e) - M, i));
res += take;
_s -= take * i;
}
}
sum += e;
tot[e]++;
cout << res << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int i, j, k, n, m, x, y, count;
cin >> n >> m;
int a[n + 1], b[n + 1], c[101], ans[n + 1];
memset(ans, 0, sizeof(ans));
memset(c, 0, sizeof(c));
a[0] = b[0] = 0;
for (i = 1; i <= n; i += 1) {
cin >> a[i];
b[i] = a[i] + b[i - 1];
}
for (i = 1; i <= n; i += 1) {
x = a[i - 1];
c[x] += 1;
x = b[i - 1];
y = m - a[i];
if (y >= x)
ans[i] = 0;
else {
y = x - y;
x = 0, k = 100, count = 0;
while (x < y && k > 0) {
x += k * c[k];
if (x <= y) {
count += c[k];
k -= 1;
} else {
x -= k * c[k];
j = y - x;
count += ceil((1.0 * j) / k);
x = y;
}
}
ans[i] = count;
}
}
for (i = 1; i <= n; i += 1) cout << ans[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int f[105];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
int sum = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
sum += x;
if (sum <= m) {
cout << 0 << ' ';
f[x]++;
continue;
}
int req = sum - m, ans = 0;
for (int i = 100; i >= 1; --i) {
if (i * f[i] < req) {
ans += f[i];
req -= (i * f[i]);
} else {
ans += (req + i - 1) / i;
break;
}
}
cout << ans << ' ';
f[x]++;
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long sub_sum = 0;
vector<long long> t(n, 0);
vector<long long> t_fix(105, 0);
for (int i = 0; i < n; ++i) {
cin >> t[i];
if (sub_sum + t[i] <= m) {
cout << 0 << " ";
sub_sum += t[i];
t_fix[t[i]]++;
} else {
long long s = 0;
long long am = 0;
for (long long j = 100; j >= 1; --j) {
if (t_fix[j] == 0ll) {
continue;
}
if (sub_sum - (t_fix[j] * j) - s + t[i] > m) {
am += t_fix[j];
s += t_fix[j] * j;
} else {
am += (sub_sum - m - s + t[i] + j - 1ll) / j;
cout << am << " ";
break;
}
}
t_fix[t[i]]++;
sub_sum += t[i];
}
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const int OO = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
long long arr[n];
map<long long, long long> mp;
for (int i = 0; i < n; i++) {
cin >> arr[i];
long long sum = arr[i], cnt = 0;
for (int j = 1; j <= 100; j++) {
if (sum + mp[j] * j <= m)
sum += mp[j] * j, cnt += mp[j];
else {
long long z = m - sum;
sum += (z / j) * j, cnt += z / j;
}
}
mp[arr[i]]++;
cout << i - cnt << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
int c[101] = {0};
for (int i = 0; i < n; i++) cin >> a[i];
long long int sum = a[0];
int b[n];
b[0] = 0;
c[a[0]]++;
for (int i = 1; i < n; i++) {
sum = sum + a[i];
long long int ex = sum - m;
if (ex <= 0) {
b[i] = 0;
c[a[i]]++;
continue;
}
int cnt = 0;
for (int k = 100; k >= 1; k--) {
if (ex <= c[k] * k) {
cnt += (ex + k - 1) / k;
ex = 0;
break;
}
cnt = cnt + c[k];
ex = ex - c[k] * k;
}
b[i] = cnt;
c[a[i]]++;
}
for (int i = 0; i < n; i++) cout << b[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 22;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
using namespace std;
std::string s1, s2;
int a[1000000];
int h[10000];
int main() {
if (fopen("../yilian.txt", "r") != NULL) {
freopen("../yilian.txt", "r", stdin);
} else {
std::ios::sync_with_stdio(false);
cin.tie(0);
}
int n, m;
while (cin >> n >> m) {
memset(h, 0, sizeof(h));
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int num = 0;
for (int i = 0; i < n; i++) {
num = 0;
int now = a[i];
for (int j = 1; j <= 100; j++) {
int person = (m - now) / j;
if (person > h[j]) {
person = h[j];
}
num += person;
now += person * j;
}
std::cout << i - num << " ";
h[a[i]]++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> ans(n, 0);
int sum = 0;
set<pair<int, int>> t;
set<pair<int, int>> unused;
vector<int> was(111, 0);
set<int> s;
for (int i = 0; i < n; i++) {
sum += a[i];
int kol = 0;
int summ = sum;
for (auto y : s) {
if (sum <= m) break;
int x = y;
x *= -1;
int k = was[x];
if (sum - k * x > m) {
kol += was[x];
sum -= k * x;
} else {
kol += (sum - m + x - 1) / x;
break;
}
}
sum = summ;
ans[i] = kol;
s.insert(-a[i]);
was[a[i]]++;
}
for (int i = 0; i < n; i++) cout << ans[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M, cnt[101];
int main() {
int N, M, cnt[101] = {0};
scanf("%d%d", &N, &M);
for (int i = 0; i < N; i++) {
int t;
scanf("%d", &t);
int now = M - t;
int ans = i;
for (int j = 1; j <= 100; j++) {
int get = min(now / j, cnt[j]);
now -= get * j;
ans -= get;
}
cnt[t]++;
printf("%d%c", ans, i == N - 1 ? 10 : 32);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, m, a[N];
int t[107];
int solve(int x) {
int ret = 0;
for (int i = 1; i <= 100; i++) {
if (i * t[i] <= x) {
x -= i * t[i];
ret += t[i];
} else {
int r = x / i;
ret += r;
break;
}
}
return ret;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
int r = m - a[i];
int ans = solve(r);
printf("%d", i - 1 - ans);
if (i == n)
printf("\n");
else
printf(" ");
t[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n, m;
cin >> n >> m;
vector<long long> v(n);
priority_queue<long long> p;
for (long long i = 0; i < n; i++) cin >> v[i];
vector<long long> dp(n);
dp[0] = v[0];
for (long long i = 1; i < dp.size(); i++) {
dp[i] = v[i] + dp[i - 1];
}
vector<long long> help(101);
for (long long i = 0; i < n; i++) {
vector<long long> temp;
long long ans = 0;
long long timereq = v[i];
long long timeleft = m;
if (i > 0) {
timeleft = m - dp[i - 1];
}
for (long long j = 100; j > 0; j--) {
if (timeleft >= timereq) break;
long long smallans = help[j] * j;
if (smallans + timeleft >= timereq) {
long long x1 = timereq - timeleft;
long long p = x1 / j;
if (x1 % j != 0) p++;
ans = ans + p;
break;
} else {
timeleft = timeleft + smallans;
ans = ans + help[j];
}
}
if (ans < 0) ans = 0;
cout << ans << " ";
help[v[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n), p(n), v;
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
c += a[i];
p[i] = c;
}
int k = 0, l, y, x;
vector<int> u(101, 0);
for (int i = 0; i < n; i++) {
l = 0;
if (p[i] <= m) {
v.push_back(0);
} else {
k = p[i];
x = k - m;
for (int j = 100; j > 0; j--) {
if (x <= (j * u[j])) {
l += (x + (j - 1)) / j;
v.push_back(l);
break;
} else {
x -= (j * u[j]);
l += u[j];
}
}
}
u[a[i]]++;
}
for (auto &ele : v) {
cout << ele << " ";
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000;
const int MAXM = 200;
int num[MAXM];
int a[MAXN];
bool flag = 1;
inline int read() {
char ch = getchar();
int s = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return f * s;
}
void print(int tmp) {
if (flag) {
flag = 0;
printf("%d", tmp);
} else
printf(" %d", tmp);
}
int main() {
int n = read(), m = read();
memset(num, sizeof(num), 0);
for (int i = 1; i <= n; i++) a[i] = read();
int s = 0;
for (int i = 1; i <= n; i++) {
s += a[i];
int left = s - m, ans(0);
if (left > 0) {
for (int j = 100; j >= 1; j--) {
if (left - j * num[j] <= 0) {
ans += left % j == 0 ? left / j : left / j + 1;
break;
} else {
ans += num[j];
left -= j * num[j];
}
}
}
print(ans);
num[a[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
vector<long long> t(n + 1);
for (long long i = 1; i <= n; i++) cin >> t[i];
long long sum = 0;
vector<long long> occ(101, 0);
for (long long i = 1; i <= n; i++) {
if (t[i] <= m - sum)
cout << 0 << " ";
else {
long long j = 100;
long long sum1 = sum, leave = 0;
while (t[i] > m - sum1) {
if (m - sum1 + occ[j] * j < t[i])
leave = leave + occ[j], sum1 = sum1 - occ[j] * j;
else {
long long w = (t[i] - m + sum1) / j + (((t[i] - m + sum1) % j) != 0);
leave = leave + w;
sum1 = sum1 - w * j;
}
j--;
}
cout << leave << " ";
}
occ[t[i]]++;
sum = sum + t[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
long long int nxtl() {
long long int x;
cin >> x;
return x;
}
void SieveOfEratosthenes(int n, vector<int> &primes) {
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p) prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p]) primes.push_back(p);
}
long long int max(long long int a, long long int b) {
if (a > b) return a;
return b;
}
long long int power(long long int x, long long int y, long long int mod) {
long long int temp;
if (y == 0) return 1;
temp = power(x, y / 2, mod);
if (y % 2 == 0)
return (temp * temp) % mod;
else
return (((x * temp) % mod) * temp) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = nxt(), m = nxt();
map<int, int, greater<int> > m2;
vector<int> v(n);
generate((v).begin(), (v).end(), nxt);
int sum = 0;
for (int i = 0; i < n; i++) {
int diff = m - v[i];
if (sum <= diff) {
cout << "0 ";
sum += v[i];
m2[v[i]] += 1;
continue;
}
diff = sum - diff;
int x = 0;
int c = 0;
for (auto it = m2.begin(); it != m2.end(); it++) {
int diff2 = diff - x;
int y = min(it->second, (diff2 + it->first - 1) / it->first);
c += y;
x += y * it->first;
if (x >= diff) break;
}
cout << c << " ";
sum += v[i];
m2[v[i]] += 1;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, u, v;
vector<long long int> adj[(long long int)1e6 + 1];
long long int p_m(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b & 1) {
res = res * a;
res = res % 1000000007;
}
a = a * a;
a = a % 1000000007;
b >>= 1;
}
return res;
}
void solve() {
long long int i, j, k;
long long int m;
cin >> n >> m;
vector<long long int> a(n + 1);
map<long long int, long long int> mp;
for (long long int i = (long long int)1; i <= (long long int)n; i++)
cin >> a[i], mp[a[i]]++;
long long int sum = 0;
multiset<long long int> s1, s2;
long long int cnt = 0;
vector<long long int> pre(n + 1, 0);
vector<long long int> v1, v2;
for (long long int i = (long long int)1; i <= (long long int)n; i++)
pre[i] += pre[i - 1] + a[i];
mp.clear();
for (long long int i = (long long int)1; i <= (long long int)n; i++) {
if (pre[i - 1] + a[i] <= m)
cout << 0 << " ";
else {
long long int r = pre[i - 1] - (m - a[i]);
cnt = 0;
sum = 0;
for (k = 100; k >= 1; k--) {
if (mp[k] * k + sum < r)
sum += mp[k] * k, cnt += mp[k];
else {
long long int c1 = mp[k];
long long int c2 = r - sum;
cnt += ceil((1.0 * c2) / k);
cout << cnt << " ";
break;
}
}
}
mp[a[i]]++;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int T = 1;
while (T--) {
solve();
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
vector<int> vec(101, 0);
vector<vector<int> > dp;
for (int i = 0; i < n; i++) {
long long int x;
cin >> x;
dp.push_back(vec);
int cou = m - x;
int rem = 0;
for (int j = 1; j <= 100; j++) {
if (cou / j >= vec[j])
cou -= vec[j] * j;
else {
int no = cou / j;
cou -= no * j;
rem = rem + vec[j] - no;
}
}
cout << rem << " ";
vec[x]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b) {
return (a.second < b.second);
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
bool inline isPrime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
bool isPowerOfTwo(long long int n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
bool prt(vector<long long int> e) {
for (auto &i : e) cout << i << " ";
cout << "\n";
}
void yes(int i) {
if (i == 1)
cout << "YES\n";
else
cout << "NO\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int test = 1;
while (test--) {
long long int n, m, temp;
cin >> n >> m;
vector<long long int> tim(100, 0);
long long int sz = 0;
for (long long int i = (0); i < (n); i += 1) {
cin >> temp;
long long int rem = m - temp, s = 0, itr = 99, ans = 0;
long long int foo = sz;
if (foo > rem) {
while (itr >= 0) {
foo -= tim[itr] * (itr + 1);
ans += tim[itr];
if (foo < rem) {
foo += tim[itr] * (itr + 1);
ans -= tim[itr];
double res = foo - rem;
long long int bacha = (long long int)ceil(res / (itr + 1));
ans += bacha;
foo -= bacha * (itr + 1);
}
itr--;
if (foo <= rem) break;
}
}
cout << ans << "\n";
tim[temp - 1]++;
sz += temp;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("Codeforces.in");
ofstream fout("Codeforces.out");
int n, m, t[200005], c[101], tt[200005];
string ans;
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> t[i];
tt[0] = t[0];
for (int i = 0; i < n; i++) tt[i] = tt[i - 1] + t[i];
for (int i = 0; i < n; i++) {
int at = tt[i], used = 0, totalused = 0;
if (tt[i] <= m) {
ans += "0 ";
c[t[i]]++;
continue;
}
for (int k = 100; k >= 1; k--) {
used = min(c[k], (int)ceil(((at - m) / (double)k)));
at -= used * k;
totalused += used;
if (at <= m) break;
}
ans += to_string(totalused) + " ";
c[t[i]]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INFLL = 1e18;
const int MAXN = 3e5;
const long long INF = 1e9;
const long long kek = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
long long n, m;
cin >> n >> m;
vector<long long> t(101, 0);
long long sum = 0;
for (int i = 0; i < (n); i++) {
long long x;
cin >> x;
long long u = sum;
long long cnt = 0;
long long j = 100;
while (m - u + t[j] * j < x) {
u -= t[j] * j;
cnt += t[j];
j--;
}
if (j > 0 && m - u < x) {
cnt += (x + u - m + j - 1) / j;
}
cout << cnt << " ";
t[x]++;
sum += x;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], cnt[105];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int sum = 0;
for (int i = 1; i <= n; i++) {
if (sum + a[i] <= m) {
sum += a[i];
cnt[a[i]]++;
printf("0 ");
continue;
}
int tmp = 0, ans = 0;
for (int j = 100; j >= 1; j--) {
if (sum - tmp - cnt[j] * j + a[i] <= m) {
int x = sum - tmp - m + a[i];
ans += x / j;
if (x % j) ans++;
break;
} else
tmp += cnt[j] * j, ans += cnt[j];
}
printf("%d ", ans);
sum += a[i];
cnt[a[i]]++;
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e7;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
long long int *t = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> t[i];
};
long long int timelapsed = 0;
priority_queue<long long int> done, notDone;
for (int i = 0; i < n; i++) {
while (!done.empty() && !notDone.empty() &&
done.top() > abs(notDone.top())) {
timelapsed -= done.top();
timelapsed += abs(notDone.top());
long long int ndTop = -notDone.top();
notDone.pop();
done.push(ndTop);
notDone.push(-done.top());
done.pop();
}
timelapsed += t[i];
while (timelapsed > m) {
timelapsed -= done.top();
notDone.push(-done.top());
done.pop();
}
done.push(t[i]);
while (!notDone.empty() && (timelapsed - notDone.top()) <= m) {
timelapsed -= notDone.top();
done.push(-notDone.top());
notDone.pop();
}
t[i] = notDone.size();
}
for (int i = 0; i < n; i++) {
cout << t[i] << ' ';
}
cout << endl;
;
}
|
#include <bits/stdc++.h>
using namespace std;
const string NAME = "GREEXAM";
const int N = 202020;
int n, m, k, x, cnt[N];
int main() {
ios::sync_with_stdio(0);
fill(cnt, cnt + N, 0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> x;
int sum = k - x, dem = 1;
for (int j = 1; j <= 100; j++) {
int cothedau = min(sum / j, cnt[j]);
sum -= cothedau * j;
dem += cothedau;
}
cout << i - dem << " ";
cnt[x]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
long long pre[maxn];
vector<int> c(101, 0);
int t[maxn];
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> t[i];
}
pre[0] = 0;
for (int i = 1; i <= n; ++i) {
pre[i] = pre[i - 1] + t[i];
}
for (int i = 1; i <= n; ++i) {
int ans = 0;
long long sum = pre[i];
bool flag = 0;
if (sum > m) {
for (int k = 100; k >= 1; k--) {
int x = k * c[k];
if (sum - x <= m) {
ans += (sum - m + k - 1) / k;
break;
}
ans += c[k];
sum -= x;
}
}
c[t[i]]++;
cout << ans << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline unsigned long long rel() {
unsigned long long x;
cin >> x;
return x;
}
inline int rei() {
int x;
cin >> x;
return x;
}
inline string res() {
string x;
cin >> x;
return x;
}
int a[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = rei(), m = rei();
int fr[102] = {0};
for (int i = 0; i <= n - 1; i++) {
cin >> a[i];
int target = m - a[i];
int num = 0;
for (int j = 1; j <= 100; j++) {
if (target - j * fr[j] >= 0) {
target -= (j * fr[j]);
num += fr[j];
} else {
num += (target / j);
break;
}
}
fr[a[i]]++;
cout << i - num << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
template <class c>
debug& operator<<(const c&) {
return *this;
}
};
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
const int oo = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> before(101, 0);
for (int i = 0; i < n; ++i) {
int time;
cin >> time;
int maxnow = m - time;
int now = 0, ind = 1;
int ans = 0;
while (ind <= 100) {
if (now + ind * before[ind] <= maxnow) {
now += ind * before[ind];
ans += before[ind];
ind++;
} else {
ans += int((maxnow - now) / ind);
ind = 101;
}
}
cout << i - ans << (i < n - 1 ? " " : "\n");
before[time]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long f[110];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long n, m;
cin >> n >> m;
long long a[n];
for (long long i = 0; i < n; ++i) cin >> a[i];
long long sum = 0;
vector<long long> ans;
for (long long i = 0; i < n; ++i) {
sum += a[i];
long long cnt = 0;
if (sum > m) {
long long req = sum - m;
for (long long j = 100; j >= 1; --j) {
if (f[j]) {
if (req > f[j] * j)
req -= (f[j] * j), cnt += f[j];
else {
long long tmp = req / j;
cnt += tmp;
if (req % j) cnt++;
break;
}
}
}
}
ans.push_back(cnt);
f[a[i]]++;
}
for (long long i : ans) cout << i << " ";
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int SQR = 101;
vector<int> kek;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
kek.resize(SQR);
for (int i = 0; i < n; i++) {
int t;
cin >> t;
m -= t;
int ans = 0;
int dp = 0;
for (int i = 1; i <= SQR; i++) {
if (dp + i * kek[i] <= m) {
dp += i * kek[i];
ans += kek[i];
} else {
ans += (m - dp) / i;
break;
}
}
m += t;
kek[t]++;
cout << i - ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
const int N = 200005;
const int inf = 1000 * 1000 * 1000;
const int mod = 998244353;
int n, m;
pair<int, int> p[N];
int a[N];
int t[105];
int main() {
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
int S = 0;
int cnt = 0;
int rem = m - a[i];
for (int j = 1; j <= 100; j++) {
S += j * t[j];
cnt += t[j];
if (S > rem) {
S -= j * t[j];
cnt -= t[j];
cnt += (rem - S) / j;
break;
}
}
t[a[i]]++;
printf("%d ", i - 1 - cnt);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long N, M;
cin >> N >> M;
vector<long long> A(N);
for (long long i = 0; i < N; ++i) {
cin >> A.at(i);
}
vector<long long> num(101, 0);
long long sum = 0;
for (long long i = 0; i < N; ++i) {
sum += A.at(i);
long long now = sum;
long long ans = 0;
for (long long j = 100; j >= 1; --j) {
if (now - j * num.at(j) <= M) {
ans += max(0ll, (now - M + j - 1) / j);
break;
} else {
ans += num.at(j);
now -= j * num.at(j);
}
}
num.at(A.at(i)) += 1;
cout << ans << " ";
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
clock_t START;
inline long double TIME() {
return (long double)(clock() - START) / CLOCKS_PER_SEC;
}
void SHOW() {
cout << fixed << setprecision(10);
cout << TIME() << " SECONDS FROM START\n";
}
long double TL = 2.0;
long long calls = 0;
inline bool IS() {
if (++calls == 1000) {
calls = 0;
if (TL - TIME() < 0.1) return true;
}
return false;
}
template <typename T1, typename T2>
inline bool amin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
inline bool amax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << ' ' << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v) is >> u;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v) os << u << ' ';
return os;
}
long long hash_mod[4] = {1000000007, 998244353, 1000000009, 999999937},
mod = hash_mod[rnd() % 4];
long long hash_pows[4] = {179, 239, 1007, 2003}, P = hash_pows[rnd() % 4];
long long binpow(long long first, long long p) {
long long res = 1;
while (p) {
if (p % 2) res = (res * first) % mod;
first = (first * first) % mod;
p /= 2;
}
return res;
}
const long long N = 1e6 + 7, NS = 2e3 + 7, lg = 20, sq = 550, inf = 2e9 + 7,
SM = 1e2 + 7;
const long double eps = 1e-9;
long long cnt[1000];
void solve() {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
cin >> a;
for (long long i = 0; i < n; i++) {
long long need = m - a[i], res = 0;
for (long long j = 1; j <= 100; j++) {
long long can = min(cnt[j], need / j);
res += can;
need -= j * can;
}
cout << i - res << ' ';
cnt[a[i]]++;
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
vector<long long int> v, res;
for (long long int i = 0; i < n; i++) {
long long int x;
cin >> x;
v.push_back(x);
}
long long int sum = 0;
priority_queue<long long int> q;
long long int ans = 0;
for (long long int i = 0; i < n; i++) {
sum += v[i];
if (sum > m) {
long long int tsum = sum, tans = ans;
vector<long long int> recent;
while (tsum > m) {
long long int a = q.top();
q.pop();
tsum -= a;
tans += 1;
recent.push_back(a);
}
res.push_back(tans);
int w = 0, ind = recent.size() - 1;
while (w < v[i] and ind > -1) {
w += recent[ind];
ind -= 1;
}
for (int i = recent.size() - 1; i > ind; i--) {
q.push(recent[i]);
tsum += recent[i];
tans -= 1;
}
sum = tsum;
ans = tans;
} else {
res.push_back(ans);
}
q.push(v[i]);
}
for (long long int i = 0; i < n; i++) cout << res[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int ans[200000 + 8];
int num[200];
int n, m;
int sum = 0, cnt = 0;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
int u;
scanf("%d", &u);
sum += u;
if (sum <= m)
ans[i] = 0;
else {
int x = sum - m;
for (int p = 100; p >= 1 && x > 0; --p) {
if (!num[p]) continue;
x -= num[p] * p;
ans[i] += num[p];
if (x < 0) {
for (; x <= 0; x += p, --ans[i])
;
++ans[i];
break;
}
}
}
++num[u];
}
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, i, x = 0, ans = 0, x1 = 0;
cin >> n >> m;
vector<long long int> v;
long long int a[n], b[101], j;
for (i = 0; i < 101; i++) {
b[i] = 0;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
x1 = x1 + a[i];
x = x1;
ans = 0;
if (x > m) {
j = 100;
while (x > m) {
if (x - (j * b[j]) >= m) {
x = x - j * b[j];
ans = ans + b[j];
} else {
ans = ans + b[j] - ((m - (x - j * b[j])) / j);
x = 0;
}
j--;
}
v.push_back(ans);
} else {
v.push_back(0);
}
b[a[i]]++;
}
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[101];
int main() {
int n, m, t, sum = 0;
cin >> n >> m >> t;
cnt[t]++;
cout << 0 << ' ';
sum += t;
for (int i = 1; i < n; i++) {
cin >> t;
int sum_del = 0, ans = 0;
for (int j = 101; j >= 1; j--) {
if (sum - sum_del - cnt[j] * j + t <= m) {
int k = max(-(m - (sum - sum_del + t)), 0);
ans += (k / j + bool(k % j));
break;
} else {
ans += cnt[j];
sum_del += cnt[j] * j;
}
}
cout << ans << ' ';
cnt[t]++;
sum += t;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, m, t[Maxn], cnt[105], tot, all;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
for (int i = 1; i <= n; i++) {
tot = t[i];
all = 0;
for (int j = 1; j <= 100; j++) {
if (tot + cnt[j] * j > m) {
printf("%d ", i - 1 - (all + (m - tot) / j));
goto A;
}
tot += cnt[j] * j;
all += cnt[j];
}
printf("0 ");
A:
cnt[t[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long a, n, m, sum = 0;
cin >> n >> m;
priority_queue<int> q;
stack<int> k;
while (n--) {
cin >> a;
if (sum + a <= m) {
cout << k.size() << " ";
q.push(a);
sum += a;
} else {
while (sum + a > m) {
int tmp = q.top();
q.pop();
k.push(tmp);
sum -= tmp;
}
cout << k.size() << " ";
while (!k.empty() && sum < m && k.top() <= a) {
int tmp = k.top();
k.pop();
q.push(tmp);
sum += tmp;
}
sum += a;
q.push(a);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e6 + 7, M = 1000000007, inf = INT_MAX;
const long long INF = LLONG_MAX;
void solve() {
long long m, n;
cin >> n >> m;
long long arr[n], freq[101] = {0};
for (long long i = 0; i < (long long)n; i++) cin >> arr[i];
long long sum = 0;
for (long long i = 0; i < (long long)n; i++) {
sum += arr[i];
if (sum <= m)
cout << 0 << " ";
else {
long long cnt = 0;
long long csum = sum, req = sum - m;
for (long long k = 100; k >= 1; k--) {
if (!freq[k]) continue;
req -= k * freq[k];
cnt += freq[k];
if (req > 0)
continue;
else if (req == 0)
break;
else {
req += k * freq[k];
cnt -= freq[k];
long long y = req / k + bool(req % k);
req -= y * k;
cnt += y;
break;
}
}
cout << cnt << " ";
}
freq[arr[i]]++;
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long test = 1;
while (test--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
class segment_tree {
int n;
vector<int> t1;
vector<int> t2;
void change(int v, int L, int R, int i, int x) {
if (R <= i || i < L)
return;
else if (L == R - 1) {
t1[v] = x;
t2[v] = 1;
} else {
change(2 * v + 1, L, (L + R) / 2, i, x);
change(2 * v + 2, (L + R) / 2, R, i, x);
t1[v] = t1[2 * v + 1] + t1[2 * v + 2];
t2[v] = t2[2 * v + 1] + t2[2 * v + 2];
}
}
int count_mins(int v, int L, int R, int s) {
if (L == R - 1) {
return 0;
} else {
if (t1[2 * v + 1] > s)
return count_mins(2 * v + 1, L, (L + R) / 2, s);
else
return t2[2 * v + 1] +
count_mins(2 * v + 2, (L + R) / 2, R, s - t1[2 * v + 1]);
}
}
public:
segment_tree(int _n) {
n = _n;
t1.resize(4 * n);
t2.resize(4 * n);
}
void change(int i, int x) { change(0, 0, n, i, x); }
int count_mins(int s) {
if (t1[0] <= s) {
return t2[0];
}
return count_mins(0, 0, n, s);
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> t(n);
for (int i = 0; i < (int)(n); i++) cin >> t[i];
vector<int> ind(n);
iota(ind.begin(), ind.end(), 0);
sort(ind.begin(), ind.end(),
[&t](int i, int j) -> bool { return t[i] < t[j]; });
vector<int> r(n);
for (int i = 0; i < (int)(n); i++) r[ind[i]] = i;
segment_tree s(n);
for (int i = 0; i < (int)(n); i++) {
cout << i - s.count_mins(m - t[i]) << " ";
s.change(r[i], t[i]);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int cnt[101];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, m;
cin >> n >> m;
std::vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
int avail = m - a[i];
int maxi = 0;
for (int j = 1; j <= 100; j++) {
if (cnt[j] > 0) {
int t = avail / j;
t = (t < cnt[j] ? t : cnt[j]);
avail -= (t * j);
maxi += t;
}
}
cout << (i - 1 - maxi) << " ";
cnt[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> ans;
map<int, int> abhi_tak;
for (int i = 0; i < n; i++) {
int ss = arr[i];
int cc = 0;
for (auto x : abhi_tak) {
int check = m - ss;
int count = check / x.first;
count = min(count, x.second);
ss += (count * x.first);
cc += count;
}
ans.push_back(i - cc);
abhi_tak[arr[i]]++;
}
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, cnt[105] = {0}, m;
cin >> n >> m;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a;
if (sum + a > m) {
int c = 0, s2 = sum + a, s1 = 0;
for (int j = 100; j >= 1; j--) {
if (s2 - (j * cnt[j]) <= m) {
s1 = s2 - m;
c += ((s1 - 1) / j) + 1;
printf("%d ", c);
break;
} else {
s2 -= j * cnt[j];
c += cnt[j];
}
}
} else {
printf("0 ");
}
sum += a;
cnt[a]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M, A[200100];
int num[110];
int kerja() {
int sum = 0;
int ans = 0;
int i = 0;
while (i < 110 && sum + i * num[i] <= M) {
sum += i * num[i];
ans += num[i];
i++;
}
if (i == 110) {
return ans;
}
int sel = M - sum;
ans += sel / i;
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A[i];
M -= A[i];
cout << i - kerja();
cout << (i == N - 1 ? "\n" : " ");
M += A[i];
num[A[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926536;
const long long prime = 1e9 + 7;
const long long inf = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m, t;
cin >> n >> m;
vector<long long> cnt(101, 0);
for (long long i = (long long)(1); i <= (long long)(n); i++) {
cin >> t;
long long left = m - t, used = 0;
for (long long j = (long long)(1); j <= (long long)(100); j++) {
if (left < j) {
break;
}
if (cnt[j] == 0) {
continue;
}
used += min(left / j, cnt[j]);
left -= min(left / j, cnt[j]) * j;
}
cout << i - used - 1 << " ";
cnt[t]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res % p;
}
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
long long int nCrModPFermat(long long int n, long long int r, long long int p,
long long int* fac) {
if (r == 0 || n == r) return 1;
long long int a = ((fac[n] % p) * (modInverse(fac[r], p) % p)) % p;
long long int b = modInverse(fac[n - r], p) % p;
return (a * b) % p;
}
void solve() {
long long int n, m;
cin >> n >> m;
long long int* arr = new long long int[n];
for (int i = 0; i < n; i++) cin >> arr[i];
vector<long long int> v;
long long int* freq = new long long int[101]();
for (int i = 0; i < n; i++) {
long long int req = m - arr[i];
long long int count = 0;
for (int j = 1; j < 101; j++) {
if (j * freq[j] <= req) {
req -= (j * freq[j]);
count += freq[j];
} else {
count += (req / j);
break;
}
}
cout << i - count << " ";
freq[arr[i]]++;
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
for (int y = 1; y <= t; y++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f;
using namespace std;
const long long maxn = 2e5 + 100;
long long a[maxn];
long long cnt[maxn];
int32_t main() {
long long n, m;
scanf("%lld%lld", &(n), &(m));
for (long long i = (1); i <= (n); i++) scanf("%lld", &(a[i]));
long long sum = 0;
for (long long i = (1); i <= (n); i++) {
long long x = sum + a[i] - m;
long long ans = 0;
if (x > 0) {
for (long long j = (100); j >= (1); j--) {
long long y = j * cnt[j];
if (y >= x) {
ans += (x + j - 1) / j;
break;
}
ans += cnt[j];
x -= y;
}
}
sum += a[i];
cnt[a[i]]++;
printf("%lld ", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int T = 100;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> t(n), count(T + 1, 0);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
for (int i = 0; i < n; i++) {
int d = sum + t[i] - m, k = 0;
if (d > 0) {
for (int j = T; j > 0; j--) {
int x = j * count[j];
if (d <= x) {
k += (d + j - 1) / j;
break;
}
k += count[j];
d -= x;
}
}
sum += t[i];
count[t[i]]++;
cout << k << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<long long int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<long double>;
using pii = pair<long long int, long long int>;
using psi = pair<string, long long int>;
using pci = pair<char, long long int>;
using vpii = vector<pii>;
struct data {
long long int S;
long long int E;
long long int T;
};
long long int mod = 1e9 + 7;
long long int const maxn = 250010;
long long int const inf = 1e18;
long long int add(long long int a, long long int b) {
return ((a % mod) + (b % mod)) % mod;
}
long long int mul(long long int a, long long int b) {
return ((a % mod) * (b % mod)) % mod;
}
long long int powm(long long int x, long long int n, long long int M) {
long long int result = 1;
while (n > 0) {
if (n % 2 == 1) result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
long long int modinverse(long long int a, long long int m) {
return powm(a, m - 2, m);
}
bool prime(long long int x) {
if (x <= 1) return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0) return false;
return true;
}
long long int divisor(long long int x) {
long long int cnt = 0;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (i != x / i)
cnt += 2;
else
cnt += 1;
}
}
return cnt;
}
vector<long long int> sieve(long long int n) {
bool prim[n + 1];
memset(prim, true, sizeof(prim));
for (long long int p = 2; p * p <= n; p++) {
if (prim[p] == true) {
for (int i = p * p; i <= n; i += p) prim[i] = false;
}
}
vector<long long int> v;
for (int i = 2; i <= n; i++)
if (prim[i]) v.push_back(i);
return v;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long int t;
t = 1;
while (t--) {
long long int n, m;
cin >> n >> m;
vi a(n);
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
long long int mp[105] = {0};
long long int sum = 0;
for (int i = 0; i < n; i++) {
long long int d = sum + a[i] - m;
long long int res = 0;
if (d > 0) {
for (int j = 100; j >= 0; j--) {
long long int x = j * mp[j];
if (x >= d) {
res += (d + j - 1) / j;
break;
}
res += mp[j];
d -= x;
}
}
cout << res << " ";
sum += a[i];
mp[a[i]]++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> freq(101);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i];
int ans = 0;
if (cur <= m) {
++freq[a[i]];
cout << "0 ";
continue;
} else {
int cur2 = cur;
for (int j = 100; j >= 1; j--) {
if (cur2 <= 0) break;
if (freq[j] * j >= (cur2 - m)) {
int rem = (cur2 - m + j - 1) / j;
cur2 -= rem * j;
ans += rem;
break;
} else {
int canget = freq[j];
cur2 -= canget * j;
ans += canget;
}
}
}
++freq[a[i]];
cout << ans << " \n"[i == n - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
void print_pair(pair<long long, long long> a) {
cerr << "(" << a.first << ", " << a.second << ") ";
}
template <class S, class T>
std::ostream& operator<<(std::ostream& os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T>
std::ostream& operator<<(std::ostream& os, vector<T> a) {
os << "[ ";
for (int i = 0; i < a.size(); i++) {
os << a[i] << " ";
}
os << " ]";
return os;
}
long long n, m;
vector<long long> t;
int main() {
scanf("%lld %lld", &n, &m);
t.resize(n);
for (int i = 0; i < n; i++) {
scanf("%lld", &t[i]);
}
long long ans = 0;
multiset<long long> s;
long long sum = 0;
for (int i = 0; i < n; i++) {
if (sum + t[i] <= m) {
cout << ans << " ";
s.insert(t[i]);
sum += t[i];
} else if (*s.rbegin() >= t[i]) {
sum += t[i] - *s.rbegin();
auto itr = s.end();
--itr;
s.erase(itr);
++ans;
s.insert(t[i]);
cout << ans << " ";
} else {
long long tmp = 0;
long long tmpsum = 0;
auto itr = s.rbegin();
while (sum - tmpsum + t[i] > m) {
tmpsum += *itr;
++itr;
++tmp;
}
cout << ans + tmp << " ";
++ans;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
inline int pls(int x, int y) {
x += y;
return x >= mod ? x - mod : x;
}
inline int dec(int x, int y) {
x -= y;
return x < 0 ? x + mod : x;
}
inline int mul(int x, int y) { return 1ll * x * y % mod; }
inline int mul(int x, int y, int z) { return mul(mul(x, y), z); }
inline int mul(int x, int y, int z, int p) { return mul(mul(x, y), mul(z, p)); }
inline void add(int &x, int y) {
x += y;
x = (x >= mod) ? x - mod : x;
}
inline int fpw(int x, int y, int r = 1) {
for (; y; y >>= 1, x = mul(x, x))
if (y & 1) r = mul(r, x);
return r;
}
inline int inv(int x) { return fpw(x, mod - 2); }
inline int gi() {
int x;
int _w = scanf("%d", &x);
return x;
}
inline void gi(int &x) { int _w = scanf("%d", &x); }
inline void write(int x) { printf("%d\n", x); }
void chkmax(int &x, int y) { x = (x > y) ? x : y; }
void chkmin(int &x, int y) { x = (x < y) ? x : y; }
const int INF = 0x3f3f3f3f;
template <typename T>
inline void debug(T x) {
cerr << x;
return;
}
const int maxn = 1e6 + 10;
int n, m, a[maxn];
int Sm[maxn];
inline int work(int x) {
int pre = 0, peo = 0;
for (int i = 100; i >= 1; --i) {
if (pre + i * Sm[i] >= x) {
int t = ((x - pre - 1) / i) + 1;
return peo + t;
} else
pre += i * Sm[i], peo += Sm[i];
}
return -1;
}
int main() {
n = gi(), m = gi();
int sum = 0;
for (int i = 1; i <= n; ++i) {
a[i] = gi();
sum += a[i];
if (sum <= m) {
printf("0 ");
} else {
printf("%d ", work(sum - m));
}
Sm[a[i]]++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int em(long long int x, long long int Mod, long long int n) {
if (n == 0)
return 1ll;
else if (n % 2 == 0)
return em((x % Mod * x % Mod) % Mod, Mod, n / 2) % Mod;
else
return (x % Mod * em((x % Mod * x % Mod) % Mod, Mod, (n - 1) / 2)) % Mod;
}
long long int freq[102];
int32_t main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, M, i, j, k;
cin >> n >> M;
long long int arr[n + 1];
for (i = 1; i <= n; i++) cin >> arr[i];
long long int tot = 0;
for (i = 1; i <= n; i++) {
long long int tle = M - tot;
if (tle >= arr[i])
cout << 0 << " ";
else {
long long int co = 0;
for (j = 100; j >= 1; j--) {
if (freq[j] > 0) {
if ((tle + freq[j] * j) >= arr[i]) {
long long int lo = 1, hi = freq[j];
long long int tmp = 0;
long long int ans = freq[j];
while (lo <= hi) {
long long int mid = (lo + hi) / 2;
tmp = tle + mid * j;
if (tmp >= arr[i]) {
hi = mid - 1;
ans = min(ans, mid);
} else
lo = mid + 1;
}
cout << co + ans << " ";
break;
} else {
tle += freq[j] * j;
co += freq[j];
}
}
}
}
tot += arr[i];
freq[arr[i]]++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[200005];
long long int cnt[200005][105];
int main() {
long long int n, i, j, k, x, y, t, m;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= n; i++) {
for (j = 1; j <= 100; j++) cnt[i][j] = cnt[i - 1][j];
cnt[i][a[i]]++;
}
for (i = 1; i <= n; i++) {
long long int ans = 0;
j = 1;
long long int tot = m - a[i];
while (j <= 100 && tot) {
if (cnt[i - 1][j] * j > tot) {
ans += tot / j;
tot = 0;
} else
tot -= cnt[i - 1][j] * j, ans += cnt[i - 1][j];
j++;
}
cout << i - 1 - ans << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[100];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int s = 0;
vector<int> ans;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int j = 100, sm = s, a = 0;
while (sm + x > m) {
for (; j >= 0; j--) {
int k = cnt[j] * j;
if (sm + x - k <= m) {
int c = -(m - x - sm);
if (c % j != 0) c += j;
c /= j;
a += c;
sm -= k;
break;
} else {
a += cnt[j];
sm -= k;
}
}
}
cnt[x]++;
ans.push_back(a);
s += x;
}
for (int x : ans) cout << x << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, num, T, R = 100;
struct Tree {
int v = 0, cnt = 0;
};
Tree tree[400];
void update(int node, int l, int r, int u) {
if (l == r && l == u) {
tree[node].v += num;
tree[node].cnt++;
return;
}
int mid = (l + r) / 2;
if (u <= mid) {
update(node * 2, l, mid, u);
} else {
update(node * 2 + 1, mid + 1, r, u);
}
tree[node].v = tree[node * 2].v + tree[node * 2 + 1].v;
tree[node].cnt = tree[node * 2].cnt + tree[node * 2 + 1].cnt;
}
int fnd(int node, int l, int r, int sum, int cnt) {
int mid = (l + r) / 2;
if (l > r) return cnt;
if (l == r) {
return cnt + min(sum / l, tree[node].cnt);
}
if (tree[node].v <= sum) return cnt + tree[node].cnt;
if (tree[node * 2].v <= sum) {
int newsum = sum - tree[node * 2].v;
int newcnt = cnt + tree[node * 2].cnt;
return fnd(1 + node * 2, mid + 1, r, newsum, newcnt);
} else {
return fnd(node * 2, l, mid, sum, cnt);
}
}
int main() {
scanf("%d %d", &n, &T);
for (int i = 1; i <= n; i++) {
scanf("%d", &num);
int x = T - num;
int FF = fnd(1, 1, R, x, 0);
printf("%d ", i - 1 - FF);
update(1, 1, R, num);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> freq(101);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i];
int ans = 0;
if (cur <= m) {
++freq[a[i]];
cout << "0 ";
continue;
} else {
int cur2 = cur;
for (int j = 100; j >= 1; j--) {
if (cur2 <= 0) break;
if (freq[j] * j >= (cur2 - m)) {
int rem = (cur2 - m + j - 1) / j;
cur2 -= rem * j;
ans += rem;
break;
} else {
int canget = freq[j];
cur2 -= canget * j;
ans += canget;
}
}
}
++freq[a[i]];
cout << ans << " \n"[i == n - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long a[N], b[N], id[N], ans[N];
long long sum[4 * N], num[4 * N];
int n;
long long m;
int getid(long long x) { return lower_bound(b + 1, b + 1 + n, x) - b; }
long long input() {
long long x = 0, f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
long long qu(int id, int l, int r, long long val) {
if (l == r) {
long long flag = 0;
if (val % b[l]) flag = 1;
return val / b[l] + flag;
}
int mid = l + r >> 1;
long long ans = 0;
if (val > sum[id << 1 | 1]) {
ans += num[id << 1 | 1];
ans += qu(id << 1, l, mid, val - sum[id << 1 | 1]);
} else
ans += qu(id << 1 | 1, mid + 1, r, val);
return ans;
}
void up(int id, int l, int r, int pos, long long val) {
if (l == r) {
num[id]++;
sum[id] += val;
return;
}
int mid = l + r >> 1;
if (pos <= mid)
up(id << 1, l, mid, pos, val);
else
up(id << 1 | 1, mid + 1, r, pos, val);
sum[id] = sum[id << 1] + sum[id << 1 | 1];
num[id] = num[id << 1] + num[id << 1 | 1];
}
int main() {
n = input();
m = input();
for (int i = 1; i <= 4 * n; ++i) sum[i] = num[i] = 0;
for (int i = 1; i <= (n); ++i) {
a[i] = input();
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
for (int i = 1; i <= (n); ++i) id[i] = getid(a[i]);
long long ss = 0;
for (int i = 1; i <= (n); ++i) {
if (ss + a[i] > m) {
long long val = ss + a[i] - m;
ans[i] = qu(1, 1, n, val);
}
up(1, 1, n, id[i], a[i]);
ss += a[i];
}
for (int i = 1; i <= (n); ++i) {
if (i != n)
printf("%lld ", ans[i]);
else
printf("%lld\n", ans[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 105;
long long counts[N];
int main(void) {
long long i, j;
long long n, M;
cin >> n >> M;
long long totSum = 0;
for (j = 0; j < n; j++) {
long long x;
cin >> x;
long long ans = 0;
totSum += x;
long long reqSum = max(0ll, totSum - M);
for (i = N - 1; i >= 0; i--) {
if (reqSum == 0) break;
if (counts[i] == 0) continue;
long long det = reqSum - (counts[i] * i);
if (det > 0) {
ans += counts[i];
reqSum = det;
} else if (det == 0) {
ans += counts[i];
break;
} else {
if (reqSum % i)
ans += (reqSum / i) + 1;
else
ans += reqSum / i;
break;
}
}
counts[x]++;
cout << ans << " ";
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.