#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int MAXN = 600005;
vector<vector<pair<ll, pair<ll, ll>>>> beginr(MAXN), endr(MAXN);
int main()
{
ll n, m;
cin >> n >> m;
multiset<pair<ll, pair<ll, ll>>> curr;
for (int i = 1; i <= m; i++)
{
pair<ll, pair<ll, ll>> temp;
ll f, s, t;
cin >> f >> s >> t;
temp.first = t;
temp.second.first = f;
temp.second.second = s;
beginr[f].push_back(temp);
endr[s + 1].push_back(temp);
}
for (int day = 1; day <= n; day++)
{
for (pair<ll, pair<ll, ll>> e : endr[day])
{
curr.erase(curr.find({e.first, {e.second.first, e.second.second}}));
}
for (pair<ll, pair<ll, ll>> e : beginr[day])
{
curr.insert({e.first, {e.second.first, e.second.second}});
}
pair<ll, pair<ll, ll>> maxi;
if (curr.size() > 0)
{
auto it = curr.end();
it--;
maxi = *(it);
}
else
maxi = {0, {day, day}};
// if (day == 5)
// cout << maxi.first << " " << maxi.second << "\n";
cout << (maxi.first) + day - maxi.second.first;
if (day != n)
cout << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
28372 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
