oj.uz

Submission #987906

# Submission time Handle Problem Language Result Execution time Memory
987906 2024-05-23T19:01:44 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 187 ms 47024 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;
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<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()
{
    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(int 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(int 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: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:138:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  138 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:162:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |                 for(int j=0; j<adj[i].size(); j++)
      |                              ~^~~~~~~~~~~~~~
Main.cpp:170:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  170 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:184:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  184 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:127:21: warning: unused variable 'minim' [-Wunused-variable]
  127 |     long long imp=0,minim=inf,poz=m;
      |                     ^~~~~
Main.cpp:127:31: warning: unused variable 'poz' [-Wunused-variable]
  127 |     long long imp=0,minim=inf,poz=m;
      |                               ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 26604 KB Output is correct
2 Correct 67 ms 27572 KB Output is correct
3 Correct 64 ms 26112 KB Output is correct
4 Correct 58 ms 27056 KB Output is correct
5 Correct 55 ms 18876 KB Output is correct
6 Correct 67 ms 18364 KB Output is correct
7 Correct 67 ms 25644 KB Output is correct
8 Correct 58 ms 27396 KB Output is correct
9 Correct 15 ms 8540 KB Output is correct
10 Correct 66 ms 27576 KB Output is correct
11 Correct 13 ms 8540 KB Output is correct
12 Correct 32 ms 9676 KB Output is correct
13 Correct 64 ms 26644 KB Output is correct
14 Correct 63 ms 26044 KB Output is correct
15 Correct 14 ms 8852 KB Output is correct
16 Correct 68 ms 26852 KB Output is correct
17 Correct 63 ms 26716 KB Output is correct
18 Correct 21 ms 9180 KB Output is correct
19 Correct 61 ms 25728 KB Output is correct
20 Correct 62 ms 26292 KB Output is correct
21 Correct 14 ms 8796 KB Output is correct
22 Correct 63 ms 14792 KB Output is correct
23 Correct 60 ms 25116 KB Output is correct
24 Correct 14 ms 7772 KB Output is correct
25 Correct 13 ms 8540 KB Output is correct
26 Correct 49 ms 17604 KB Output is correct
27 Correct 49 ms 17600 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 6 ms 8536 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 6 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 8792 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 5 ms 8284 KB Output is correct
19 Correct 5 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 6 ms 8284 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 7 ms 8540 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 4 ms 8536 KB Output is correct
29 Correct 67 ms 26604 KB Output is correct
30 Correct 67 ms 27572 KB Output is correct
31 Correct 64 ms 26112 KB Output is correct
32 Correct 58 ms 27056 KB Output is correct
33 Correct 55 ms 18876 KB Output is correct
34 Correct 67 ms 18364 KB Output is correct
35 Correct 67 ms 25644 KB Output is correct
36 Correct 58 ms 27396 KB Output is correct
37 Correct 15 ms 8540 KB Output is correct
38 Correct 66 ms 27576 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 32 ms 9676 KB Output is correct
41 Correct 64 ms 26644 KB Output is correct
42 Correct 63 ms 26044 KB Output is correct
43 Correct 14 ms 8852 KB Output is correct
44 Correct 68 ms 26852 KB Output is correct
45 Correct 63 ms 26716 KB Output is correct
46 Correct 21 ms 9180 KB Output is correct
47 Correct 61 ms 25728 KB Output is correct
48 Correct 62 ms 26292 KB Output is correct
49 Correct 14 ms 8796 KB Output is correct
50 Correct 63 ms 14792 KB Output is correct
51 Correct 60 ms 25116 KB Output is correct
52 Correct 14 ms 7772 KB Output is correct
53 Correct 13 ms 8540 KB Output is correct
54 Correct 49 ms 17604 KB Output is correct
55 Correct 49 ms 17600 KB Output is correct
56 Correct 136 ms 32420 KB Output is correct
57 Correct 139 ms 30032 KB Output is correct
58 Correct 138 ms 30736 KB Output is correct
59 Correct 152 ms 29688 KB Output is correct
60 Correct 154 ms 24240 KB Output is correct
61 Correct 143 ms 32068 KB Output is correct
62 Correct 136 ms 29616 KB Output is correct
63 Correct 132 ms 26664 KB Output is correct
64 Correct 53 ms 10956 KB Output is correct
65 Correct 146 ms 30528 KB Output is correct
66 Correct 64 ms 11436 KB Output is correct
67 Correct 50 ms 10160 KB Output is correct
68 Correct 81 ms 26400 KB Output is correct
69 Correct 167 ms 32180 KB Output is correct
70 Correct 18 ms 9044 KB Output is correct
71 Correct 73 ms 27424 KB Output is correct
72 Correct 134 ms 31188 KB Output is correct
73 Correct 14 ms 8796 KB Output is correct
74 Correct 72 ms 19408 KB Output is correct
75 Correct 154 ms 33768 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 66 ms 18108 KB Output is correct
78 Correct 117 ms 26760 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10712 KB Output is correct
2 Correct 37 ms 9432 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 15 ms 8796 KB Output is correct
5 Correct 178 ms 30748 KB Output is correct
6 Correct 145 ms 29828 KB Output is correct
7 Correct 179 ms 31800 KB Output is correct
8 Correct 179 ms 30804 KB Output is correct
9 Correct 145 ms 31568 KB Output is correct
10 Correct 151 ms 29452 KB Output is correct
11 Correct 137 ms 29708 KB Output is correct
12 Correct 119 ms 30000 KB Output is correct
13 Correct 98 ms 12280 KB Output is correct
14 Correct 147 ms 29444 KB Output is correct
15 Correct 156 ms 31120 KB Output is correct
16 Correct 58 ms 18368 KB Output is correct
17 Correct 69 ms 26032 KB Output is correct
18 Correct 150 ms 30120 KB Output is correct
19 Correct 65 ms 26308 KB Output is correct
20 Correct 70 ms 26080 KB Output is correct
21 Correct 131 ms 30016 KB Output is correct
22 Correct 61 ms 18436 KB Output is correct
23 Correct 71 ms 26036 KB Output is correct
24 Correct 155 ms 31572 KB Output is correct
25 Correct 61 ms 26472 KB Output is correct
26 Correct 73 ms 27324 KB Output is correct
27 Correct 123 ms 28176 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 6 ms 8536 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 6 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 8792 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 5 ms 8284 KB Output is correct
19 Correct 5 ms 8540 KB Output is correct
20 Correct 5 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 6 ms 8284 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 7 ms 8540 KB Output is correct
27 Correct 5 ms 8536 KB Output is correct
28 Correct 4 ms 8536 KB Output is correct
29 Correct 67 ms 26604 KB Output is correct
30 Correct 67 ms 27572 KB Output is correct
31 Correct 64 ms 26112 KB Output is correct
32 Correct 58 ms 27056 KB Output is correct
33 Correct 55 ms 18876 KB Output is correct
34 Correct 67 ms 18364 KB Output is correct
35 Correct 67 ms 25644 KB Output is correct
36 Correct 58 ms 27396 KB Output is correct
37 Correct 15 ms 8540 KB Output is correct
38 Correct 66 ms 27576 KB Output is correct
39 Correct 13 ms 8540 KB Output is correct
40 Correct 32 ms 9676 KB Output is correct
41 Correct 64 ms 26644 KB Output is correct
42 Correct 63 ms 26044 KB Output is correct
43 Correct 14 ms 8852 KB Output is correct
44 Correct 68 ms 26852 KB Output is correct
45 Correct 63 ms 26716 KB Output is correct
46 Correct 21 ms 9180 KB Output is correct
47 Correct 61 ms 25728 KB Output is correct
48 Correct 62 ms 26292 KB Output is correct
49 Correct 14 ms 8796 KB Output is correct
50 Correct 63 ms 14792 KB Output is correct
51 Correct 60 ms 25116 KB Output is correct
52 Correct 14 ms 7772 KB Output is correct
53 Correct 13 ms 8540 KB Output is correct
54 Correct 49 ms 17604 KB Output is correct
55 Correct 49 ms 17600 KB Output is correct
56 Correct 136 ms 32420 KB Output is correct
57 Correct 139 ms 30032 KB Output is correct
58 Correct 138 ms 30736 KB Output is correct
59 Correct 152 ms 29688 KB Output is correct
60 Correct 154 ms 24240 KB Output is correct
61 Correct 143 ms 32068 KB Output is correct
62 Correct 136 ms 29616 KB Output is correct
63 Correct 132 ms 26664 KB Output is correct
64 Correct 53 ms 10956 KB Output is correct
65 Correct 146 ms 30528 KB Output is correct
66 Correct 64 ms 11436 KB Output is correct
67 Correct 50 ms 10160 KB Output is correct
68 Correct 81 ms 26400 KB Output is correct
69 Correct 167 ms 32180 KB Output is correct
70 Correct 18 ms 9044 KB Output is correct
71 Correct 73 ms 27424 KB Output is correct
72 Correct 134 ms 31188 KB Output is correct
73 Correct 14 ms 8796 KB Output is correct
74 Correct 72 ms 19408 KB Output is correct
75 Correct 154 ms 33768 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 66 ms 18108 KB Output is correct
78 Correct 117 ms 26760 KB Output is correct
79 Correct 43 ms 10712 KB Output is correct
80 Correct 37 ms 9432 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 15 ms 8796 KB Output is correct
83 Correct 178 ms 30748 KB Output is correct
84 Correct 145 ms 29828 KB Output is correct
85 Correct 179 ms 31800 KB Output is correct
86 Correct 179 ms 30804 KB Output is correct
87 Correct 145 ms 31568 KB Output is correct
88 Correct 151 ms 29452 KB Output is correct
89 Correct 137 ms 29708 KB Output is correct
90 Correct 119 ms 30000 KB Output is correct
91 Correct 98 ms 12280 KB Output is correct
92 Correct 147 ms 29444 KB Output is correct
93 Correct 156 ms 31120 KB Output is correct
94 Correct 58 ms 18368 KB Output is correct
95 Correct 69 ms 26032 KB Output is correct
96 Correct 150 ms 30120 KB Output is correct
97 Correct 65 ms 26308 KB Output is correct
98 Correct 70 ms 26080 KB Output is correct
99 Correct 131 ms 30016 KB Output is correct
100 Correct 61 ms 18436 KB Output is correct
101 Correct 71 ms 26036 KB Output is correct
102 Correct 155 ms 31572 KB Output is correct
103 Correct 61 ms 26472 KB Output is correct
104 Correct 73 ms 27324 KB Output is correct
105 Correct 123 ms 28176 KB Output is correct
106 Correct 37 ms 9180 KB Output is correct
107 Correct 43 ms 10948 KB Output is correct
108 Correct 38 ms 9680 KB Output is correct
109 Correct 44 ms 10612 KB Output is correct
110 Correct 174 ms 33632 KB Output is correct
111 Correct 163 ms 30616 KB Output is correct
112 Correct 171 ms 31456 KB Output is correct
113 Correct 158 ms 31280 KB Output is correct
114 Correct 172 ms 33820 KB Output is correct
115 Correct 187 ms 32064 KB Output is correct
116 Correct 164 ms 47024 KB Output is correct
117 Correct 142 ms 29988 KB Output is correct
118 Correct 132 ms 14488 KB Output is correct
119 Correct 50 ms 11344 KB Output is correct
120 Correct 162 ms 30224 KB Output is correct
121 Correct 69 ms 26308 KB Output is correct
122 Correct 80 ms 26480 KB Output is correct
123 Correct 152 ms 31024 KB Output is correct
124 Correct 63 ms 18760 KB Output is correct
125 Correct 91 ms 26208 KB Output is correct
126 Correct 178 ms 30156 KB Output is correct
127 Correct 63 ms 18812 KB Output is correct
128 Correct 76 ms 26752 KB Output is correct
129 Correct 161 ms 32272 KB Output is correct
130 Correct 70 ms 26296 KB Output is correct
131 Correct 81 ms 26292 KB Output is correct
132 Correct 136 ms 30344 KB Output is correct