oj.uz

Submission #988040

# Submission time Handle Problem Language Result Execution time Memory
988040 2024-05-23T20:52:24 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 180 ms 46132 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
int inf=1000000007;
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;
void 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;
    pq.push(curr);
}
void 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)
        {special(curr);
        return;
        }
    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];
    pq.push(curr);
}
void godown(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
         {special(curr);return;}
    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];
    pq.push(curr);
}
void shift(node curr)
{
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    pq.push(curr);
}
void 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];
    pq.push(curr);
}
void fixborderandcreate(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    pq.push(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)
               skip(curr);
            else if(curr.lst==x[g3] && curr.bitipref==x[g3]-1 && curr.biti==x[g3] && curr.layer+1<=m)
                skip(curr);
            if(curr.lst+1<=curr.rghtbord)
                shift(curr);
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
                fixborderandshift(curr);
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g3])
                fixborderandcreate(curr);
            if(curr.layer+1<=m)
                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 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 6 ms 5724 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 6 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 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 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 3 ms 5208 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 6 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5600 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 23008 KB Output is correct
2 Correct 81 ms 22956 KB Output is correct
3 Correct 62 ms 22952 KB Output is correct
4 Correct 60 ms 22964 KB Output is correct
5 Correct 54 ms 14624 KB Output is correct
6 Correct 60 ms 14564 KB Output is correct
7 Correct 63 ms 22608 KB Output is correct
8 Correct 58 ms 22452 KB Output is correct
9 Correct 13 ms 5720 KB Output is correct
10 Correct 60 ms 22820 KB Output is correct
11 Correct 13 ms 5720 KB Output is correct
12 Correct 27 ms 6616 KB Output is correct
13 Correct 67 ms 22704 KB Output is correct
14 Correct 61 ms 22964 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 77 ms 22476 KB Output is correct
17 Correct 67 ms 22872 KB Output is correct
18 Correct 22 ms 6360 KB Output is correct
19 Correct 62 ms 22900 KB Output is correct
20 Correct 59 ms 23220 KB Output is correct
21 Correct 14 ms 5724 KB Output is correct
22 Correct 59 ms 14032 KB Output is correct
23 Correct 56 ms 22188 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 50 ms 14520 KB Output is correct
27 Correct 48 ms 14532 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5720 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 6 ms 5724 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 6 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 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 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 3 ms 5208 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 6 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5600 KB Output is correct
29 Correct 59 ms 23008 KB Output is correct
30 Correct 81 ms 22956 KB Output is correct
31 Correct 62 ms 22952 KB Output is correct
32 Correct 60 ms 22964 KB Output is correct
33 Correct 54 ms 14624 KB Output is correct
34 Correct 60 ms 14564 KB Output is correct
35 Correct 63 ms 22608 KB Output is correct
36 Correct 58 ms 22452 KB Output is correct
37 Correct 13 ms 5720 KB Output is correct
38 Correct 60 ms 22820 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 27 ms 6616 KB Output is correct
41 Correct 67 ms 22704 KB Output is correct
42 Correct 61 ms 22964 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 77 ms 22476 KB Output is correct
45 Correct 67 ms 22872 KB Output is correct
46 Correct 22 ms 6360 KB Output is correct
47 Correct 62 ms 22900 KB Output is correct
48 Correct 59 ms 23220 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 59 ms 14032 KB Output is correct
51 Correct 56 ms 22188 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 50 ms 14520 KB Output is correct
55 Correct 48 ms 14532 KB Output is correct
56 Correct 135 ms 30768 KB Output is correct
57 Correct 138 ms 28200 KB Output is correct
58 Correct 132 ms 29132 KB Output is correct
59 Correct 120 ms 26804 KB Output is correct
60 Correct 132 ms 23216 KB Output is correct
61 Correct 128 ms 29096 KB Output is correct
62 Correct 120 ms 25524 KB Output is correct
63 Correct 106 ms 23580 KB Output is correct
64 Correct 54 ms 7884 KB Output is correct
65 Correct 127 ms 28216 KB Output is correct
66 Correct 50 ms 8452 KB Output is correct
67 Correct 48 ms 9332 KB Output is correct
68 Correct 85 ms 23380 KB Output is correct
69 Correct 142 ms 29060 KB Output is correct
70 Correct 22 ms 5980 KB Output is correct
71 Correct 75 ms 23420 KB Output is correct
72 Correct 123 ms 26744 KB Output is correct
73 Correct 13 ms 5720 KB Output is correct
74 Correct 65 ms 15788 KB Output is correct
75 Correct 150 ms 31568 KB Output is correct
76 Correct 17 ms 5724 KB Output is correct
77 Correct 60 ms 14524 KB Output is correct
78 Correct 107 ms 23972 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 7640 KB Output is correct
2 Correct 37 ms 6468 KB Output is correct
3 Correct 14 ms 5724 KB Output is correct
4 Correct 13 ms 5980 KB Output is correct
5 Correct 176 ms 30648 KB Output is correct
6 Correct 150 ms 29372 KB Output is correct
7 Correct 149 ms 29928 KB Output is correct
8 Correct 145 ms 28756 KB Output is correct
9 Correct 163 ms 30896 KB Output is correct
10 Correct 149 ms 29072 KB Output is correct
11 Correct 140 ms 27980 KB Output is correct
12 Correct 126 ms 27112 KB Output is correct
13 Correct 101 ms 11728 KB Output is correct
14 Correct 145 ms 29292 KB Output is correct
15 Correct 156 ms 29368 KB Output is correct
16 Correct 61 ms 15032 KB Output is correct
17 Correct 76 ms 22968 KB Output is correct
18 Correct 175 ms 29652 KB Output is correct
19 Correct 69 ms 23468 KB Output is correct
20 Correct 77 ms 23076 KB Output is correct
21 Correct 139 ms 28600 KB Output is correct
22 Correct 64 ms 14920 KB Output is correct
23 Correct 86 ms 22960 KB Output is correct
24 Correct 179 ms 30596 KB Output is correct
25 Correct 71 ms 23484 KB Output is correct
26 Correct 63 ms 23408 KB Output is correct
27 Correct 128 ms 26716 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5720 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 6 ms 5724 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 6 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 5 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 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 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 3 ms 5208 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 6 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5600 KB Output is correct
29 Correct 59 ms 23008 KB Output is correct
30 Correct 81 ms 22956 KB Output is correct
31 Correct 62 ms 22952 KB Output is correct
32 Correct 60 ms 22964 KB Output is correct
33 Correct 54 ms 14624 KB Output is correct
34 Correct 60 ms 14564 KB Output is correct
35 Correct 63 ms 22608 KB Output is correct
36 Correct 58 ms 22452 KB Output is correct
37 Correct 13 ms 5720 KB Output is correct
38 Correct 60 ms 22820 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 27 ms 6616 KB Output is correct
41 Correct 67 ms 22704 KB Output is correct
42 Correct 61 ms 22964 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 77 ms 22476 KB Output is correct
45 Correct 67 ms 22872 KB Output is correct
46 Correct 22 ms 6360 KB Output is correct
47 Correct 62 ms 22900 KB Output is correct
48 Correct 59 ms 23220 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 59 ms 14032 KB Output is correct
51 Correct 56 ms 22188 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 50 ms 14520 KB Output is correct
55 Correct 48 ms 14532 KB Output is correct
56 Correct 135 ms 30768 KB Output is correct
57 Correct 138 ms 28200 KB Output is correct
58 Correct 132 ms 29132 KB Output is correct
59 Correct 120 ms 26804 KB Output is correct
60 Correct 132 ms 23216 KB Output is correct
61 Correct 128 ms 29096 KB Output is correct
62 Correct 120 ms 25524 KB Output is correct
63 Correct 106 ms 23580 KB Output is correct
64 Correct 54 ms 7884 KB Output is correct
65 Correct 127 ms 28216 KB Output is correct
66 Correct 50 ms 8452 KB Output is correct
67 Correct 48 ms 9332 KB Output is correct
68 Correct 85 ms 23380 KB Output is correct
69 Correct 142 ms 29060 KB Output is correct
70 Correct 22 ms 5980 KB Output is correct
71 Correct 75 ms 23420 KB Output is correct
72 Correct 123 ms 26744 KB Output is correct
73 Correct 13 ms 5720 KB Output is correct
74 Correct 65 ms 15788 KB Output is correct
75 Correct 150 ms 31568 KB Output is correct
76 Correct 17 ms 5724 KB Output is correct
77 Correct 60 ms 14524 KB Output is correct
78 Correct 107 ms 23972 KB Output is correct
79 Correct 46 ms 7640 KB Output is correct
80 Correct 37 ms 6468 KB Output is correct
81 Correct 14 ms 5724 KB Output is correct
82 Correct 13 ms 5980 KB Output is correct
83 Correct 176 ms 30648 KB Output is correct
84 Correct 150 ms 29372 KB Output is correct
85 Correct 149 ms 29928 KB Output is correct
86 Correct 145 ms 28756 KB Output is correct
87 Correct 163 ms 30896 KB Output is correct
88 Correct 149 ms 29072 KB Output is correct
89 Correct 140 ms 27980 KB Output is correct
90 Correct 126 ms 27112 KB Output is correct
91 Correct 101 ms 11728 KB Output is correct
92 Correct 145 ms 29292 KB Output is correct
93 Correct 156 ms 29368 KB Output is correct
94 Correct 61 ms 15032 KB Output is correct
95 Correct 76 ms 22968 KB Output is correct
96 Correct 175 ms 29652 KB Output is correct
97 Correct 69 ms 23468 KB Output is correct
98 Correct 77 ms 23076 KB Output is correct
99 Correct 139 ms 28600 KB Output is correct
100 Correct 64 ms 14920 KB Output is correct
101 Correct 86 ms 22960 KB Output is correct
102 Correct 179 ms 30596 KB Output is correct
103 Correct 71 ms 23484 KB Output is correct
104 Correct 63 ms 23408 KB Output is correct
105 Correct 128 ms 26716 KB Output is correct
106 Correct 36 ms 6356 KB Output is correct
107 Correct 42 ms 7880 KB Output is correct
108 Correct 43 ms 6860 KB Output is correct
109 Correct 41 ms 7892 KB Output is correct
110 Correct 169 ms 31832 KB Output is correct
111 Correct 176 ms 30640 KB Output is correct
112 Correct 154 ms 30484 KB Output is correct
113 Correct 150 ms 29580 KB Output is correct
114 Correct 167 ms 31840 KB Output is correct
115 Correct 158 ms 30324 KB Output is correct
116 Correct 172 ms 46132 KB Output is correct
117 Correct 141 ms 27780 KB Output is correct
118 Correct 110 ms 13584 KB Output is correct
119 Correct 52 ms 8312 KB Output is correct
120 Correct 180 ms 30048 KB Output is correct
121 Correct 75 ms 23596 KB Output is correct
122 Correct 83 ms 23380 KB Output is correct
123 Correct 170 ms 30640 KB Output is correct
124 Correct 66 ms 15588 KB Output is correct
125 Correct 80 ms 23248 KB Output is correct
126 Correct 158 ms 30068 KB Output is correct
127 Correct 64 ms 14524 KB Output is correct
128 Correct 78 ms 23792 KB Output is correct
129 Correct 171 ms 32320 KB Output is correct
130 Correct 71 ms 23472 KB Output is correct
131 Correct 78 ms 23224 KB Output is correct
132 Correct 154 ms 27868 KB Output is correct