답안 #946611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946611 2024-03-14T19:46:21 Z Zena_Hossam 거래 (IZhO13_trading) C++14
0 / 100
70 ms 17476 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+i+1==-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++){
      |                         ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Incorrect 70 ms 17476 KB Output isn't correct
8 Halted 0 ms 0 KB -