oj.uz

Submission #277746

# Submission time Handle Problem Language Result Execution time Memory
277746 2020-08-21T07:10:57 Z 최은수(#5116) Shopping Plans (CCO20_day2problem3) C++17
0 / 25
 695 ms 1048580 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
typedef pair<ll,vector<int> >typ;
vector<int>tv[200010];
struct cmp
{
    bool operator()(const typ&x,const typ&y)const
    {
        return x.fi>y.fi;
    }
};
priority_queue<typ,vector<typ>,cmp>pq;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<n;i++)
    {
        int a,c;
        cin>>a>>c;
        tv[a-1].eb(c);
    }
    ll all=0;
    for(int i=0;i<m;i++)
    {
        if(tv[i].empty())
        {
            for(int j=0;j<k;j++)
                cout<<"-1\n";
            cout.flush();
            return 0;
        }
        sort(all(tv[i]));
        all+=tv[i][0];
    }
    vector<int>zv(m,0);
    pq.ep(all,zv);
    int c=0;
    while(!pq.empty()&&c<k)
    {
        ll cost=pq.top().fi;
        vector<int>cur=pq.top().se;
        pq.pop();
        cout<<cost<<'\n';
        c++;
        int cnt=1;
        for(int j=0;j<m;j++)
            cnt*=cur[j]+1;
        for(int j=0;j<m;j++)
        {
            if(cur[j]+1<(int)tv[j].size())
            {
                if(cnt/(cur[j]+1)*(cur[j]+2)>k)
                    continue;
                cost-=tv[j][cur[j]];
                cost+=tv[j][++cur[j]];
                pq.ep(cost,cur);
                cost-=tv[j][cur[j]];
                cost+=tv[j][--cur[j]];
            }
            if(cur[j]!=0)
                break;
        }
    }
    for(int i=c;i<k;i++)
        cout<<"-1\n";
    cout.flush();
    return 0;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 695 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 610 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 695 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 5632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 695 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -