oj.uz

Submission #987524

# Submission time Handle Problem Language Result Execution time Memory
987524 2024-05-23T00:37:13 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
0 / 25
 4000 ms 399676 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
//ifstream cin("a.in");
//ofstream cout("a.out");
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];
int  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);
    }
    int imp=0;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        sort(adj[i].begin(),adj[i].end());
        if(adj[i].size()==0)
        {
            imp=1;
        }
        else
        {
            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';
    k--;
    node curr,curr2;
    pq.push({1,0,0});
    while(pq.size() && k && imp==0)
    {
        curr=pq.top();
        pq.pop();
        if(curr.lst!=0)
        {
            k--;
            cout<<curr.sum+sum<<'\n';
        }
        if(curr.layer!=m+1)
        {
            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

Main.cpp: In function 'int main()':
Main.cpp:52:34: 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]
   52 |             for(long long  j=0; j<adj[i].size(); j++)
      |                                 ~^~~~~~~~~~~~~~
Main.cpp:74:26: 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]
   74 |             if(curr.lst+1<adj[curr.layer].size())
      |                ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 56492 KB Output is correct
2 Correct 193 ms 31068 KB Output is correct
3 Correct 424 ms 55200 KB Output is correct
4 Correct 89 ms 12732 KB Output is correct
5 Correct 296 ms 31656 KB Output is correct
6 Correct 222 ms 55204 KB Output is correct
7 Correct 68 ms 19384 KB Output is correct
8 Correct 5 ms 5672 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 197 ms 30844 KB Output is correct
11 Incorrect 3 ms 5208 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4059 ms 399676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 56492 KB Output is correct
2 Correct 193 ms 31068 KB Output is correct
3 Correct 424 ms 55200 KB Output is correct
4 Correct 89 ms 12732 KB Output is correct
5 Correct 296 ms 31656 KB Output is correct
6 Correct 222 ms 55204 KB Output is correct
7 Correct 68 ms 19384 KB Output is correct
8 Correct 5 ms 5672 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 197 ms 30844 KB Output is correct
11 Incorrect 3 ms 5208 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 5.0

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

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 56492 KB Output is correct
2 Correct 193 ms 31068 KB Output is correct
3 Correct 424 ms 55200 KB Output is correct
4 Correct 89 ms 12732 KB Output is correct
5 Correct 296 ms 31656 KB Output is correct
6 Correct 222 ms 55204 KB Output is correct
7 Correct 68 ms 19384 KB Output is correct
8 Correct 5 ms 5672 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 197 ms 30844 KB Output is correct
11 Incorrect 3 ms 5208 KB Output isn't correct
12 Halted 0 ms 0 KB -