oj.uz

Submission #988009

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 7 ms 8640 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 8664 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 3 ms 9044 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 6 ms 8664 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 4 ms 8024 KB Output is correct
22 Correct 4 ms 8792 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8628 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 26616 KB Output is correct
2 Correct 61 ms 26544 KB Output is correct
3 Correct 59 ms 26524 KB Output is correct
4 Correct 58 ms 27896 KB Output is correct
5 Correct 56 ms 18592 KB Output is correct
6 Correct 53 ms 18264 KB Output is correct
7 Correct 57 ms 25772 KB Output is correct
8 Correct 63 ms 25732 KB Output is correct
9 Correct 12 ms 8540 KB Output is correct
10 Correct 58 ms 27312 KB Output is correct
11 Correct 12 ms 8796 KB Output is correct
12 Correct 27 ms 9548 KB Output is correct
13 Correct 60 ms 27580 KB Output is correct
14 Correct 64 ms 27820 KB Output is correct
15 Correct 14 ms 8796 KB Output is correct
16 Correct 67 ms 26800 KB Output is correct
17 Correct 61 ms 27900 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 59 ms 27224 KB Output is correct
20 Correct 57 ms 28080 KB Output is correct
21 Correct 13 ms 8620 KB Output is correct
22 Correct 59 ms 17352 KB Output is correct
23 Correct 63 ms 25488 KB Output is correct
24 Correct 12 ms 8796 KB Output is correct
25 Correct 12 ms 8636 KB Output is correct
26 Correct 50 ms 19144 KB Output is correct
27 Correct 49 ms 18616 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 7 ms 8640 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 8664 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 3 ms 9044 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 6 ms 8664 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 4 ms 8024 KB Output is correct
22 Correct 4 ms 8792 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8628 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 65 ms 26616 KB Output is correct
30 Correct 61 ms 26544 KB Output is correct
31 Correct 59 ms 26524 KB Output is correct
32 Correct 58 ms 27896 KB Output is correct
33 Correct 56 ms 18592 KB Output is correct
34 Correct 53 ms 18264 KB Output is correct
35 Correct 57 ms 25772 KB Output is correct
36 Correct 63 ms 25732 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 58 ms 27312 KB Output is correct
39 Correct 12 ms 8796 KB Output is correct
40 Correct 27 ms 9548 KB Output is correct
41 Correct 60 ms 27580 KB Output is correct
42 Correct 64 ms 27820 KB Output is correct
43 Correct 14 ms 8796 KB Output is correct
44 Correct 67 ms 26800 KB Output is correct
45 Correct 61 ms 27900 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 59 ms 27224 KB Output is correct
48 Correct 57 ms 28080 KB Output is correct
49 Correct 13 ms 8620 KB Output is correct
50 Correct 59 ms 17352 KB Output is correct
51 Correct 63 ms 25488 KB Output is correct
52 Correct 12 ms 8796 KB Output is correct
53 Correct 12 ms 8636 KB Output is correct
54 Correct 50 ms 19144 KB Output is correct
55 Correct 49 ms 18616 KB Output is correct
56 Correct 159 ms 34976 KB Output is correct
57 Correct 126 ms 32460 KB Output is correct
58 Correct 134 ms 34840 KB Output is correct
59 Correct 119 ms 31796 KB Output is correct
60 Correct 151 ms 26448 KB Output is correct
61 Correct 128 ms 33800 KB Output is correct
62 Correct 116 ms 31164 KB Output is correct
63 Correct 101 ms 28944 KB Output is correct
64 Correct 59 ms 12416 KB Output is correct
65 Correct 139 ms 32812 KB Output is correct
66 Correct 51 ms 13140 KB Output is correct
67 Correct 50 ms 12064 KB Output is correct
68 Correct 73 ms 27564 KB Output is correct
69 Correct 129 ms 33588 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 70 ms 27756 KB Output is correct
72 Correct 116 ms 31544 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 65 ms 19388 KB Output is correct
75 Correct 148 ms 35636 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 59 ms 18112 KB Output is correct
78 Correct 101 ms 29840 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10712 KB Output is correct
2 Correct 36 ms 9696 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 12 ms 8952 KB Output is correct
5 Correct 152 ms 34368 KB Output is correct
6 Correct 139 ms 33340 KB Output is correct
7 Correct 137 ms 32620 KB Output is correct
8 Correct 133 ms 32568 KB Output is correct
9 Correct 146 ms 33692 KB Output is correct
10 Correct 153 ms 33084 KB Output is correct
11 Correct 134 ms 30456 KB Output is correct
12 Correct 121 ms 31272 KB Output is correct
13 Correct 101 ms 14656 KB Output is correct
14 Correct 140 ms 32996 KB Output is correct
15 Correct 147 ms 32128 KB Output is correct
16 Correct 62 ms 18884 KB Output is correct
17 Correct 73 ms 27168 KB Output is correct
18 Correct 158 ms 32092 KB Output is correct
19 Correct 61 ms 26548 KB Output is correct
20 Correct 87 ms 26464 KB Output is correct
21 Correct 144 ms 32388 KB Output is correct
22 Correct 57 ms 18372 KB Output is correct
23 Correct 65 ms 26808 KB Output is correct
24 Correct 142 ms 34612 KB Output is correct
25 Correct 58 ms 27208 KB Output is correct
26 Correct 56 ms 26584 KB Output is correct
27 Correct 132 ms 30388 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 7 ms 8640 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 6 ms 8664 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 3 ms 9044 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 6 ms 8664 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 4 ms 8024 KB Output is correct
22 Correct 4 ms 8792 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 8628 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 65 ms 26616 KB Output is correct
30 Correct 61 ms 26544 KB Output is correct
31 Correct 59 ms 26524 KB Output is correct
32 Correct 58 ms 27896 KB Output is correct
33 Correct 56 ms 18592 KB Output is correct
34 Correct 53 ms 18264 KB Output is correct
35 Correct 57 ms 25772 KB Output is correct
36 Correct 63 ms 25732 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 58 ms 27312 KB Output is correct
39 Correct 12 ms 8796 KB Output is correct
40 Correct 27 ms 9548 KB Output is correct
41 Correct 60 ms 27580 KB Output is correct
42 Correct 64 ms 27820 KB Output is correct
43 Correct 14 ms 8796 KB Output is correct
44 Correct 67 ms 26800 KB Output is correct
45 Correct 61 ms 27900 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 59 ms 27224 KB Output is correct
48 Correct 57 ms 28080 KB Output is correct
49 Correct 13 ms 8620 KB Output is correct
50 Correct 59 ms 17352 KB Output is correct
51 Correct 63 ms 25488 KB Output is correct
52 Correct 12 ms 8796 KB Output is correct
53 Correct 12 ms 8636 KB Output is correct
54 Correct 50 ms 19144 KB Output is correct
55 Correct 49 ms 18616 KB Output is correct
56 Correct 159 ms 34976 KB Output is correct
57 Correct 126 ms 32460 KB Output is correct
58 Correct 134 ms 34840 KB Output is correct
59 Correct 119 ms 31796 KB Output is correct
60 Correct 151 ms 26448 KB Output is correct
61 Correct 128 ms 33800 KB Output is correct
62 Correct 116 ms 31164 KB Output is correct
63 Correct 101 ms 28944 KB Output is correct
64 Correct 59 ms 12416 KB Output is correct
65 Correct 139 ms 32812 KB Output is correct
66 Correct 51 ms 13140 KB Output is correct
67 Correct 50 ms 12064 KB Output is correct
68 Correct 73 ms 27564 KB Output is correct
69 Correct 129 ms 33588 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 70 ms 27756 KB Output is correct
72 Correct 116 ms 31544 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 65 ms 19388 KB Output is correct
75 Correct 148 ms 35636 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 59 ms 18112 KB Output is correct
78 Correct 101 ms 29840 KB Output is correct
79 Correct 39 ms 10712 KB Output is correct
80 Correct 36 ms 9696 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 12 ms 8952 KB Output is correct
83 Correct 152 ms 34368 KB Output is correct
84 Correct 139 ms 33340 KB Output is correct
85 Correct 137 ms 32620 KB Output is correct
86 Correct 133 ms 32568 KB Output is correct
87 Correct 146 ms 33692 KB Output is correct
88 Correct 153 ms 33084 KB Output is correct
89 Correct 134 ms 30456 KB Output is correct
90 Correct 121 ms 31272 KB Output is correct
91 Correct 101 ms 14656 KB Output is correct
92 Correct 140 ms 32996 KB Output is correct
93 Correct 147 ms 32128 KB Output is correct
94 Correct 62 ms 18884 KB Output is correct
95 Correct 73 ms 27168 KB Output is correct
96 Correct 158 ms 32092 KB Output is correct
97 Correct 61 ms 26548 KB Output is correct
98 Correct 87 ms 26464 KB Output is correct
99 Correct 144 ms 32388 KB Output is correct
100 Correct 57 ms 18372 KB Output is correct
101 Correct 65 ms 26808 KB Output is correct
102 Correct 142 ms 34612 KB Output is correct
103 Correct 58 ms 27208 KB Output is correct
104 Correct 56 ms 26584 KB Output is correct
105 Correct 132 ms 30388 KB Output is correct
106 Correct 36 ms 9176 KB Output is correct
107 Correct 42 ms 10952 KB Output is correct
108 Correct 38 ms 9932 KB Output is correct
109 Correct 41 ms 10700 KB Output is correct
110 Correct 158 ms 33860 KB Output is correct
111 Correct 154 ms 33088 KB Output is correct
112 Correct 156 ms 34876 KB Output is correct
113 Correct 167 ms 32788 KB Output is correct
114 Correct 154 ms 34348 KB Output is correct
115 Correct 146 ms 33080 KB Output is correct
116 Correct 159 ms 49324 KB Output is correct
117 Correct 133 ms 31144 KB Output is correct
118 Correct 113 ms 16600 KB Output is correct
119 Correct 60 ms 13388 KB Output is correct
120 Correct 160 ms 33780 KB Output is correct
121 Correct 67 ms 28348 KB Output is correct
122 Correct 75 ms 28080 KB Output is correct
123 Correct 174 ms 34400 KB Output is correct
124 Correct 62 ms 18360 KB Output is correct
125 Correct 77 ms 27848 KB Output is correct
126 Correct 145 ms 33332 KB Output is correct
127 Correct 59 ms 19396 KB Output is correct
128 Correct 74 ms 27832 KB Output is correct
129 Correct 161 ms 35384 KB Output is correct
130 Correct 63 ms 28348 KB Output is correct
131 Correct 71 ms 27968 KB Output is correct
132 Correct 133 ms 31896 KB Output is correct