oj.uz

Submission #987990

# Submission time Handle Problem Language Result Execution time Memory
987990 2024-05-23T20:08:47 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 218 ms 46200 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
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];
vector<int>ord;
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)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    curr.lst=0;
    curr.sum+=adj[g2][0];
    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;
}
signed  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.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)
    {
        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<<" ";
            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<<" ";
    return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 4 ms 8548 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 7 ms 5724 KB Output is correct
6 Correct 8 ms 5592 KB Output is correct
7 Correct 7 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 5 ms 5588 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 7 ms 8536 KB Output is correct
15 Correct 5 ms 6108 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 5620 KB Output is correct
18 Correct 4 ms 6232 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 6 ms 5468 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 7 ms 5588 KB Output is correct
27 Correct 5 ms 6488 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 23056 KB Output is correct
2 Correct 73 ms 23748 KB Output is correct
3 Correct 83 ms 23628 KB Output is correct
4 Correct 66 ms 23016 KB Output is correct
5 Correct 72 ms 15684 KB Output is correct
6 Correct 70 ms 14572 KB Output is correct
7 Correct 63 ms 22744 KB Output is correct
8 Correct 65 ms 23480 KB Output is correct
9 Correct 16 ms 5724 KB Output is correct
10 Correct 76 ms 22804 KB Output is correct
11 Correct 15 ms 6492 KB Output is correct
12 Correct 29 ms 7636 KB Output is correct
13 Correct 77 ms 22664 KB Output is correct
14 Correct 67 ms 23984 KB Output is correct
15 Correct 16 ms 6744 KB Output is correct
16 Correct 66 ms 22456 KB Output is correct
17 Correct 80 ms 23716 KB Output is correct
18 Correct 31 ms 6240 KB Output is correct
19 Correct 69 ms 22872 KB Output is correct
20 Correct 82 ms 24056 KB Output is correct
21 Correct 18 ms 6592 KB Output is correct
22 Correct 60 ms 14272 KB Output is correct
23 Correct 75 ms 22188 KB Output is correct
24 Correct 17 ms 6744 KB Output is correct
25 Correct 18 ms 5692 KB Output is correct
26 Correct 54 ms 15432 KB Output is correct
27 Correct 51 ms 14532 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 4 ms 8548 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 7 ms 5724 KB Output is correct
6 Correct 8 ms 5592 KB Output is correct
7 Correct 7 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 5 ms 5588 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 7 ms 8536 KB Output is correct
15 Correct 5 ms 6108 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 5620 KB Output is correct
18 Correct 4 ms 6232 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 6 ms 5468 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 7 ms 5588 KB Output is correct
27 Correct 5 ms 6488 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct
29 Correct 70 ms 23056 KB Output is correct
30 Correct 73 ms 23748 KB Output is correct
31 Correct 83 ms 23628 KB Output is correct
32 Correct 66 ms 23016 KB Output is correct
33 Correct 72 ms 15684 KB Output is correct
34 Correct 70 ms 14572 KB Output is correct
35 Correct 63 ms 22744 KB Output is correct
36 Correct 65 ms 23480 KB Output is correct
37 Correct 16 ms 5724 KB Output is correct
38 Correct 76 ms 22804 KB Output is correct
39 Correct 15 ms 6492 KB Output is correct
40 Correct 29 ms 7636 KB Output is correct
41 Correct 77 ms 22664 KB Output is correct
42 Correct 67 ms 23984 KB Output is correct
43 Correct 16 ms 6744 KB Output is correct
44 Correct 66 ms 22456 KB Output is correct
45 Correct 80 ms 23716 KB Output is correct
46 Correct 31 ms 6240 KB Output is correct
47 Correct 69 ms 22872 KB Output is correct
48 Correct 82 ms 24056 KB Output is correct
49 Correct 18 ms 6592 KB Output is correct
50 Correct 60 ms 14272 KB Output is correct
51 Correct 75 ms 22188 KB Output is correct
52 Correct 17 ms 6744 KB Output is correct
53 Correct 18 ms 5692 KB Output is correct
54 Correct 54 ms 15432 KB Output is correct
55 Correct 51 ms 14532 KB Output is correct
56 Correct 198 ms 31452 KB Output is correct
57 Correct 139 ms 30008 KB Output is correct
58 Correct 165 ms 29580 KB Output is correct
59 Correct 137 ms 27436 KB Output is correct
60 Correct 148 ms 24268 KB Output is correct
61 Correct 140 ms 30744 KB Output is correct
62 Correct 126 ms 25328 KB Output is correct
63 Correct 123 ms 24892 KB Output is correct
64 Correct 64 ms 8772 KB Output is correct
65 Correct 153 ms 28844 KB Output is correct
66 Correct 55 ms 10560 KB Output is correct
67 Correct 52 ms 9208 KB Output is correct
68 Correct 92 ms 23472 KB Output is correct
69 Correct 141 ms 29500 KB Output is correct
70 Correct 17 ms 7004 KB Output is correct
71 Correct 92 ms 23500 KB Output is correct
72 Correct 146 ms 28472 KB Output is correct
73 Correct 13 ms 5856 KB Output is correct
74 Correct 70 ms 18816 KB Output is correct
75 Correct 162 ms 32056 KB Output is correct
76 Correct 12 ms 5724 KB Output is correct
77 Correct 74 ms 17344 KB Output is correct
78 Correct 106 ms 26916 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10708 KB Output is correct
2 Correct 37 ms 6468 KB Output is correct
3 Correct 16 ms 8788 KB Output is correct
4 Correct 15 ms 5976 KB Output is correct
5 Correct 174 ms 30548 KB Output is correct
6 Correct 180 ms 29408 KB Output is correct
7 Correct 172 ms 29888 KB Output is correct
8 Correct 154 ms 29248 KB Output is correct
9 Correct 192 ms 30832 KB Output is correct
10 Correct 147 ms 29096 KB Output is correct
11 Correct 161 ms 27708 KB Output is correct
12 Correct 125 ms 28144 KB Output is correct
13 Correct 101 ms 11600 KB Output is correct
14 Correct 159 ms 29448 KB Output is correct
15 Correct 187 ms 29212 KB Output is correct
16 Correct 66 ms 16560 KB Output is correct
17 Correct 76 ms 23984 KB Output is correct
18 Correct 175 ms 29680 KB Output is correct
19 Correct 85 ms 23244 KB Output is correct
20 Correct 76 ms 22972 KB Output is correct
21 Correct 152 ms 28632 KB Output is correct
22 Correct 72 ms 17724 KB Output is correct
23 Correct 76 ms 22980 KB Output is correct
24 Correct 154 ms 30588 KB Output is correct
25 Correct 67 ms 26296 KB Output is correct
26 Correct 65 ms 23308 KB Output is correct
27 Correct 126 ms 28064 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 4 ms 8548 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 7 ms 5724 KB Output is correct
6 Correct 8 ms 5592 KB Output is correct
7 Correct 7 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 5 ms 5588 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 7 ms 8536 KB Output is correct
15 Correct 5 ms 6108 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 5620 KB Output is correct
18 Correct 4 ms 6232 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 6 ms 5468 KB Output is correct
23 Correct 6 ms 5468 KB Output is correct
24 Correct 4 ms 6232 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 7 ms 5588 KB Output is correct
27 Correct 5 ms 6488 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct
29 Correct 70 ms 23056 KB Output is correct
30 Correct 73 ms 23748 KB Output is correct
31 Correct 83 ms 23628 KB Output is correct
32 Correct 66 ms 23016 KB Output is correct
33 Correct 72 ms 15684 KB Output is correct
34 Correct 70 ms 14572 KB Output is correct
35 Correct 63 ms 22744 KB Output is correct
36 Correct 65 ms 23480 KB Output is correct
37 Correct 16 ms 5724 KB Output is correct
38 Correct 76 ms 22804 KB Output is correct
39 Correct 15 ms 6492 KB Output is correct
40 Correct 29 ms 7636 KB Output is correct
41 Correct 77 ms 22664 KB Output is correct
42 Correct 67 ms 23984 KB Output is correct
43 Correct 16 ms 6744 KB Output is correct
44 Correct 66 ms 22456 KB Output is correct
45 Correct 80 ms 23716 KB Output is correct
46 Correct 31 ms 6240 KB Output is correct
47 Correct 69 ms 22872 KB Output is correct
48 Correct 82 ms 24056 KB Output is correct
49 Correct 18 ms 6592 KB Output is correct
50 Correct 60 ms 14272 KB Output is correct
51 Correct 75 ms 22188 KB Output is correct
52 Correct 17 ms 6744 KB Output is correct
53 Correct 18 ms 5692 KB Output is correct
54 Correct 54 ms 15432 KB Output is correct
55 Correct 51 ms 14532 KB Output is correct
56 Correct 198 ms 31452 KB Output is correct
57 Correct 139 ms 30008 KB Output is correct
58 Correct 165 ms 29580 KB Output is correct
59 Correct 137 ms 27436 KB Output is correct
60 Correct 148 ms 24268 KB Output is correct
61 Correct 140 ms 30744 KB Output is correct
62 Correct 126 ms 25328 KB Output is correct
63 Correct 123 ms 24892 KB Output is correct
64 Correct 64 ms 8772 KB Output is correct
65 Correct 153 ms 28844 KB Output is correct
66 Correct 55 ms 10560 KB Output is correct
67 Correct 52 ms 9208 KB Output is correct
68 Correct 92 ms 23472 KB Output is correct
69 Correct 141 ms 29500 KB Output is correct
70 Correct 17 ms 7004 KB Output is correct
71 Correct 92 ms 23500 KB Output is correct
72 Correct 146 ms 28472 KB Output is correct
73 Correct 13 ms 5856 KB Output is correct
74 Correct 70 ms 18816 KB Output is correct
75 Correct 162 ms 32056 KB Output is correct
76 Correct 12 ms 5724 KB Output is correct
77 Correct 74 ms 17344 KB Output is correct
78 Correct 106 ms 26916 KB Output is correct
79 Correct 40 ms 10708 KB Output is correct
80 Correct 37 ms 6468 KB Output is correct
81 Correct 16 ms 8788 KB Output is correct
82 Correct 15 ms 5976 KB Output is correct
83 Correct 174 ms 30548 KB Output is correct
84 Correct 180 ms 29408 KB Output is correct
85 Correct 172 ms 29888 KB Output is correct
86 Correct 154 ms 29248 KB Output is correct
87 Correct 192 ms 30832 KB Output is correct
88 Correct 147 ms 29096 KB Output is correct
89 Correct 161 ms 27708 KB Output is correct
90 Correct 125 ms 28144 KB Output is correct
91 Correct 101 ms 11600 KB Output is correct
92 Correct 159 ms 29448 KB Output is correct
93 Correct 187 ms 29212 KB Output is correct
94 Correct 66 ms 16560 KB Output is correct
95 Correct 76 ms 23984 KB Output is correct
96 Correct 175 ms 29680 KB Output is correct
97 Correct 85 ms 23244 KB Output is correct
98 Correct 76 ms 22972 KB Output is correct
99 Correct 152 ms 28632 KB Output is correct
100 Correct 72 ms 17724 KB Output is correct
101 Correct 76 ms 22980 KB Output is correct
102 Correct 154 ms 30588 KB Output is correct
103 Correct 67 ms 26296 KB Output is correct
104 Correct 65 ms 23308 KB Output is correct
105 Correct 126 ms 28064 KB Output is correct
106 Correct 40 ms 9296 KB Output is correct
107 Correct 44 ms 7880 KB Output is correct
108 Correct 40 ms 9808 KB Output is correct
109 Correct 47 ms 7844 KB Output is correct
110 Correct 198 ms 31616 KB Output is correct
111 Correct 188 ms 30720 KB Output is correct
112 Correct 186 ms 30432 KB Output is correct
113 Correct 185 ms 29432 KB Output is correct
114 Correct 218 ms 32032 KB Output is correct
115 Correct 168 ms 30264 KB Output is correct
116 Correct 182 ms 46200 KB Output is correct
117 Correct 146 ms 28192 KB Output is correct
118 Correct 111 ms 14292 KB Output is correct
119 Correct 63 ms 11344 KB Output is correct
120 Correct 177 ms 29964 KB Output is correct
121 Correct 72 ms 23376 KB Output is correct
122 Correct 94 ms 24272 KB Output is correct
123 Correct 188 ms 30748 KB Output is correct
124 Correct 77 ms 16252 KB Output is correct
125 Correct 85 ms 23968 KB Output is correct
126 Correct 149 ms 30052 KB Output is correct
127 Correct 62 ms 15508 KB Output is correct
128 Correct 76 ms 26616 KB Output is correct
129 Correct 161 ms 32204 KB Output is correct
130 Correct 73 ms 26196 KB Output is correct
131 Correct 78 ms 26192 KB Output is correct
132 Correct 137 ms 28268 KB Output is correct