Submission #880220

#	Time	Username	Problem	Language	Result	Execution time	Memory
880220		Regulus	Ants and Sugar (JOI22_sugar)	C++17	6 / 100	4088 ms	3668 KiB

sugar

#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 1e5+5;
ll t[N], a[N], x[N];
map<ll, ll> mp[3];      // ant, sugar

int main(void)
{ IO
    ll Q, i, j, ans, L, tmp;

    cin >> Q >> L;
    for (i=1; i <= Q; ++i)
    {
        cin >> t[i] >> x[i] >> a[i];
        mp[1].clear(), mp[2].clear();
        for (j=1; j <= i; ++j) mp[t[j]][x[j]] += a[j];

        ans = 0;
        auto it2 = mp[2].begin();
        for (auto it = mp[1].begin(); it != mp[1].end() && it2 != mp[2].end(); ++it)
        {
            while (it->S > 0)
            {
                while (it2 != mp[2].end() && (it->F - it2->F > L || it2->S == 0)) ++it2;
                if (it2 == mp[2].end()) break;
                if (abs(it->F-it2->F) > L) break;
                tmp = min(it->S, it2->S);
                it->S -= tmp, it2->S -= tmp, ans += tmp;
            }
        }
        cout << ans << '\n';
    }

    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 16
• Subtask 3: 0 / 26
• Subtask 4: 0 / 52