oj.uz

Submission #946613

# Submission time Handle Problem Language Result Execution time Memory
946613 2024-03-14T19:52:37 Z Zena_Hossam Trading (IZhO13_trading) C++14
100 / 100
 185 ms 33156 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double
#define ll long long
//#define ll1 int
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    ll T=1;
    fi
    //cin>>T;ll oo=0;
    while(T--)
    {
        ll n,m;
        cin>>n>>m;
        ll a[m+5]= {},b[m+5]= {},c[m+5]={};
        vector<pair<ll,ll>>s[n+5],v[n+5];
        for(ll i=0; i<m; i++)
        {
            ll x,b1,c1;
            cin>>x>>b1>>c1;a[i]=x,b[i]=b1,c[i]=c1;
            s[x].push_back({c1,i});
        }priority_queue<pair<ll,ll>>q;q.push({-1e18,0});
        for(ll i=1; i<=n; i++)
        {
            for(ll j=0;j<s[i].sz;j++){
                q.push({s[i][j].first-i-1,s[i][j].second});
            }
            while(q.size()>1){//cout<<q.size()<<" "<<b[q.top().second]<<"\n";
                if(b[q.top().second]>=i)
                    break;
                q.pop();
            }
            if(q.top().first==-1e18)cout<<0<<" ";
            else 
            cout<<q.top().first+i+1<<" ";
        }
    }
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:32:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for(ll j=0;j<s[i].sz;j++){
      |                         ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 688 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 68 ms 16452 KB Output is correct
8 Correct 75 ms 18428 KB Output is correct
9 Correct 78 ms 19644 KB Output is correct
10 Correct 88 ms 22860 KB Output is correct
11 Correct 104 ms 21616 KB Output is correct
12 Correct 117 ms 26416 KB Output is correct
13 Correct 102 ms 23484 KB Output is correct
14 Correct 99 ms 24916 KB Output is correct
15 Correct 124 ms 28740 KB Output is correct
16 Correct 121 ms 26952 KB Output is correct
17 Correct 138 ms 27496 KB Output is correct
18 Correct 141 ms 30652 KB Output is correct
19 Correct 128 ms 33156 KB Output is correct
20 Correct 185 ms 32180 KB Output is correct