Submission #59592264

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Problem: D - Home Garden
// Contest: AtCoder - Toyota Programming Contest 2024#11（AtCoder Beginner Contest 379）
// URL: https://atcoder.jp/contests/abc379/tasks/abc379_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define int long long
#define eb emplace_back
#define pb push_back
#define endl '\n'
#define rep1(i, a, b) for (int i = (a); i <= (b); i++)
#define rep2(i, b, a) for (int i = (b); i >= (a); i--)
using ll = long long;
using ull = unsigned long long;
using namespace std;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

// Problem: D - Home Garden
// Contest: AtCoder - Toyota Programming Contest 2024#11（AtCoder Beginner Contest 379）
// URL: https://atcoder.jp/contests/abc379/tasks/abc379_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define int long long
#define eb emplace_back
#define pb push_back
#define endl '\n'
#define rep1(i, a, b) for (int i = (a); i <= (b); i++)
#define rep2(i, b, a) for (int i = (b); i >= (a); i--)

using ll = long long;
using ull = unsigned long long;
using namespace std;

constexpr double PI = 3.14159265358979323846;
constexpr ll llmax = LLONG_MAX / 2;
constexpr ll llmin = LLONG_MIN / 2;

template <typename T> bool chkmin(T &a, T b)
{
    return (b < a) ? a = b, 1 : 0;
}

template <typename T> bool chkmax(T &a, T b)
{
    return (b > a) ? a = b, 1 : 0;
}

template <typename T> void readVectorWithLength(std::vector<T> &vec, int n)
{
    vec.resize(n);
    std::copy_n(std::istream_iterator<T>(std::cin), n, vec.begin());
}

template <typename T> void readVectorWithComma(std::vector<T> &vec)
{
    std::string input;
    std::getline(std::cin, input);
    std::stringstream ss(input);
    for (T num; ss >> num; vec.push_back(num))
    {
        ss.ignore(1, ',');
    }
}

template <typename T> void readVectorNoLength(std::vector<T> &vec)
{
    for (T num; std::cin >> num; vec.push_back(num))
    {
        if (std::cin.peek() == '\n')
            break;
    }
}

void solve();

signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int T = 1;
    // cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}
int Q;
vector<int> pot;
void solve()
{
    //
    cin >> Q;
    while (Q--) {
        int type;
        cin >> type;
        if (type == 1) {
            pot.pb(0);
        }
        else if (type == 2) {
            int t;
            cin >> t;
            for (auto &x : pot) {
                x += t;
            }
        }
        else if (type == 3) {
            int h; cin >> h;
            sort(pot.begin(), pot.end());
            auto it1 = lower_bound(pot.begin(), pot.end(), h);
            if (it1 == pot.end()) {
                cout << 0 << endl;
            }
            else {
                cout << pot.end() - it1 << endl;
            }
            pot.erase(it1, pot.end());
        }
    }
}

Submission Info

Judge Result