oj.uz

답안 #986308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986308 2024-05-20T09:46:47 Z GrindMachine Ants and Sugar (JOI22_sugar) C++17
6 / 100
 4000 ms 3568 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll q,d; cin >> q >> d;
    map<ll,ll> mp1,mp2;

    while(q--){
        ll t,x,c; cin >> t >> x >> c;
        if(t == 1){
            mp1[x] += c;
        }
        else{
            mp2[x] += c;
        }

        vector<pll> a(all(mp1));
        vector<pll> b(all(mp2));
        ll ptr = 0;
        ll ans = 0;

        rep(i,sz(a)){
            auto &[x,c] = a[i];
            while(ptr < sz(b) and x-b[ptr].ff > d){
                ptr++;
            }

            while(c and ptr < sz(b) and b[ptr].ff-x <= d){
                if(b[ptr].ss == 0){
                    ptr++;
                }
                else{
                    ll mn = min(c,b[ptr].ss);
                    ans += mn;
                    c -= mn;
                    b[ptr].ss -= mn;
                }
            }
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 28 ms 612 KB Output is correct
7 Correct 20 ms 604 KB Output is correct
8 Correct 7 ms 604 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 77 ms 656 KB Output is correct
11 Correct 81 ms 604 KB Output is correct
12 Correct 82 ms 604 KB Output is correct
13 Correct 82 ms 604 KB Output is correct
14 Correct 57 ms 600 KB Output is correct
15 Correct 60 ms 688 KB Output is correct
16 Correct 68 ms 600 KB Output is correct
17 Correct 60 ms 720 KB Output is correct
18 Correct 61 ms 600 KB Output is correct
19 Correct 79 ms 768 KB Output is correct
20 Correct 61 ms 744 KB Output is correct
21 Correct 82 ms 804 KB Output is correct
22 Correct 60 ms 680 KB Output is correct
23 Correct 81 ms 792 KB Output is correct
24 Correct 60 ms 604 KB Output is correct
25 Correct 81 ms 600 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 4075 ms 1912 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 4067 ms 3568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 28 ms 612 KB Output is correct
7 Correct 20 ms 604 KB Output is correct
8 Correct 7 ms 604 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 77 ms 656 KB Output is correct
11 Correct 81 ms 604 KB Output is correct
12 Correct 82 ms 604 KB Output is correct
13 Correct 82 ms 604 KB Output is correct
14 Correct 57 ms 600 KB Output is correct
15 Correct 60 ms 688 KB Output is correct
16 Correct 68 ms 600 KB Output is correct
17 Correct 60 ms 720 KB Output is correct
18 Correct 61 ms 600 KB Output is correct
19 Correct 79 ms 768 KB Output is correct
20 Correct 61 ms 744 KB Output is correct
21 Correct 82 ms 804 KB Output is correct
22 Correct 60 ms 680 KB Output is correct
23 Correct 81 ms 792 KB Output is correct
24 Correct 60 ms 604 KB Output is correct
25 Correct 81 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Execution timed out 4075 ms 1912 KB Time limit exceeded
30 Halted 0 ms 0 KB -