oj.uz

Submission #987909

# Submission time Handle Problem Language Result Execution time Memory
987909 2024-05-23T19:04:16 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 183 ms 46120 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;
int 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<int>adj[200005];
int cost[200005];
vector<int>ord;
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
int init[200005];
node special(node curr)
{
    int 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)
{
    int 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()
{
    int  n,m,k,i,a,b;
    long long sum=0,vkuk,j;
    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.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)
        {
            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);
            }
            else 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);
            }
            else 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:36:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   36 |     int g,g2;
      |         ^
Main.cpp: In function 'node godown(node)':
Main.cpp:72:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   72 |     int g,g2;
      |         ^
Main.cpp: In function 'int main()':
Main.cpp:137:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:157:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:163:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  163 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:173:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6488 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 6492 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 4 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 6236 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6556 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6476 KB Output is correct
21 Correct 4 ms 5976 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 5 ms 6488 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 5 ms 6492 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 23988 KB Output is correct
2 Correct 73 ms 23732 KB Output is correct
3 Correct 64 ms 23892 KB Output is correct
4 Correct 69 ms 23732 KB Output is correct
5 Correct 55 ms 15836 KB Output is correct
6 Correct 52 ms 15292 KB Output is correct
7 Correct 62 ms 25520 KB Output is correct
8 Correct 58 ms 23332 KB Output is correct
9 Correct 12 ms 6744 KB Output is correct
10 Correct 65 ms 23808 KB Output is correct
11 Correct 13 ms 6492 KB Output is correct
12 Correct 28 ms 7580 KB Output is correct
13 Correct 68 ms 23564 KB Output is correct
14 Correct 62 ms 23992 KB Output is correct
15 Correct 13 ms 6744 KB Output is correct
16 Correct 70 ms 23580 KB Output is correct
17 Correct 72 ms 23664 KB Output is correct
18 Correct 19 ms 9172 KB Output is correct
19 Correct 73 ms 23728 KB Output is correct
20 Correct 62 ms 26128 KB Output is correct
21 Correct 13 ms 6760 KB Output is correct
22 Correct 58 ms 14800 KB Output is correct
23 Correct 59 ms 23224 KB Output is correct
24 Correct 12 ms 6488 KB Output is correct
25 Correct 13 ms 6544 KB Output is correct
26 Correct 54 ms 15548 KB Output is correct
27 Correct 50 ms 15548 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6488 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 6492 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 4 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 6236 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6556 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6476 KB Output is correct
21 Correct 4 ms 5976 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 5 ms 6488 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 5 ms 6492 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 61 ms 23988 KB Output is correct
30 Correct 73 ms 23732 KB Output is correct
31 Correct 64 ms 23892 KB Output is correct
32 Correct 69 ms 23732 KB Output is correct
33 Correct 55 ms 15836 KB Output is correct
34 Correct 52 ms 15292 KB Output is correct
35 Correct 62 ms 25520 KB Output is correct
36 Correct 58 ms 23332 KB Output is correct
37 Correct 12 ms 6744 KB Output is correct
38 Correct 65 ms 23808 KB Output is correct
39 Correct 13 ms 6492 KB Output is correct
40 Correct 28 ms 7580 KB Output is correct
41 Correct 68 ms 23564 KB Output is correct
42 Correct 62 ms 23992 KB Output is correct
43 Correct 13 ms 6744 KB Output is correct
44 Correct 70 ms 23580 KB Output is correct
45 Correct 72 ms 23664 KB Output is correct
46 Correct 19 ms 9172 KB Output is correct
47 Correct 73 ms 23728 KB Output is correct
48 Correct 62 ms 26128 KB Output is correct
49 Correct 13 ms 6760 KB Output is correct
50 Correct 58 ms 14800 KB Output is correct
51 Correct 59 ms 23224 KB Output is correct
52 Correct 12 ms 6488 KB Output is correct
53 Correct 13 ms 6544 KB Output is correct
54 Correct 54 ms 15548 KB Output is correct
55 Correct 50 ms 15548 KB Output is correct
56 Correct 142 ms 31256 KB Output is correct
57 Correct 128 ms 28720 KB Output is correct
58 Correct 138 ms 29564 KB Output is correct
59 Correct 120 ms 27452 KB Output is correct
60 Correct 161 ms 23588 KB Output is correct
61 Correct 128 ms 29604 KB Output is correct
62 Correct 118 ms 26300 KB Output is correct
63 Correct 120 ms 24628 KB Output is correct
64 Correct 55 ms 8768 KB Output is correct
65 Correct 126 ms 28744 KB Output is correct
66 Correct 61 ms 9296 KB Output is correct
67 Correct 48 ms 10208 KB Output is correct
68 Correct 76 ms 24496 KB Output is correct
69 Correct 146 ms 30388 KB Output is correct
70 Correct 14 ms 7000 KB Output is correct
71 Correct 73 ms 24412 KB Output is correct
72 Correct 132 ms 27604 KB Output is correct
73 Correct 13 ms 8792 KB Output is correct
74 Correct 69 ms 16560 KB Output is correct
75 Correct 137 ms 31884 KB Output is correct
76 Correct 13 ms 6488 KB Output is correct
77 Correct 60 ms 15340 KB Output is correct
78 Correct 114 ms 24992 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 8660 KB Output is correct
2 Correct 36 ms 7384 KB Output is correct
3 Correct 13 ms 6748 KB Output is correct
4 Correct 17 ms 6748 KB Output is correct
5 Correct 159 ms 30864 KB Output is correct
6 Correct 150 ms 29240 KB Output is correct
7 Correct 154 ms 29800 KB Output is correct
8 Correct 143 ms 28732 KB Output is correct
9 Correct 147 ms 30768 KB Output is correct
10 Correct 183 ms 29172 KB Output is correct
11 Correct 136 ms 27692 KB Output is correct
12 Correct 124 ms 27824 KB Output is correct
13 Correct 101 ms 11592 KB Output is correct
14 Correct 172 ms 29456 KB Output is correct
15 Correct 150 ms 29392 KB Output is correct
16 Correct 63 ms 15844 KB Output is correct
17 Correct 84 ms 23924 KB Output is correct
18 Correct 152 ms 29540 KB Output is correct
19 Correct 70 ms 26144 KB Output is correct
20 Correct 71 ms 23908 KB Output is correct
21 Correct 150 ms 28552 KB Output is correct
22 Correct 59 ms 15696 KB Output is correct
23 Correct 77 ms 23876 KB Output is correct
24 Correct 156 ms 30616 KB Output is correct
25 Correct 64 ms 24308 KB Output is correct
26 Correct 60 ms 26300 KB Output is correct
27 Correct 131 ms 27344 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6488 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 6492 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6492 KB Output is correct
7 Correct 5 ms 6492 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 4 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 4 ms 6236 KB Output is correct
16 Correct 4 ms 6492 KB Output is correct
17 Correct 5 ms 6556 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 ms 6476 KB Output is correct
21 Correct 4 ms 5976 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6492 KB Output is correct
24 Correct 5 ms 6488 KB Output is correct
25 Correct 4 ms 6236 KB Output is correct
26 Correct 5 ms 6492 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 4 ms 6492 KB Output is correct
29 Correct 61 ms 23988 KB Output is correct
30 Correct 73 ms 23732 KB Output is correct
31 Correct 64 ms 23892 KB Output is correct
32 Correct 69 ms 23732 KB Output is correct
33 Correct 55 ms 15836 KB Output is correct
34 Correct 52 ms 15292 KB Output is correct
35 Correct 62 ms 25520 KB Output is correct
36 Correct 58 ms 23332 KB Output is correct
37 Correct 12 ms 6744 KB Output is correct
38 Correct 65 ms 23808 KB Output is correct
39 Correct 13 ms 6492 KB Output is correct
40 Correct 28 ms 7580 KB Output is correct
41 Correct 68 ms 23564 KB Output is correct
42 Correct 62 ms 23992 KB Output is correct
43 Correct 13 ms 6744 KB Output is correct
44 Correct 70 ms 23580 KB Output is correct
45 Correct 72 ms 23664 KB Output is correct
46 Correct 19 ms 9172 KB Output is correct
47 Correct 73 ms 23728 KB Output is correct
48 Correct 62 ms 26128 KB Output is correct
49 Correct 13 ms 6760 KB Output is correct
50 Correct 58 ms 14800 KB Output is correct
51 Correct 59 ms 23224 KB Output is correct
52 Correct 12 ms 6488 KB Output is correct
53 Correct 13 ms 6544 KB Output is correct
54 Correct 54 ms 15548 KB Output is correct
55 Correct 50 ms 15548 KB Output is correct
56 Correct 142 ms 31256 KB Output is correct
57 Correct 128 ms 28720 KB Output is correct
58 Correct 138 ms 29564 KB Output is correct
59 Correct 120 ms 27452 KB Output is correct
60 Correct 161 ms 23588 KB Output is correct
61 Correct 128 ms 29604 KB Output is correct
62 Correct 118 ms 26300 KB Output is correct
63 Correct 120 ms 24628 KB Output is correct
64 Correct 55 ms 8768 KB Output is correct
65 Correct 126 ms 28744 KB Output is correct
66 Correct 61 ms 9296 KB Output is correct
67 Correct 48 ms 10208 KB Output is correct
68 Correct 76 ms 24496 KB Output is correct
69 Correct 146 ms 30388 KB Output is correct
70 Correct 14 ms 7000 KB Output is correct
71 Correct 73 ms 24412 KB Output is correct
72 Correct 132 ms 27604 KB Output is correct
73 Correct 13 ms 8792 KB Output is correct
74 Correct 69 ms 16560 KB Output is correct
75 Correct 137 ms 31884 KB Output is correct
76 Correct 13 ms 6488 KB Output is correct
77 Correct 60 ms 15340 KB Output is correct
78 Correct 114 ms 24992 KB Output is correct
79 Correct 40 ms 8660 KB Output is correct
80 Correct 36 ms 7384 KB Output is correct
81 Correct 13 ms 6748 KB Output is correct
82 Correct 17 ms 6748 KB Output is correct
83 Correct 159 ms 30864 KB Output is correct
84 Correct 150 ms 29240 KB Output is correct
85 Correct 154 ms 29800 KB Output is correct
86 Correct 143 ms 28732 KB Output is correct
87 Correct 147 ms 30768 KB Output is correct
88 Correct 183 ms 29172 KB Output is correct
89 Correct 136 ms 27692 KB Output is correct
90 Correct 124 ms 27824 KB Output is correct
91 Correct 101 ms 11592 KB Output is correct
92 Correct 172 ms 29456 KB Output is correct
93 Correct 150 ms 29392 KB Output is correct
94 Correct 63 ms 15844 KB Output is correct
95 Correct 84 ms 23924 KB Output is correct
96 Correct 152 ms 29540 KB Output is correct
97 Correct 70 ms 26144 KB Output is correct
98 Correct 71 ms 23908 KB Output is correct
99 Correct 150 ms 28552 KB Output is correct
100 Correct 59 ms 15696 KB Output is correct
101 Correct 77 ms 23876 KB Output is correct
102 Correct 156 ms 30616 KB Output is correct
103 Correct 64 ms 24308 KB Output is correct
104 Correct 60 ms 26300 KB Output is correct
105 Correct 131 ms 27344 KB Output is correct
106 Correct 36 ms 7128 KB Output is correct
107 Correct 42 ms 8908 KB Output is correct
108 Correct 38 ms 7888 KB Output is correct
109 Correct 44 ms 8652 KB Output is correct
110 Correct 163 ms 31888 KB Output is correct
111 Correct 165 ms 30772 KB Output is correct
112 Correct 179 ms 30504 KB Output is correct
113 Correct 155 ms 29400 KB Output is correct
114 Correct 158 ms 31828 KB Output is correct
115 Correct 159 ms 30260 KB Output is correct
116 Correct 169 ms 46120 KB Output is correct
117 Correct 143 ms 27676 KB Output is correct
118 Correct 113 ms 13568 KB Output is correct
119 Correct 51 ms 11348 KB Output is correct
120 Correct 169 ms 30004 KB Output is correct
121 Correct 73 ms 24468 KB Output is correct
122 Correct 88 ms 26244 KB Output is correct
123 Correct 156 ms 30688 KB Output is correct
124 Correct 64 ms 16388 KB Output is correct
125 Correct 87 ms 24112 KB Output is correct
126 Correct 147 ms 29936 KB Output is correct
127 Correct 60 ms 15592 KB Output is correct
128 Correct 76 ms 24660 KB Output is correct
129 Correct 152 ms 32296 KB Output is correct
130 Correct 72 ms 24252 KB Output is correct
131 Correct 99 ms 24488 KB Output is correct
132 Correct 142 ms 27752 KB Output is correct