oj.uz

Submission #988031

# Submission time Handle Problem Language Result Execution time Memory
988031 2024-05-23T20:43:57 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 174 ms 48520 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:121:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  121 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:141:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:147:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  147 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:165:15: warning: unused variable 'curr2' [-Wunused-variable]
  165 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5688 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5844 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5464 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 5416 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 23156 KB Output is correct
2 Correct 62 ms 22964 KB Output is correct
3 Correct 62 ms 22872 KB Output is correct
4 Correct 64 ms 23064 KB Output is correct
5 Correct 60 ms 15072 KB Output is correct
6 Correct 52 ms 14524 KB Output is correct
7 Correct 67 ms 22712 KB Output is correct
8 Correct 58 ms 22908 KB Output is correct
9 Correct 13 ms 5724 KB Output is correct
10 Correct 67 ms 23000 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 27 ms 6608 KB Output is correct
13 Correct 65 ms 22700 KB Output is correct
14 Correct 66 ms 22956 KB Output is correct
15 Correct 14 ms 5724 KB Output is correct
16 Correct 71 ms 22528 KB Output is correct
17 Correct 67 ms 22964 KB Output is correct
18 Correct 21 ms 6364 KB Output is correct
19 Correct 63 ms 23076 KB Output is correct
20 Correct 59 ms 23296 KB Output is correct
21 Correct 14 ms 5720 KB Output is correct
22 Correct 58 ms 14020 KB Output is correct
23 Correct 64 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 60 ms 14528 KB Output is correct
27 Correct 49 ms 14528 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5688 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5844 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5464 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 5416 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 64 ms 23156 KB Output is correct
30 Correct 62 ms 22964 KB Output is correct
31 Correct 62 ms 22872 KB Output is correct
32 Correct 64 ms 23064 KB Output is correct
33 Correct 60 ms 15072 KB Output is correct
34 Correct 52 ms 14524 KB Output is correct
35 Correct 67 ms 22712 KB Output is correct
36 Correct 58 ms 22908 KB Output is correct
37 Correct 13 ms 5724 KB Output is correct
38 Correct 67 ms 23000 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 6608 KB Output is correct
41 Correct 65 ms 22700 KB Output is correct
42 Correct 66 ms 22956 KB Output is correct
43 Correct 14 ms 5724 KB Output is correct
44 Correct 71 ms 22528 KB Output is correct
45 Correct 67 ms 22964 KB Output is correct
46 Correct 21 ms 6364 KB Output is correct
47 Correct 63 ms 23076 KB Output is correct
48 Correct 59 ms 23296 KB Output is correct
49 Correct 14 ms 5720 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 64 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 60 ms 14528 KB Output is correct
55 Correct 49 ms 14528 KB Output is correct
56 Correct 142 ms 34044 KB Output is correct
57 Correct 143 ms 31156 KB Output is correct
58 Correct 133 ms 32168 KB Output is correct
59 Correct 123 ms 29556 KB Output is correct
60 Correct 135 ms 26284 KB Output is correct
61 Correct 141 ms 32056 KB Output is correct
62 Correct 122 ms 28340 KB Output is correct
63 Correct 107 ms 26032 KB Output is correct
64 Correct 57 ms 10292 KB Output is correct
65 Correct 134 ms 31000 KB Output is correct
66 Correct 55 ms 11344 KB Output is correct
67 Correct 50 ms 9216 KB Output is correct
68 Correct 74 ms 23404 KB Output is correct
69 Correct 140 ms 31968 KB Output is correct
70 Correct 14 ms 5980 KB Output is correct
71 Correct 81 ms 23472 KB Output is correct
72 Correct 133 ms 29484 KB Output is correct
73 Correct 13 ms 5724 KB Output is correct
74 Correct 73 ms 15720 KB Output is correct
75 Correct 140 ms 34464 KB Output is correct
76 Correct 12 ms 6072 KB Output is correct
77 Correct 64 ms 14604 KB Output is correct
78 Correct 104 ms 26252 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 7628 KB Output is correct
2 Correct 37 ms 6616 KB Output is correct
3 Correct 14 ms 5720 KB Output is correct
4 Correct 15 ms 5976 KB Output is correct
5 Correct 166 ms 33972 KB Output is correct
6 Correct 155 ms 32696 KB Output is correct
7 Correct 167 ms 33452 KB Output is correct
8 Correct 145 ms 32432 KB Output is correct
9 Correct 158 ms 34224 KB Output is correct
10 Correct 174 ms 32828 KB Output is correct
11 Correct 154 ms 31360 KB Output is correct
12 Correct 137 ms 30376 KB Output is correct
13 Correct 102 ms 15004 KB Output is correct
14 Correct 161 ms 32816 KB Output is correct
15 Correct 174 ms 32684 KB Output is correct
16 Correct 62 ms 15024 KB Output is correct
17 Correct 75 ms 23080 KB Output is correct
18 Correct 148 ms 32844 KB Output is correct
19 Correct 70 ms 23268 KB Output is correct
20 Correct 77 ms 22956 KB Output is correct
21 Correct 154 ms 31916 KB Output is correct
22 Correct 62 ms 14768 KB Output is correct
23 Correct 82 ms 23208 KB Output is correct
24 Correct 165 ms 33132 KB Output is correct
25 Correct 65 ms 23472 KB Output is correct
26 Correct 70 ms 23380 KB Output is correct
27 Correct 138 ms 29044 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5688 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5844 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 5 ms 5720 KB Output is correct
11 Correct 4 ms 5464 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 5416 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 4 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 64 ms 23156 KB Output is correct
30 Correct 62 ms 22964 KB Output is correct
31 Correct 62 ms 22872 KB Output is correct
32 Correct 64 ms 23064 KB Output is correct
33 Correct 60 ms 15072 KB Output is correct
34 Correct 52 ms 14524 KB Output is correct
35 Correct 67 ms 22712 KB Output is correct
36 Correct 58 ms 22908 KB Output is correct
37 Correct 13 ms 5724 KB Output is correct
38 Correct 67 ms 23000 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 6608 KB Output is correct
41 Correct 65 ms 22700 KB Output is correct
42 Correct 66 ms 22956 KB Output is correct
43 Correct 14 ms 5724 KB Output is correct
44 Correct 71 ms 22528 KB Output is correct
45 Correct 67 ms 22964 KB Output is correct
46 Correct 21 ms 6364 KB Output is correct
47 Correct 63 ms 23076 KB Output is correct
48 Correct 59 ms 23296 KB Output is correct
49 Correct 14 ms 5720 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 64 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 60 ms 14528 KB Output is correct
55 Correct 49 ms 14528 KB Output is correct
56 Correct 142 ms 34044 KB Output is correct
57 Correct 143 ms 31156 KB Output is correct
58 Correct 133 ms 32168 KB Output is correct
59 Correct 123 ms 29556 KB Output is correct
60 Correct 135 ms 26284 KB Output is correct
61 Correct 141 ms 32056 KB Output is correct
62 Correct 122 ms 28340 KB Output is correct
63 Correct 107 ms 26032 KB Output is correct
64 Correct 57 ms 10292 KB Output is correct
65 Correct 134 ms 31000 KB Output is correct
66 Correct 55 ms 11344 KB Output is correct
67 Correct 50 ms 9216 KB Output is correct
68 Correct 74 ms 23404 KB Output is correct
69 Correct 140 ms 31968 KB Output is correct
70 Correct 14 ms 5980 KB Output is correct
71 Correct 81 ms 23472 KB Output is correct
72 Correct 133 ms 29484 KB Output is correct
73 Correct 13 ms 5724 KB Output is correct
74 Correct 73 ms 15720 KB Output is correct
75 Correct 140 ms 34464 KB Output is correct
76 Correct 12 ms 6072 KB Output is correct
77 Correct 64 ms 14604 KB Output is correct
78 Correct 104 ms 26252 KB Output is correct
79 Correct 42 ms 7628 KB Output is correct
80 Correct 37 ms 6616 KB Output is correct
81 Correct 14 ms 5720 KB Output is correct
82 Correct 15 ms 5976 KB Output is correct
83 Correct 166 ms 33972 KB Output is correct
84 Correct 155 ms 32696 KB Output is correct
85 Correct 167 ms 33452 KB Output is correct
86 Correct 145 ms 32432 KB Output is correct
87 Correct 158 ms 34224 KB Output is correct
88 Correct 174 ms 32828 KB Output is correct
89 Correct 154 ms 31360 KB Output is correct
90 Correct 137 ms 30376 KB Output is correct
91 Correct 102 ms 15004 KB Output is correct
92 Correct 161 ms 32816 KB Output is correct
93 Correct 174 ms 32684 KB Output is correct
94 Correct 62 ms 15024 KB Output is correct
95 Correct 75 ms 23080 KB Output is correct
96 Correct 148 ms 32844 KB Output is correct
97 Correct 70 ms 23268 KB Output is correct
98 Correct 77 ms 22956 KB Output is correct
99 Correct 154 ms 31916 KB Output is correct
100 Correct 62 ms 14768 KB Output is correct
101 Correct 82 ms 23208 KB Output is correct
102 Correct 165 ms 33132 KB Output is correct
103 Correct 65 ms 23472 KB Output is correct
104 Correct 70 ms 23380 KB Output is correct
105 Correct 138 ms 29044 KB Output is correct
106 Correct 40 ms 6472 KB Output is correct
107 Correct 41 ms 7884 KB Output is correct
108 Correct 38 ms 6864 KB Output is correct
109 Correct 45 ms 7892 KB Output is correct
110 Correct 162 ms 33912 KB Output is correct
111 Correct 158 ms 32924 KB Output is correct
112 Correct 162 ms 32948 KB Output is correct
113 Correct 164 ms 31916 KB Output is correct
114 Correct 160 ms 34176 KB Output is correct
115 Correct 156 ms 32700 KB Output is correct
116 Correct 166 ms 48520 KB Output is correct
117 Correct 136 ms 30076 KB Output is correct
118 Correct 109 ms 15952 KB Output is correct
119 Correct 57 ms 10572 KB Output is correct
120 Correct 160 ms 32408 KB Output is correct
121 Correct 69 ms 23484 KB Output is correct
122 Correct 82 ms 23400 KB Output is correct
123 Correct 158 ms 32836 KB Output is correct
124 Correct 66 ms 15536 KB Output is correct
125 Correct 94 ms 23176 KB Output is correct
126 Correct 147 ms 32248 KB Output is correct
127 Correct 61 ms 14536 KB Output is correct
128 Correct 78 ms 23728 KB Output is correct
129 Correct 153 ms 34488 KB Output is correct
130 Correct 70 ms 23464 KB Output is correct
131 Correct 76 ms 23224 KB Output is correct
132 Correct 142 ms 28064 KB Output is correct