oj.uz

Submission #965976

# Submission time Handle Problem Language Result Execution time Memory
965976 2024-04-19T08:55:42 Z vjudge1 Trading (IZhO13_trading) C++17
100 / 100
 125 ms 23084 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int maxn = 300005;
 
int n, q;
vector<pair<int, int>> vc[maxn];
int ans[maxn];
 
int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> q;
    for (int i = 1; i <= q; ++i){
        int l, r, val; cin >> l >> r >> val;
        vc[l].push_back({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 < vc[i].size(); ++j) pq.push({vc[i][j].second, vc[i][j].first});
        if (!pq.empty()) ans[i] = pq.top().first + i;
        else ans[i] = 0;
        cout << ans[i] << ' ';
    }
 
    return 0;
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:21: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]
   21 |         for (int j = 0; j < vc[i].size(); ++j) pq.push({vc[i][j].second, vc[i][j].first});
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8280 KB Output is correct
3 Correct 3 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 8628 KB Output is correct
7 Correct 61 ms 15636 KB Output is correct
8 Correct 69 ms 16696 KB Output is correct
9 Correct 70 ms 17292 KB Output is correct
10 Correct 76 ms 17088 KB Output is correct
11 Correct 75 ms 17856 KB Output is correct
12 Correct 86 ms 19036 KB Output is correct
13 Correct 87 ms 18244 KB Output is correct
14 Correct 94 ms 18576 KB Output is correct
15 Correct 110 ms 20692 KB Output is correct
16 Correct 114 ms 19848 KB Output is correct
17 Correct 114 ms 19980 KB Output is correct
18 Correct 113 ms 21324 KB Output is correct
19 Correct 108 ms 20352 KB Output is correct
20 Correct 125 ms 23084 KB Output is correct