Submission #331239

# Submission time Handle Problem Language Result Execution time Memory
331239 2020-11-27T19:54:55 Z Sho10 Trading (IZhO13_trading) C++14
100 / 100
399 ms 38876 KB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,m;
struct trader{
int left,right,price;
};
trader a[300005];
vector<int>intrare[300005],iesire[300005];
int32_t main(){
CODE_START
cin>>n>>m;
for(int i=1;i<=m;i++)
{
    cin>>a[i].left>>a[i].right>>a[i].price;
  intrare[a[i].left].pb(a[i].price-a[i].left);
  iesire[a[i].right+1].pb(a[i].price-a[i].left);
}
multiset<int>s;
for(int i=1;i<=n;i++)
{
    for(auto it : intrare[i]){
        s.insert(it);
    }
    for(auto it : iesire[i]){
        s.erase(s.find(it));
    }
    if(s.size()==0){
        cout<<0<<' ';
    }else {
    auto it=s.end();
    it--;
    cout<<i+*(it)<<' ';
}
}
}
/*
5 2
1 3 2
2 4 6

6 4
4 4 3
1 2 5
5 6 1
6 6 1
*/

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14444 KB Output is correct
2 Correct 10 ms 14444 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 11 ms 14560 KB Output is correct
5 Correct 12 ms 14572 KB Output is correct
6 Correct 12 ms 14700 KB Output is correct
7 Correct 181 ms 27492 KB Output is correct
8 Correct 202 ms 28664 KB Output is correct
9 Correct 208 ms 29028 KB Output is correct
10 Correct 233 ms 30180 KB Output is correct
11 Correct 230 ms 30820 KB Output is correct
12 Correct 263 ms 32996 KB Output is correct
13 Correct 255 ms 32224 KB Output is correct
14 Correct 281 ms 33376 KB Output is correct
15 Correct 305 ms 34532 KB Output is correct
16 Correct 342 ms 35132 KB Output is correct
17 Correct 322 ms 35316 KB Output is correct
18 Correct 351 ms 38368 KB Output is correct
19 Correct 335 ms 35552 KB Output is correct
20 Correct 399 ms 38876 KB Output is correct