Submission #1302227

#TimeUsernameProblemLanguageResultExecution timeMemory
1302227PetrixTrading (IZhO13_trading)C++20
100 / 100
187 ms22832 KiB
#include <iostream> #include <vector> #include <set> using namespace std; #define int long long multiset<int>s; vector<int> st[300001],dr[300001]; signed main(){ ios_base::sync_with_stdio(false);cin.tie(NULL); int n,m,st1,dr1,a,i; cin>>n>>m; for(i=1;i<=m;i++){ cin>>st1>>dr1>>a; st[st1].push_back(a-st1); dr[dr1].push_back(a-st1); } for(i=1;i<=n;i++){ for(auto it:st[i]) s.insert(it); if(!s.empty()) cout<<*s.rbegin()+i<<" "; else cout<<"0 "; for(auto it:dr[i]) s.erase(s.find(it)); } }
#Verdict Execution timeMemoryGrader output
Fetching results...