oj.uz

Submission #988029

# Submission time Handle Problem Language Result Execution time Memory
988029 2024-05-23T20:40:51 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++11
25 / 25
 185 ms 48640 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;
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 7384 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 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 5388 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 6 ms 7380 KB Output is correct
15 Correct 5 ms 7000 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 5 ms 7384 KB Output is correct
18 Correct 5 ms 7004 KB Output is correct
19 Correct 4 ms 7260 KB Output is correct
20 Correct 5 ms 7428 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 7260 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 4 ms 7004 KB Output is correct
26 Correct 5 ms 7260 KB Output is correct
27 Correct 5 ms 7288 KB Output is correct
28 Correct 5 ms 7260 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 23236 KB Output is correct
2 Correct 68 ms 24496 KB Output is correct
3 Correct 65 ms 24648 KB Output is correct
4 Correct 64 ms 24752 KB Output is correct
5 Correct 56 ms 16560 KB Output is correct
6 Correct 57 ms 16056 KB Output is correct
7 Correct 66 ms 24244 KB Output is correct
8 Correct 59 ms 24248 KB Output is correct
9 Correct 13 ms 7516 KB Output is correct
10 Correct 65 ms 24748 KB Output is correct
11 Correct 13 ms 7516 KB Output is correct
12 Correct 28 ms 8408 KB Output is correct
13 Correct 68 ms 24248 KB Output is correct
14 Correct 72 ms 24756 KB Output is correct
15 Correct 13 ms 7528 KB Output is correct
16 Correct 73 ms 24476 KB Output is correct
17 Correct 66 ms 24496 KB Output is correct
18 Correct 20 ms 7960 KB Output is correct
19 Correct 67 ms 24704 KB Output is correct
20 Correct 65 ms 23472 KB Output is correct
21 Correct 14 ms 5720 KB Output is correct
22 Correct 58 ms 15552 KB Output is correct
23 Correct 60 ms 23988 KB Output is correct
24 Correct 13 ms 7516 KB Output is correct
25 Correct 13 ms 7512 KB Output is correct
26 Correct 52 ms 16308 KB Output is correct
27 Correct 55 ms 16308 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 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 5388 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 6 ms 7380 KB Output is correct
15 Correct 5 ms 7000 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 5 ms 7384 KB Output is correct
18 Correct 5 ms 7004 KB Output is correct
19 Correct 4 ms 7260 KB Output is correct
20 Correct 5 ms 7428 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 7260 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 4 ms 7004 KB Output is correct
26 Correct 5 ms 7260 KB Output is correct
27 Correct 5 ms 7288 KB Output is correct
28 Correct 5 ms 7260 KB Output is correct
29 Correct 62 ms 23236 KB Output is correct
30 Correct 68 ms 24496 KB Output is correct
31 Correct 65 ms 24648 KB Output is correct
32 Correct 64 ms 24752 KB Output is correct
33 Correct 56 ms 16560 KB Output is correct
34 Correct 57 ms 16056 KB Output is correct
35 Correct 66 ms 24244 KB Output is correct
36 Correct 59 ms 24248 KB Output is correct
37 Correct 13 ms 7516 KB Output is correct
38 Correct 65 ms 24748 KB Output is correct
39 Correct 13 ms 7516 KB Output is correct
40 Correct 28 ms 8408 KB Output is correct
41 Correct 68 ms 24248 KB Output is correct
42 Correct 72 ms 24756 KB Output is correct
43 Correct 13 ms 7528 KB Output is correct
44 Correct 73 ms 24476 KB Output is correct
45 Correct 66 ms 24496 KB Output is correct
46 Correct 20 ms 7960 KB Output is correct
47 Correct 67 ms 24704 KB Output is correct
48 Correct 65 ms 23472 KB Output is correct
49 Correct 14 ms 5720 KB Output is correct
50 Correct 58 ms 15552 KB Output is correct
51 Correct 60 ms 23988 KB Output is correct
52 Correct 13 ms 7516 KB Output is correct
53 Correct 13 ms 7512 KB Output is correct
54 Correct 52 ms 16308 KB Output is correct
55 Correct 55 ms 16308 KB Output is correct
56 Correct 155 ms 34916 KB Output is correct
57 Correct 133 ms 32432 KB Output is correct
58 Correct 137 ms 33308 KB Output is correct
59 Correct 127 ms 31172 KB Output is correct
60 Correct 136 ms 27280 KB Output is correct
61 Correct 135 ms 33208 KB Output is correct
62 Correct 123 ms 29868 KB Output is correct
63 Correct 112 ms 27668 KB Output is correct
64 Correct 57 ms 11984 KB Output is correct
65 Correct 141 ms 32616 KB Output is correct
66 Correct 50 ms 13140 KB Output is correct
67 Correct 53 ms 10948 KB Output is correct
68 Correct 77 ms 25208 KB Output is correct
69 Correct 148 ms 33420 KB Output is correct
70 Correct 15 ms 7656 KB Output is correct
71 Correct 76 ms 23504 KB Output is correct
72 Correct 137 ms 29876 KB Output is correct
73 Correct 13 ms 7768 KB Output is correct
74 Correct 68 ms 15800 KB Output is correct
75 Correct 145 ms 35228 KB Output is correct
76 Correct 13 ms 7292 KB Output is correct
77 Correct 65 ms 16068 KB Output is correct
78 Correct 108 ms 27988 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 9432 KB Output is correct
2 Correct 41 ms 8192 KB Output is correct
3 Correct 14 ms 7512 KB Output is correct
4 Correct 14 ms 5980 KB Output is correct
5 Correct 149 ms 34048 KB Output is correct
6 Correct 147 ms 32948 KB Output is correct
7 Correct 144 ms 33448 KB Output is correct
8 Correct 138 ms 32424 KB Output is correct
9 Correct 156 ms 34220 KB Output is correct
10 Correct 144 ms 32736 KB Output is correct
11 Correct 138 ms 31216 KB Output is correct
12 Correct 123 ms 30644 KB Output is correct
13 Correct 101 ms 15048 KB Output is correct
14 Correct 146 ms 32696 KB Output is correct
15 Correct 154 ms 32688 KB Output is correct
16 Correct 65 ms 16588 KB Output is correct
17 Correct 71 ms 24772 KB Output is correct
18 Correct 152 ms 32124 KB Output is correct
19 Correct 67 ms 25008 KB Output is correct
20 Correct 73 ms 24748 KB Output is correct
21 Correct 141 ms 31140 KB Output is correct
22 Correct 61 ms 16640 KB Output is correct
23 Correct 70 ms 24756 KB Output is correct
24 Correct 153 ms 33292 KB Output is correct
25 Correct 62 ms 25012 KB Output is correct
26 Correct 60 ms 25172 KB Output is correct
27 Correct 137 ms 29360 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 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 5388 KB Output is correct
13 Correct 5 ms 7260 KB Output is correct
14 Correct 6 ms 7380 KB Output is correct
15 Correct 5 ms 7000 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 5 ms 7384 KB Output is correct
18 Correct 5 ms 7004 KB Output is correct
19 Correct 4 ms 7260 KB Output is correct
20 Correct 5 ms 7428 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 7260 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 4 ms 7004 KB Output is correct
26 Correct 5 ms 7260 KB Output is correct
27 Correct 5 ms 7288 KB Output is correct
28 Correct 5 ms 7260 KB Output is correct
29 Correct 62 ms 23236 KB Output is correct
30 Correct 68 ms 24496 KB Output is correct
31 Correct 65 ms 24648 KB Output is correct
32 Correct 64 ms 24752 KB Output is correct
33 Correct 56 ms 16560 KB Output is correct
34 Correct 57 ms 16056 KB Output is correct
35 Correct 66 ms 24244 KB Output is correct
36 Correct 59 ms 24248 KB Output is correct
37 Correct 13 ms 7516 KB Output is correct
38 Correct 65 ms 24748 KB Output is correct
39 Correct 13 ms 7516 KB Output is correct
40 Correct 28 ms 8408 KB Output is correct
41 Correct 68 ms 24248 KB Output is correct
42 Correct 72 ms 24756 KB Output is correct
43 Correct 13 ms 7528 KB Output is correct
44 Correct 73 ms 24476 KB Output is correct
45 Correct 66 ms 24496 KB Output is correct
46 Correct 20 ms 7960 KB Output is correct
47 Correct 67 ms 24704 KB Output is correct
48 Correct 65 ms 23472 KB Output is correct
49 Correct 14 ms 5720 KB Output is correct
50 Correct 58 ms 15552 KB Output is correct
51 Correct 60 ms 23988 KB Output is correct
52 Correct 13 ms 7516 KB Output is correct
53 Correct 13 ms 7512 KB Output is correct
54 Correct 52 ms 16308 KB Output is correct
55 Correct 55 ms 16308 KB Output is correct
56 Correct 155 ms 34916 KB Output is correct
57 Correct 133 ms 32432 KB Output is correct
58 Correct 137 ms 33308 KB Output is correct
59 Correct 127 ms 31172 KB Output is correct
60 Correct 136 ms 27280 KB Output is correct
61 Correct 135 ms 33208 KB Output is correct
62 Correct 123 ms 29868 KB Output is correct
63 Correct 112 ms 27668 KB Output is correct
64 Correct 57 ms 11984 KB Output is correct
65 Correct 141 ms 32616 KB Output is correct
66 Correct 50 ms 13140 KB Output is correct
67 Correct 53 ms 10948 KB Output is correct
68 Correct 77 ms 25208 KB Output is correct
69 Correct 148 ms 33420 KB Output is correct
70 Correct 15 ms 7656 KB Output is correct
71 Correct 76 ms 23504 KB Output is correct
72 Correct 137 ms 29876 KB Output is correct
73 Correct 13 ms 7768 KB Output is correct
74 Correct 68 ms 15800 KB Output is correct
75 Correct 145 ms 35228 KB Output is correct
76 Correct 13 ms 7292 KB Output is correct
77 Correct 65 ms 16068 KB Output is correct
78 Correct 108 ms 27988 KB Output is correct
79 Correct 40 ms 9432 KB Output is correct
80 Correct 41 ms 8192 KB Output is correct
81 Correct 14 ms 7512 KB Output is correct
82 Correct 14 ms 5980 KB Output is correct
83 Correct 149 ms 34048 KB Output is correct
84 Correct 147 ms 32948 KB Output is correct
85 Correct 144 ms 33448 KB Output is correct
86 Correct 138 ms 32424 KB Output is correct
87 Correct 156 ms 34220 KB Output is correct
88 Correct 144 ms 32736 KB Output is correct
89 Correct 138 ms 31216 KB Output is correct
90 Correct 123 ms 30644 KB Output is correct
91 Correct 101 ms 15048 KB Output is correct
92 Correct 146 ms 32696 KB Output is correct
93 Correct 154 ms 32688 KB Output is correct
94 Correct 65 ms 16588 KB Output is correct
95 Correct 71 ms 24772 KB Output is correct
96 Correct 152 ms 32124 KB Output is correct
97 Correct 67 ms 25008 KB Output is correct
98 Correct 73 ms 24748 KB Output is correct
99 Correct 141 ms 31140 KB Output is correct
100 Correct 61 ms 16640 KB Output is correct
101 Correct 70 ms 24756 KB Output is correct
102 Correct 153 ms 33292 KB Output is correct
103 Correct 62 ms 25012 KB Output is correct
104 Correct 60 ms 25172 KB Output is correct
105 Correct 137 ms 29360 KB Output is correct
106 Correct 37 ms 8144 KB Output is correct
107 Correct 42 ms 9616 KB Output is correct
108 Correct 41 ms 8648 KB Output is correct
109 Correct 41 ms 9416 KB Output is correct
110 Correct 160 ms 34108 KB Output is correct
111 Correct 169 ms 33180 KB Output is correct
112 Correct 158 ms 33132 KB Output is correct
113 Correct 174 ms 31944 KB Output is correct
114 Correct 175 ms 34484 KB Output is correct
115 Correct 155 ms 32944 KB Output is correct
116 Correct 170 ms 48640 KB Output is correct
117 Correct 146 ms 30160 KB Output is correct
118 Correct 109 ms 16256 KB Output is correct
119 Correct 55 ms 12372 KB Output is correct
120 Correct 185 ms 32752 KB Output is correct
121 Correct 78 ms 25548 KB Output is correct
122 Correct 83 ms 25104 KB Output is correct
123 Correct 180 ms 34736 KB Output is correct
124 Correct 67 ms 17080 KB Output is correct
125 Correct 85 ms 24764 KB Output is correct
126 Correct 163 ms 32624 KB Output is correct
127 Correct 63 ms 16320 KB Output is correct
128 Correct 81 ms 25492 KB Output is correct
129 Correct 181 ms 34868 KB Output is correct
130 Correct 69 ms 25016 KB Output is correct
131 Correct 83 ms 24820 KB Output is correct
132 Correct 144 ms 30492 KB Output is correct