| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 987521 | activedeltorre | Shopping Plans (CCO20_day2problem3) | C++14 | 4034 ms | 399628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
struct node
{
long long layer,sum,lst;
};
struct cmp{
bool operator()(node a,node b)
{return a.sum>b.sum;}
};
priority_queue<node,vector<node>,cmp>pq;
vector<long long >arr;
vector<long long >adj[200005];
int main()
{
long long n,m,k,i,a,b,x,y;
long long sum=0;
cin>>n>>m>>k;
for(i=1;i<=n;i++)
{
cin>>a>>b;
adj[a].push_back(b);
}
for(i=1;i<=m;i++)
{
cin>>x>>y;
sort(adj[i].begin(),adj[i].end());
long long vkuk=adj[i][0];
sum+=adj[i][0];
for(long long j=0;j<adj[i].size();j++)
{
adj[i][j]-=vkuk;
}
}
// sort(arr.begin(),arr.end());
// cout<<sum<<'\n';
node curr,curr2;
pq.push({1,0,0});
while(pq.size() && k)
{
curr=pq.top();
pq.pop();
if(curr.layer==m+1)
{
k--;
cout<<curr.sum+sum<<'\n';
}
else
{
if(curr.lst+1<adj[curr.layer].size())
{
curr2=curr;
curr2.lst++;
curr2.sum=curr2.sum-adj[curr.layer][curr.lst]+adj[curr.layer][curr.lst+1];
pq.push(curr2);
}
curr2=curr;
curr2.lst=0;
curr2.layer++;
pq.push(curr2);
}
}
while(k)
{
k--;
cout<<-1<<'\n';
}
return 0;
}
/*
5 2 7
1 5
1 3
2 3
1 6
2 1
1 1
1 1*/
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
