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;
//ifstream cin("a.in");
//ofstream cout("a.out");
long long inf=1e9;
struct node
{
long long layer,sum,lst;
};
struct cmp
{
bool operator()(node a,node b)
{
if(a.sum==b.sum)
{
return a.layer<b.layer;
}
return a.sum>b.sum;
}
};
priority_queue<node,vector<node>,cmp>pq;
vector<long long >arr;
vector<long long >adj[200005];
long long cost[200005];
vector<long long>ord;
bool cmp2(long long a,long long b)
{
return cost[a]<cost[b];
}
signed main()
{
long long n,m,k,i,a,b,x,y;
long long sum=0;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m>>k;
for(i=1; i<=n; i++)
{
cin>>a>>b;
adj[a].push_back(b);
}
long long imp=0,minim=inf,poz=m;
for(i=1; i<=m; i++)
{
cin>>x>>y;
sort(adj[i].begin(),adj[i].end());
if(adj[i].size()<x)
{
for(long long j=1; j<=k; j++)
{
cout<<-1<<'\n';
}
return 0;
}
long long vkuk=adj[i][0];
sum+=adj[i][0];
for(long long j=0; j<adj[i].size(); j++)
{
adj[i][j]-=vkuk;
}
if(adj[i].size()>=2)
{
cost[i]=adj[i][1];
}
else
{
cost[i]=inf;
}
ord.push_back(i);
}
sort(ord.begin(),ord.end(),cmp2);
m--;
for(i=0; i<ord.size(); i++)
{
if(cost[ord[i]]==inf)
{
m=i-1;
break;
}
}
node curr,curr2;
cout<<sum<<'\n';
k--;
if(m>=0)
{
pq.push({0,adj[ord[0]][1],1});
while(pq.size() && k && imp==0)
{
curr=pq.top();
pq.pop();
k--;
cout<<curr.sum+sum<<'\n';
if(curr.lst==1 && curr.layer+1<=m)
{
curr2=curr;
curr2.layer++;
curr2.sum=curr2.sum-cost[ord[curr.layer]]+cost[ord[curr.layer+1]];
pq.push(curr2);
}
if(curr.layer+1<=m)
{
curr2=curr;
curr2.layer++;
curr2.sum=curr2.sum+cost[ord[curr.layer+1]];
pq.push(curr2);
}
if(adj[ord[curr.layer]].size()>curr.lst+1)
{
curr.sum=curr.sum-adj[ord[curr.layer]][curr.lst]+adj[ord[curr.layer]][curr.lst+1];
curr.lst++;
pq.push(curr);
}
}
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)
Main.cpp: In function 'int main()':
Main.cpp:51:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
51 | if(adj[i].size()<x)
| ~~~~~~~~~~~~~^~
Main.cpp:61:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | for(long long j=0; j<adj[i].size(); j++)
| ~^~~~~~~~~~~~~~
Main.cpp:77:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for(i=0; i<ord.size(); i++)
| ~^~~~~~~~~~~
Main.cpp:111:43: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
111 | if(adj[ord[curr.layer]].size()>curr.lst+1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
Main.cpp:46:21: warning: unused variable 'minim' [-Wunused-variable]
46 | long long imp=0,minim=inf,poz=m;
| ^~~~~
Main.cpp:46:31: warning: unused variable 'poz' [-Wunused-variable]
46 | long long imp=0,minim=inf,poz=m;
| ^~~
# | 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... |