oj.uz

Submission #896958

# Submission time Handle Problem Language Result Execution time Memory
896958 2024-01-02T11:27:13 Z borisAngelov Trading (IZhO13_trading) C++17
100 / 100
 119 ms 23068 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 300005;

int n, q;

vector<pair<int, int>> byL[maxn];
int answer[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> q;

    for (int i = 1; i <= q; ++i)
    {
        int l, r, val;
        cin >> l >> r >> val;
        byL[l].push_back(make_pair(r, val - l));
    }

    priority_queue<pair<int, int>> pq;

    for (int i = 1; i <= n; ++i)
    {
        while (!pq.empty() && pq.top().second < i)
        {
            pq.pop();
        }

        for (int j = 0; j < byL[i].size(); ++j)
        {
            pq.push(make_pair(byL[i][j].second, byL[i][j].first));
        }

        if (!pq.empty())
        {
            answer[i] = pq.top().first + i;
        }
        else
        {
            answer[i] = 0;
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        cout << answer[i] << ' ';
    }

    cout << endl;

    return 0;
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:41:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for (int j = 0; j < byL[i].size(); ++j)
      |                         ~~^~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8280 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8508 KB Output is correct
7 Correct 60 ms 15808 KB Output is correct
8 Correct 75 ms 17096 KB Output is correct
9 Correct 68 ms 17344 KB Output is correct
10 Correct 76 ms 16836 KB Output is correct
11 Correct 77 ms 17864 KB Output is correct
12 Correct 86 ms 18688 KB Output is correct
13 Correct 91 ms 18324 KB Output is correct
14 Correct 86 ms 18492 KB Output is correct
15 Correct 108 ms 20820 KB Output is correct
16 Correct 101 ms 19520 KB Output is correct
17 Correct 105 ms 20044 KB Output is correct
18 Correct 112 ms 21500 KB Output is correct
19 Correct 103 ms 20352 KB Output is correct
20 Correct 119 ms 23068 KB Output is correct