oj.uz

Submission #966052

# Submission time Handle Problem Language Result Execution time Memory
966052 2024-04-19T10:02:30 Z blackslex Trading (IZhO13_trading) C++17
100 / 100
 184 ms 24880 KB 
#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n, m, x, y, z;

int main() {
    scanf("%d %d", &n, &m);
    vector<vector<pii>> oper(n + 5, vector<pii>());
    for (int i = 1; i <= m; i++) scanf("%d %d %d", &x, &y, &z), oper[x].emplace_back(z - x, i), oper[y + 1].emplace_back(0, i);
    priority_queue<pii> pq;
    vector<bool> cadd(m + 5);
    for (int i = 1; i <= n; i++) {
        for (auto &[x, y]: oper[i]) {
            if (!cadd[y]) pq.emplace(x, y);
            cadd[y] = !cadd[y];
        }
        while (!pq.empty() && !cadd[pq.top().second]) pq.pop();
        printf("%d ", pq.empty() ? 0 : pq.top().first + i);
    }
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
trading.cpp:11:39: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for (int i = 1; i <= m; i++) scanf("%d %d %d", &x, &y, &z), oper[x].emplace_back(z - x, i), oper[y + 1].emplace_back(0, i);
      |                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 81 ms 12400 KB Output is correct
8 Correct 86 ms 14668 KB Output is correct
9 Correct 90 ms 15160 KB Output is correct
10 Correct 94 ms 15804 KB Output is correct
11 Correct 105 ms 17876 KB Output is correct
12 Correct 128 ms 18396 KB Output is correct
13 Correct 115 ms 18352 KB Output is correct
14 Correct 111 ms 18176 KB Output is correct
15 Correct 143 ms 21168 KB Output is correct
16 Correct 144 ms 21016 KB Output is correct
17 Correct 147 ms 20536 KB Output is correct
18 Correct 162 ms 22764 KB Output is correct
19 Correct 139 ms 22356 KB Output is correct
20 Correct 184 ms 24880 KB Output is correct