oj.uz

Submission #987902

# Submission time Handle Problem Language Result Execution time Memory
987902 2024-05-23T18:59:55 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 214 ms 53696 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
long long inf=1e9+10;
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<long long >arr;
vector<long long >adj[200005];
long long cost[200005];
vector<long long>ord;
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
long long init[200005];
node special(node curr)
{
    long long g,g2;
    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)
{
    long long g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g]==0)
    {
       curr.sum=curr.sum-adj[g][curr.lst];
    }
    else
        curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-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 godown(node curr)
{
    int g,g2;
    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)
{
    int g;
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandshift(node curr)
{
    int g;
    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)
{
    int g;
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    return curr;
}
signed  main()
{
    long long  n,m,k,i,a,b;
    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);
    }
    long long imp=0,minim=inf,poz=m;
    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(long long 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
            {
                long long vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(long long 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 g=ord[0];
        if(x[g]==0)
        {
            curr.layer=0;
            curr.sum=adj[g][0];
            curr.bitipref=0;
            curr.lst=0;
            curr.biti=1;
            curr.rghtbord=adj[g].size()-1;
            pq.push(curr);
        }
        else
        {
            curr.layer=0;
            curr.sum=adj[g][x[g]]-adj[g][x[g]-1];
            curr.bitipref=x[g]-1;
            curr.lst=x[g];
            curr.rghtbord=adj[g].size()-1;
            curr.biti=x[g];
            pq.push(curr);
        }
        while(pq.size() && k && imp==0)
        {
            curr=pq.top();
            pq.pop();
            k--;
            cout<<curr.sum+sum<<'\n';
            g=ord[curr.layer];
            if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            if(curr.lst+1<=curr.rghtbord)
            {
                curr2=shift(curr);
                pq.push(curr2);
            }
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
            {
                curr2=fixborderandshift(curr);
                pq.push(curr2);
            }
            if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g])
            {
                curr2=fixborderandcreate(curr);
                pq.push(curr2);
            }
            if(curr.layer+1<=m)
            {
                curr2=godown(curr);
                pq.push(curr2);
            }
        }
    }
    while(k)
    {
        k--;
        cout<<-1<<'\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:37:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   37 |     long long g,g2;
      |               ^
Main.cpp: In function 'node godown(node)':
Main.cpp:73:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   73 |     int g,g2;
      |         ^
Main.cpp: In function 'int main()':
Main.cpp:139:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  139 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:163:37: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |                 for(long long j=0; j<adj[i].size(); j++)
      |                                    ~^~~~~~~~~~~~~~
Main.cpp:171:33: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  171 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:185:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  185 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:128:21: warning: unused variable 'minim' [-Wunused-variable]
  128 |     long long imp=0,minim=inf,poz=m;
      |                     ^~~~~
Main.cpp:128:31: warning: unused variable 'poz' [-Wunused-variable]
  128 |     long long imp=0,minim=inf,poz=m;
      |                               ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10232 KB Output is correct
2 Correct 5 ms 10076 KB Output is correct
3 Correct 5 ms 10200 KB Output is correct
4 Correct 5 ms 10076 KB Output is correct
5 Correct 5 ms 10072 KB Output is correct
6 Correct 5 ms 10076 KB Output is correct
7 Correct 6 ms 10076 KB Output is correct
8 Correct 4 ms 10076 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 5 ms 10200 KB Output is correct
11 Correct 4 ms 9560 KB Output is correct
12 Correct 4 ms 9816 KB Output is correct
13 Correct 4 ms 10072 KB Output is correct
14 Correct 5 ms 10072 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10076 KB Output is correct
18 Correct 3 ms 9816 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10076 KB Output is correct
21 Correct 3 ms 9564 KB Output is correct
22 Correct 3 ms 10076 KB Output is correct
23 Correct 5 ms 10076 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10072 KB Output is correct
27 Correct 4 ms 10076 KB Output is correct
28 Correct 4 ms 10072 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 27604 KB Output is correct
2 Correct 63 ms 27312 KB Output is correct
3 Correct 61 ms 27316 KB Output is correct
4 Correct 61 ms 27576 KB Output is correct
5 Correct 53 ms 19384 KB Output is correct
6 Correct 52 ms 18876 KB Output is correct
7 Correct 62 ms 27064 KB Output is correct
8 Correct 57 ms 27036 KB Output is correct
9 Correct 13 ms 10328 KB Output is correct
10 Correct 61 ms 27324 KB Output is correct
11 Correct 14 ms 10328 KB Output is correct
12 Correct 27 ms 11216 KB Output is correct
13 Correct 65 ms 27064 KB Output is correct
14 Correct 63 ms 27568 KB Output is correct
15 Correct 16 ms 10332 KB Output is correct
16 Correct 63 ms 27064 KB Output is correct
17 Correct 66 ms 27360 KB Output is correct
18 Correct 20 ms 10712 KB Output is correct
19 Correct 76 ms 27480 KB Output is correct
20 Correct 59 ms 27864 KB Output is correct
21 Correct 13 ms 10328 KB Output is correct
22 Correct 55 ms 18828 KB Output is correct
23 Correct 56 ms 26804 KB Output is correct
24 Correct 12 ms 10328 KB Output is correct
25 Correct 12 ms 10332 KB Output is correct
26 Correct 49 ms 21180 KB Output is correct
27 Correct 50 ms 20528 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10232 KB Output is correct
2 Correct 5 ms 10076 KB Output is correct
3 Correct 5 ms 10200 KB Output is correct
4 Correct 5 ms 10076 KB Output is correct
5 Correct 5 ms 10072 KB Output is correct
6 Correct 5 ms 10076 KB Output is correct
7 Correct 6 ms 10076 KB Output is correct
8 Correct 4 ms 10076 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 5 ms 10200 KB Output is correct
11 Correct 4 ms 9560 KB Output is correct
12 Correct 4 ms 9816 KB Output is correct
13 Correct 4 ms 10072 KB Output is correct
14 Correct 5 ms 10072 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10076 KB Output is correct
18 Correct 3 ms 9816 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10076 KB Output is correct
21 Correct 3 ms 9564 KB Output is correct
22 Correct 3 ms 10076 KB Output is correct
23 Correct 5 ms 10076 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10072 KB Output is correct
27 Correct 4 ms 10076 KB Output is correct
28 Correct 4 ms 10072 KB Output is correct
29 Correct 62 ms 27604 KB Output is correct
30 Correct 63 ms 27312 KB Output is correct
31 Correct 61 ms 27316 KB Output is correct
32 Correct 61 ms 27576 KB Output is correct
33 Correct 53 ms 19384 KB Output is correct
34 Correct 52 ms 18876 KB Output is correct
35 Correct 62 ms 27064 KB Output is correct
36 Correct 57 ms 27036 KB Output is correct
37 Correct 13 ms 10328 KB Output is correct
38 Correct 61 ms 27324 KB Output is correct
39 Correct 14 ms 10328 KB Output is correct
40 Correct 27 ms 11216 KB Output is correct
41 Correct 65 ms 27064 KB Output is correct
42 Correct 63 ms 27568 KB Output is correct
43 Correct 16 ms 10332 KB Output is correct
44 Correct 63 ms 27064 KB Output is correct
45 Correct 66 ms 27360 KB Output is correct
46 Correct 20 ms 10712 KB Output is correct
47 Correct 76 ms 27480 KB Output is correct
48 Correct 59 ms 27864 KB Output is correct
49 Correct 13 ms 10328 KB Output is correct
50 Correct 55 ms 18828 KB Output is correct
51 Correct 56 ms 26804 KB Output is correct
52 Correct 12 ms 10328 KB Output is correct
53 Correct 12 ms 10332 KB Output is correct
54 Correct 49 ms 21180 KB Output is correct
55 Correct 50 ms 20528 KB Output is correct
56 Correct 136 ms 34404 KB Output is correct
57 Correct 133 ms 34104 KB Output is correct
58 Correct 130 ms 33076 KB Output is correct
59 Correct 145 ms 31940 KB Output is correct
60 Correct 148 ms 24876 KB Output is correct
61 Correct 176 ms 30600 KB Output is correct
62 Correct 131 ms 30904 KB Output is correct
63 Correct 131 ms 28360 KB Output is correct
64 Correct 57 ms 12872 KB Output is correct
65 Correct 158 ms 34552 KB Output is correct
66 Correct 64 ms 15716 KB Output is correct
67 Correct 50 ms 13668 KB Output is correct
68 Correct 81 ms 29440 KB Output is correct
69 Correct 175 ms 36828 KB Output is correct
70 Correct 17 ms 10588 KB Output is correct
71 Correct 81 ms 29148 KB Output is correct
72 Correct 148 ms 34132 KB Output is correct
73 Correct 13 ms 10188 KB Output is correct
74 Correct 69 ms 20900 KB Output is correct
75 Correct 172 ms 37576 KB Output is correct
76 Correct 15 ms 8112 KB Output is correct
77 Correct 74 ms 20248 KB Output is correct
78 Correct 122 ms 30512 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10200 KB Output is correct
2 Correct 43 ms 10992 KB Output is correct
3 Correct 14 ms 8284 KB Output is correct
4 Correct 13 ms 10328 KB Output is correct
5 Correct 191 ms 35864 KB Output is correct
6 Correct 190 ms 36308 KB Output is correct
7 Correct 193 ms 35212 KB Output is correct
8 Correct 160 ms 34624 KB Output is correct
9 Correct 176 ms 35940 KB Output is correct
10 Correct 214 ms 34496 KB Output is correct
11 Correct 167 ms 33572 KB Output is correct
12 Correct 125 ms 33232 KB Output is correct
13 Correct 113 ms 16904 KB Output is correct
14 Correct 165 ms 34872 KB Output is correct
15 Correct 154 ms 36404 KB Output is correct
16 Correct 65 ms 19360 KB Output is correct
17 Correct 84 ms 27444 KB Output is correct
18 Correct 161 ms 35088 KB Output is correct
19 Correct 67 ms 25780 KB Output is correct
20 Correct 83 ms 25316 KB Output is correct
21 Correct 198 ms 34620 KB Output is correct
22 Correct 63 ms 17336 KB Output is correct
23 Correct 70 ms 27552 KB Output is correct
24 Correct 197 ms 35776 KB Output is correct
25 Correct 68 ms 27944 KB Output is correct
26 Correct 66 ms 27316 KB Output is correct
27 Correct 135 ms 33020 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10232 KB Output is correct
2 Correct 5 ms 10076 KB Output is correct
3 Correct 5 ms 10200 KB Output is correct
4 Correct 5 ms 10076 KB Output is correct
5 Correct 5 ms 10072 KB Output is correct
6 Correct 5 ms 10076 KB Output is correct
7 Correct 6 ms 10076 KB Output is correct
8 Correct 4 ms 10076 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 5 ms 10200 KB Output is correct
11 Correct 4 ms 9560 KB Output is correct
12 Correct 4 ms 9816 KB Output is correct
13 Correct 4 ms 10072 KB Output is correct
14 Correct 5 ms 10072 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10076 KB Output is correct
18 Correct 3 ms 9816 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10076 KB Output is correct
21 Correct 3 ms 9564 KB Output is correct
22 Correct 3 ms 10076 KB Output is correct
23 Correct 5 ms 10076 KB Output is correct
24 Correct 4 ms 9816 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10072 KB Output is correct
27 Correct 4 ms 10076 KB Output is correct
28 Correct 4 ms 10072 KB Output is correct
29 Correct 62 ms 27604 KB Output is correct
30 Correct 63 ms 27312 KB Output is correct
31 Correct 61 ms 27316 KB Output is correct
32 Correct 61 ms 27576 KB Output is correct
33 Correct 53 ms 19384 KB Output is correct
34 Correct 52 ms 18876 KB Output is correct
35 Correct 62 ms 27064 KB Output is correct
36 Correct 57 ms 27036 KB Output is correct
37 Correct 13 ms 10328 KB Output is correct
38 Correct 61 ms 27324 KB Output is correct
39 Correct 14 ms 10328 KB Output is correct
40 Correct 27 ms 11216 KB Output is correct
41 Correct 65 ms 27064 KB Output is correct
42 Correct 63 ms 27568 KB Output is correct
43 Correct 16 ms 10332 KB Output is correct
44 Correct 63 ms 27064 KB Output is correct
45 Correct 66 ms 27360 KB Output is correct
46 Correct 20 ms 10712 KB Output is correct
47 Correct 76 ms 27480 KB Output is correct
48 Correct 59 ms 27864 KB Output is correct
49 Correct 13 ms 10328 KB Output is correct
50 Correct 55 ms 18828 KB Output is correct
51 Correct 56 ms 26804 KB Output is correct
52 Correct 12 ms 10328 KB Output is correct
53 Correct 12 ms 10332 KB Output is correct
54 Correct 49 ms 21180 KB Output is correct
55 Correct 50 ms 20528 KB Output is correct
56 Correct 136 ms 34404 KB Output is correct
57 Correct 133 ms 34104 KB Output is correct
58 Correct 130 ms 33076 KB Output is correct
59 Correct 145 ms 31940 KB Output is correct
60 Correct 148 ms 24876 KB Output is correct
61 Correct 176 ms 30600 KB Output is correct
62 Correct 131 ms 30904 KB Output is correct
63 Correct 131 ms 28360 KB Output is correct
64 Correct 57 ms 12872 KB Output is correct
65 Correct 158 ms 34552 KB Output is correct
66 Correct 64 ms 15716 KB Output is correct
67 Correct 50 ms 13668 KB Output is correct
68 Correct 81 ms 29440 KB Output is correct
69 Correct 175 ms 36828 KB Output is correct
70 Correct 17 ms 10588 KB Output is correct
71 Correct 81 ms 29148 KB Output is correct
72 Correct 148 ms 34132 KB Output is correct
73 Correct 13 ms 10188 KB Output is correct
74 Correct 69 ms 20900 KB Output is correct
75 Correct 172 ms 37576 KB Output is correct
76 Correct 15 ms 8112 KB Output is correct
77 Correct 74 ms 20248 KB Output is correct
78 Correct 122 ms 30512 KB Output is correct
79 Correct 43 ms 10200 KB Output is correct
80 Correct 43 ms 10992 KB Output is correct
81 Correct 14 ms 8284 KB Output is correct
82 Correct 13 ms 10328 KB Output is correct
83 Correct 191 ms 35864 KB Output is correct
84 Correct 190 ms 36308 KB Output is correct
85 Correct 193 ms 35212 KB Output is correct
86 Correct 160 ms 34624 KB Output is correct
87 Correct 176 ms 35940 KB Output is correct
88 Correct 214 ms 34496 KB Output is correct
89 Correct 167 ms 33572 KB Output is correct
90 Correct 125 ms 33232 KB Output is correct
91 Correct 113 ms 16904 KB Output is correct
92 Correct 165 ms 34872 KB Output is correct
93 Correct 154 ms 36404 KB Output is correct
94 Correct 65 ms 19360 KB Output is correct
95 Correct 84 ms 27444 KB Output is correct
96 Correct 161 ms 35088 KB Output is correct
97 Correct 67 ms 25780 KB Output is correct
98 Correct 83 ms 25316 KB Output is correct
99 Correct 198 ms 34620 KB Output is correct
100 Correct 63 ms 17336 KB Output is correct
101 Correct 70 ms 27552 KB Output is correct
102 Correct 197 ms 35776 KB Output is correct
103 Correct 68 ms 27944 KB Output is correct
104 Correct 66 ms 27316 KB Output is correct
105 Correct 135 ms 33020 KB Output is correct
106 Correct 42 ms 6796 KB Output is correct
107 Correct 46 ms 10620 KB Output is correct
108 Correct 39 ms 11344 KB Output is correct
109 Correct 42 ms 7880 KB Output is correct
110 Correct 206 ms 36540 KB Output is correct
111 Correct 203 ms 36064 KB Output is correct
112 Correct 168 ms 35596 KB Output is correct
113 Correct 171 ms 35152 KB Output is correct
114 Correct 191 ms 37452 KB Output is correct
115 Correct 173 ms 35420 KB Output is correct
116 Correct 194 ms 53696 KB Output is correct
117 Correct 159 ms 35472 KB Output is correct
118 Correct 119 ms 20616 KB Output is correct
119 Correct 75 ms 15560 KB Output is correct
120 Correct 179 ms 36704 KB Output is correct
121 Correct 69 ms 28144 KB Output is correct
122 Correct 79 ms 28156 KB Output is correct
123 Correct 191 ms 35872 KB Output is correct
124 Correct 64 ms 20004 KB Output is correct
125 Correct 110 ms 27676 KB Output is correct
126 Correct 147 ms 35604 KB Output is correct
127 Correct 58 ms 20164 KB Output is correct
128 Correct 75 ms 28364 KB Output is correct
129 Correct 153 ms 37176 KB Output is correct
130 Correct 72 ms 28540 KB Output is correct
131 Correct 77 ms 27840 KB Output is correct
132 Correct 138 ms 33764 KB Output is correct