oj.uz

Submission #988014

# Submission time Handle Problem Language Result Execution time Memory
988014 2024-05-23T20:28:37 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
10 / 25
 178 ms 30796 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
int inf=1000000070;
struct node
{
    long long  sum;
    int layer,bitipref,lst,rghtbord,biti;
};
struct  cmp
{
    bool operator()(node a,node  b)
        {return a.sum>b.sum;}
};
priority_queue<node,vector<node>,cmp>pq;
vector<int>adj[200005];
int cost[200005];
int ord[200005];
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
int init[200005];
int g,g2;
node special(node curr)
{
    g2=ord[curr.layer+1];
    curr.lst=0;
    curr.sum+=init[g2];
    curr.layer++;
    curr.biti=1;
    curr.bitipref=0;
    curr.rghtbord=adj[g2].size()-1;
    return curr;
}
node skip(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g]==0)
       curr.sum-=adj[g][curr.lst];
    else
        curr.sum+=adj[g][curr.lst-1]-adj[g][curr.lst];
    if(x[g2]==0)
        return special(curr);
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node godown(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
        return special(curr);
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum+=adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node shift(node curr)
{
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandshift(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=curr.bitipref;
    curr.bitipref--;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandcreate(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    return curr;
}
int main()
{
    int  n,m,k,i,a,b,j,vkuk;
    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);
    }
    for(i=1; i<=m; i++)
    {
        cin>>x[i]>>y[i];
        if(y[i]==0)
            cost[i]=inf;
        else
        {
            sort(adj[i].begin(),adj[i].end());
            if(adj[i].size()<x[i])
            {
                for(j=1; j<=k; j++)
                    cout<<-1<<'\n';
                return 0;
            }
            if(x[i]==0)
            {
                if(adj[i].size()==0)
                    cost[i]=inf;
                else
                {
                    init[i]=adj[i][0];
                    cost[i]=adj[i][0];
                }
            }
            else
            {
                vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(j=0; j<adj[i].size(); j++)
                {
                    if(j+1<=x[i])
                        sum+=adj[i][j];
                    adj[i][j]-=vkuk;
                }
                if(adj[i].size()==x[i])
                    cost[i]=inf;
                else
                    cost[i]=adj[i][x[i]]-adj[i][x[i]-1];
            }
        }
        ord[i-1]=i;
    }
    sort(ord,ord+m,cmp2);
    m--;
    for(i=0; i<m; i++)
    {
        if(cost[ord[i]]==inf)
        {
            m=i-1;
            break;
        }
    }
    node curr,curr2;
    cout<<sum<<'\n';
    k--;
    if(m>=0)
    {
        int g3=ord[0];
        if(x[g3]==0)
        {
            curr.layer=0;
            curr.sum=adj[g3][0];
            curr.bitipref=0;
            curr.lst=0;
            curr.biti=1;
            curr.rghtbord=adj[g3].size()-1;
            pq.push(curr);
        }
        else
        {
            curr.layer=0;
            curr.sum=adj[g3][x[g3]]-adj[g3][x[g3]-1];
            curr.bitipref=x[g3]-1;
            curr.lst=x[g3];
            curr.rghtbord=adj[g3].size()-1;
            curr.biti=x[g3];
            pq.push(curr);
        }
        while(pq.size() && k)
        {
            curr=pq.top();
            pq.pop();
            k--;
            cout<<curr.sum+sum<<'\n';
            g3=ord[curr.layer];
            if(x[g3]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0)
                pq.push(skip(curr));
            else if(curr.lst==x[g3] && curr.bitipref==x[g3]-1 && curr.biti==x[g3] && curr.layer+1<=m)
                pq.push(skip(curr));
            if(curr.lst+1<=curr.rghtbord)
                pq.push(shift(curr));
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
                pq.push(fixborderandshift(curr));
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g3])
                pq.push(fixborderandcreate(curr));
            if(curr.layer+1<=m)
                pq.push(godown(curr));
        }
    }
    while(k--)
        cout<<-1<<'\n';
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:119:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  119 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:139:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:145:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  145 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:163:15: warning: unused variable 'curr2' [-Wunused-variable]
  163 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5720 KB Output is correct
2 Correct 6 ms 5620 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5464 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5188 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5176 KB Output is correct
26 Correct 5 ms 5588 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 23132 KB Output is correct
2 Correct 65 ms 22952 KB Output is correct
3 Correct 64 ms 22964 KB Output is correct
4 Correct 62 ms 22936 KB Output is correct
5 Correct 59 ms 14628 KB Output is correct
6 Correct 57 ms 14512 KB Output is correct
7 Correct 80 ms 22700 KB Output is correct
8 Correct 60 ms 22448 KB Output is correct
9 Correct 15 ms 5724 KB Output is correct
10 Correct 62 ms 22956 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 28 ms 6616 KB Output is correct
13 Correct 66 ms 22716 KB Output is correct
14 Correct 67 ms 22996 KB Output is correct
15 Correct 17 ms 5872 KB Output is correct
16 Correct 64 ms 22556 KB Output is correct
17 Correct 66 ms 22708 KB Output is correct
18 Correct 22 ms 6364 KB Output is correct
19 Correct 63 ms 22972 KB Output is correct
20 Correct 68 ms 23352 KB Output is correct
21 Incorrect 17 ms 5724 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5720 KB Output is correct
2 Correct 6 ms 5620 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5464 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5188 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5176 KB Output is correct
26 Correct 5 ms 5588 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct
29 Correct 68 ms 23132 KB Output is correct
30 Correct 65 ms 22952 KB Output is correct
31 Correct 64 ms 22964 KB Output is correct
32 Correct 62 ms 22936 KB Output is correct
33 Correct 59 ms 14628 KB Output is correct
34 Correct 57 ms 14512 KB Output is correct
35 Correct 80 ms 22700 KB Output is correct
36 Correct 60 ms 22448 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 62 ms 22956 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 66 ms 22716 KB Output is correct
42 Correct 67 ms 22996 KB Output is correct
43 Correct 17 ms 5872 KB Output is correct
44 Correct 64 ms 22556 KB Output is correct
45 Correct 66 ms 22708 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 63 ms 22972 KB Output is correct
48 Correct 68 ms 23352 KB Output is correct
49 Incorrect 17 ms 5724 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 7640 KB Output is correct
2 Correct 37 ms 6616 KB Output is correct
3 Correct 19 ms 5720 KB Output is correct
4 Correct 20 ms 5980 KB Output is correct
5 Correct 178 ms 30580 KB Output is correct
6 Correct 147 ms 29364 KB Output is correct
7 Correct 147 ms 29868 KB Output is correct
8 Correct 143 ms 28772 KB Output is correct
9 Correct 161 ms 30640 KB Output is correct
10 Correct 148 ms 29116 KB Output is correct
11 Correct 142 ms 27824 KB Output is correct
12 Correct 123 ms 27044 KB Output is correct
13 Correct 101 ms 11596 KB Output is correct
14 Correct 152 ms 29348 KB Output is correct
15 Correct 153 ms 29360 KB Output is correct
16 Correct 62 ms 15024 KB Output is correct
17 Correct 75 ms 23024 KB Output is correct
18 Correct 155 ms 29488 KB Output is correct
19 Correct 72 ms 23232 KB Output is correct
20 Correct 76 ms 22956 KB Output is correct
21 Correct 145 ms 28784 KB Output is correct
22 Correct 64 ms 14812 KB Output is correct
23 Correct 77 ms 23152 KB Output is correct
24 Correct 162 ms 30796 KB Output is correct
25 Correct 66 ms 23452 KB Output is correct
26 Correct 64 ms 23468 KB Output is correct
27 Correct 130 ms 26576 KB Output is correct

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5720 KB Output is correct
2 Correct 6 ms 5620 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5464 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5188 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5176 KB Output is correct
26 Correct 5 ms 5588 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct
29 Correct 68 ms 23132 KB Output is correct
30 Correct 65 ms 22952 KB Output is correct
31 Correct 64 ms 22964 KB Output is correct
32 Correct 62 ms 22936 KB Output is correct
33 Correct 59 ms 14628 KB Output is correct
34 Correct 57 ms 14512 KB Output is correct
35 Correct 80 ms 22700 KB Output is correct
36 Correct 60 ms 22448 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 62 ms 22956 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 66 ms 22716 KB Output is correct
42 Correct 67 ms 22996 KB Output is correct
43 Correct 17 ms 5872 KB Output is correct
44 Correct 64 ms 22556 KB Output is correct
45 Correct 66 ms 22708 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 63 ms 22972 KB Output is correct
48 Correct 68 ms 23352 KB Output is correct
49 Incorrect 17 ms 5724 KB Output isn't correct
50 Halted 0 ms 0 KB -