oj.uz

Submission #988016

# Submission time Handle Problem Language Result Execution time Memory
988016 2024-05-23T20:30:13 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 195 ms 48356 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 5724 KB Output is correct
2 Correct 7 ms 5976 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 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 5464 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 5 ms 5368 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 5 ms 5216 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5208 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 23224 KB Output is correct
2 Correct 65 ms 22896 KB Output is correct
3 Correct 65 ms 22928 KB Output is correct
4 Correct 65 ms 22932 KB Output is correct
5 Correct 57 ms 14744 KB Output is correct
6 Correct 60 ms 14520 KB Output is correct
7 Correct 65 ms 22756 KB Output is correct
8 Correct 59 ms 22696 KB Output is correct
9 Correct 15 ms 5724 KB Output is correct
10 Correct 65 ms 22968 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 30 ms 6616 KB Output is correct
13 Correct 66 ms 22644 KB Output is correct
14 Correct 64 ms 23076 KB Output is correct
15 Correct 16 ms 5724 KB Output is correct
16 Correct 78 ms 22540 KB Output is correct
17 Correct 66 ms 23164 KB Output is correct
18 Correct 22 ms 6360 KB Output is correct
19 Correct 64 ms 22992 KB Output is correct
20 Correct 63 ms 23472 KB Output is correct
21 Correct 16 ms 5724 KB Output is correct
22 Correct 58 ms 14024 KB Output is correct
23 Correct 59 ms 22196 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 53 ms 14524 KB Output is correct
27 Correct 57 ms 14508 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 7 ms 5976 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 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 5464 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 5 ms 5368 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 5 ms 5216 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5208 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 67 ms 23224 KB Output is correct
30 Correct 65 ms 22896 KB Output is correct
31 Correct 65 ms 22928 KB Output is correct
32 Correct 65 ms 22932 KB Output is correct
33 Correct 57 ms 14744 KB Output is correct
34 Correct 60 ms 14520 KB Output is correct
35 Correct 65 ms 22756 KB Output is correct
36 Correct 59 ms 22696 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22968 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 30 ms 6616 KB Output is correct
41 Correct 66 ms 22644 KB Output is correct
42 Correct 64 ms 23076 KB Output is correct
43 Correct 16 ms 5724 KB Output is correct
44 Correct 78 ms 22540 KB Output is correct
45 Correct 66 ms 23164 KB Output is correct
46 Correct 22 ms 6360 KB Output is correct
47 Correct 64 ms 22992 KB Output is correct
48 Correct 63 ms 23472 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 58 ms 14024 KB Output is correct
51 Correct 59 ms 22196 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 53 ms 14524 KB Output is correct
55 Correct 57 ms 14508 KB Output is correct
56 Correct 149 ms 33104 KB Output is correct
57 Correct 144 ms 30172 KB Output is correct
58 Correct 140 ms 31084 KB Output is correct
59 Correct 127 ms 28584 KB Output is correct
60 Correct 145 ms 25256 KB Output is correct
61 Correct 150 ms 31260 KB Output is correct
62 Correct 125 ms 27164 KB Output is correct
63 Correct 113 ms 25104 KB Output is correct
64 Correct 61 ms 9540 KB Output is correct
65 Correct 135 ms 30328 KB Output is correct
66 Correct 51 ms 10292 KB Output is correct
67 Correct 59 ms 9276 KB Output is correct
68 Correct 79 ms 23484 KB Output is correct
69 Correct 162 ms 30984 KB Output is correct
70 Correct 18 ms 5980 KB Output is correct
71 Correct 75 ms 23476 KB Output is correct
72 Correct 125 ms 28584 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 67 ms 15816 KB Output is correct
75 Correct 159 ms 33448 KB Output is correct
76 Correct 15 ms 5724 KB Output is correct
77 Correct 62 ms 14528 KB Output is correct
78 Correct 117 ms 25512 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7632 KB Output is correct
2 Correct 36 ms 6604 KB Output is correct
3 Correct 16 ms 5720 KB Output is correct
4 Correct 16 ms 5980 KB Output is correct
5 Correct 159 ms 32904 KB Output is correct
6 Correct 157 ms 31564 KB Output is correct
7 Correct 158 ms 32116 KB Output is correct
8 Correct 148 ms 31152 KB Output is correct
9 Correct 152 ms 32940 KB Output is correct
10 Correct 150 ms 31412 KB Output is correct
11 Correct 147 ms 29948 KB Output is correct
12 Correct 126 ms 29360 KB Output is correct
13 Correct 106 ms 13736 KB Output is correct
14 Correct 155 ms 31536 KB Output is correct
15 Correct 150 ms 31412 KB Output is correct
16 Correct 61 ms 15032 KB Output is correct
17 Correct 94 ms 23188 KB Output is correct
18 Correct 166 ms 31656 KB Output is correct
19 Correct 74 ms 23228 KB Output is correct
20 Correct 77 ms 22972 KB Output is correct
21 Correct 142 ms 30804 KB Output is correct
22 Correct 73 ms 14820 KB Output is correct
23 Correct 70 ms 23220 KB Output is correct
24 Correct 176 ms 32772 KB Output is correct
25 Correct 63 ms 23476 KB Output is correct
26 Correct 63 ms 23472 KB Output is correct
27 Correct 128 ms 28648 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 7 ms 5976 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 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 5464 KB Output is correct
17 Correct 6 ms 5724 KB Output is correct
18 Correct 5 ms 5368 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 5 ms 5216 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5208 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 67 ms 23224 KB Output is correct
30 Correct 65 ms 22896 KB Output is correct
31 Correct 65 ms 22928 KB Output is correct
32 Correct 65 ms 22932 KB Output is correct
33 Correct 57 ms 14744 KB Output is correct
34 Correct 60 ms 14520 KB Output is correct
35 Correct 65 ms 22756 KB Output is correct
36 Correct 59 ms 22696 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22968 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 30 ms 6616 KB Output is correct
41 Correct 66 ms 22644 KB Output is correct
42 Correct 64 ms 23076 KB Output is correct
43 Correct 16 ms 5724 KB Output is correct
44 Correct 78 ms 22540 KB Output is correct
45 Correct 66 ms 23164 KB Output is correct
46 Correct 22 ms 6360 KB Output is correct
47 Correct 64 ms 22992 KB Output is correct
48 Correct 63 ms 23472 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 58 ms 14024 KB Output is correct
51 Correct 59 ms 22196 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 53 ms 14524 KB Output is correct
55 Correct 57 ms 14508 KB Output is correct
56 Correct 149 ms 33104 KB Output is correct
57 Correct 144 ms 30172 KB Output is correct
58 Correct 140 ms 31084 KB Output is correct
59 Correct 127 ms 28584 KB Output is correct
60 Correct 145 ms 25256 KB Output is correct
61 Correct 150 ms 31260 KB Output is correct
62 Correct 125 ms 27164 KB Output is correct
63 Correct 113 ms 25104 KB Output is correct
64 Correct 61 ms 9540 KB Output is correct
65 Correct 135 ms 30328 KB Output is correct
66 Correct 51 ms 10292 KB Output is correct
67 Correct 59 ms 9276 KB Output is correct
68 Correct 79 ms 23484 KB Output is correct
69 Correct 162 ms 30984 KB Output is correct
70 Correct 18 ms 5980 KB Output is correct
71 Correct 75 ms 23476 KB Output is correct
72 Correct 125 ms 28584 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 67 ms 15816 KB Output is correct
75 Correct 159 ms 33448 KB Output is correct
76 Correct 15 ms 5724 KB Output is correct
77 Correct 62 ms 14528 KB Output is correct
78 Correct 117 ms 25512 KB Output is correct
79 Correct 43 ms 7632 KB Output is correct
80 Correct 36 ms 6604 KB Output is correct
81 Correct 16 ms 5720 KB Output is correct
82 Correct 16 ms 5980 KB Output is correct
83 Correct 159 ms 32904 KB Output is correct
84 Correct 157 ms 31564 KB Output is correct
85 Correct 158 ms 32116 KB Output is correct
86 Correct 148 ms 31152 KB Output is correct
87 Correct 152 ms 32940 KB Output is correct
88 Correct 150 ms 31412 KB Output is correct
89 Correct 147 ms 29948 KB Output is correct
90 Correct 126 ms 29360 KB Output is correct
91 Correct 106 ms 13736 KB Output is correct
92 Correct 155 ms 31536 KB Output is correct
93 Correct 150 ms 31412 KB Output is correct
94 Correct 61 ms 15032 KB Output is correct
95 Correct 94 ms 23188 KB Output is correct
96 Correct 166 ms 31656 KB Output is correct
97 Correct 74 ms 23228 KB Output is correct
98 Correct 77 ms 22972 KB Output is correct
99 Correct 142 ms 30804 KB Output is correct
100 Correct 73 ms 14820 KB Output is correct
101 Correct 70 ms 23220 KB Output is correct
102 Correct 176 ms 32772 KB Output is correct
103 Correct 63 ms 23476 KB Output is correct
104 Correct 63 ms 23472 KB Output is correct
105 Correct 128 ms 28648 KB Output is correct
106 Correct 41 ms 6412 KB Output is correct
107 Correct 46 ms 7876 KB Output is correct
108 Correct 40 ms 6860 KB Output is correct
109 Correct 41 ms 7880 KB Output is correct
110 Correct 180 ms 33700 KB Output is correct
111 Correct 181 ms 32920 KB Output is correct
112 Correct 180 ms 32672 KB Output is correct
113 Correct 153 ms 31664 KB Output is correct
114 Correct 159 ms 34040 KB Output is correct
115 Correct 172 ms 32600 KB Output is correct
116 Correct 170 ms 48356 KB Output is correct
117 Correct 138 ms 29892 KB Output is correct
118 Correct 111 ms 15796 KB Output is correct
119 Correct 62 ms 10548 KB Output is correct
120 Correct 195 ms 32196 KB Output is correct
121 Correct 70 ms 23484 KB Output is correct
122 Correct 95 ms 23512 KB Output is correct
123 Correct 163 ms 32692 KB Output is correct
124 Correct 80 ms 15432 KB Output is correct
125 Correct 82 ms 23224 KB Output is correct
126 Correct 150 ms 32092 KB Output is correct
127 Correct 62 ms 14544 KB Output is correct
128 Correct 76 ms 23732 KB Output is correct
129 Correct 155 ms 34444 KB Output is correct
130 Correct 69 ms 23416 KB Output is correct
131 Correct 82 ms 23212 KB Output is correct
132 Correct 138 ms 29880 KB Output is correct