oj.uz

Submission #867473

# Submission time Handle Problem Language Result Execution time Memory
867473 2023-10-28T13:02:00 Z sleepntsheep Trading (IZhO13_trading) C++17
100 / 100
 273 ms 6596 KB 
#include<bits/stdc++.h>
using namespace std;int n,m,j;priority_queue<pair<int, int>> q;
int main()
{cin>>n>>m;vector<tuple<int,int,int>>v(m);for(auto&[l,r,x]:v)cin>>l>>r>>x;sort(v.begin(),v.end());for(int f,i=1;i<=n;++i){for(;get<0>(v[j])==i;q.emplace(get<2>(v[j])-get<0>(v[j]),get<1>(v[j])),++j);
for(f=0;q.size()&&!f;){auto[z,r]=q.top();if(r>=i)cout<<i+z<<' ',f=1;else q.pop();}if(!f)cout<<"0 ";}}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 396 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 132 ms 3528 KB Output is correct
8 Correct 139 ms 4072 KB Output is correct
9 Correct 144 ms 4616 KB Output is correct
10 Correct 178 ms 5104 KB Output is correct
11 Correct 155 ms 4780 KB Output is correct
12 Correct 178 ms 5576 KB Output is correct
13 Correct 187 ms 4864 KB Output is correct
14 Correct 182 ms 5024 KB Output is correct
15 Correct 273 ms 6336 KB Output is correct
16 Correct 220 ms 5328 KB Output is correct
17 Correct 202 ms 5580 KB Output is correct
18 Correct 235 ms 6180 KB Output is correct
19 Correct 213 ms 6596 KB Output is correct
20 Correct 254 ms 6568 KB Output is correct