oj.uz

Submission #987905

# Submission time Handle Problem Language Result Execution time Memory
987905 2024-05-23T19:01:26 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 216 ms 46100 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<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 6 ms 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8660 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8024 KB Output is correct
10 Correct 5 ms 8664 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 4 ms 8692 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8364 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8660 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8364 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 6 ms 8340 KB Output is correct
26 Correct 5 ms 8624 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 25964 KB Output is correct
2 Correct 63 ms 25888 KB Output is correct
3 Correct 61 ms 26284 KB Output is correct
4 Correct 61 ms 26240 KB Output is correct
5 Correct 61 ms 18112 KB Output is correct
6 Correct 67 ms 17656 KB Output is correct
7 Correct 60 ms 27576 KB Output is correct
8 Correct 57 ms 27392 KB Output is correct
9 Correct 14 ms 8792 KB Output is correct
10 Correct 60 ms 27780 KB Output is correct
11 Correct 12 ms 8728 KB Output is correct
12 Correct 27 ms 9688 KB Output is correct
13 Correct 74 ms 26292 KB Output is correct
14 Correct 61 ms 27396 KB Output is correct
15 Correct 14 ms 8792 KB Output is correct
16 Correct 58 ms 25780 KB Output is correct
17 Correct 59 ms 27068 KB Output is correct
18 Correct 21 ms 9252 KB Output is correct
19 Correct 62 ms 25784 KB Output is correct
20 Correct 57 ms 26544 KB Output is correct
21 Correct 14 ms 8792 KB Output is correct
22 Correct 56 ms 17996 KB Output is correct
23 Correct 56 ms 25240 KB Output is correct
24 Correct 12 ms 8812 KB Output is correct
25 Correct 13 ms 8764 KB Output is correct
26 Correct 50 ms 18744 KB Output is correct
27 Correct 49 ms 19128 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8660 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8024 KB Output is correct
10 Correct 5 ms 8664 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 4 ms 8692 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8364 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8660 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8364 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 6 ms 8340 KB Output is correct
26 Correct 5 ms 8624 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 58 ms 25964 KB Output is correct
30 Correct 63 ms 25888 KB Output is correct
31 Correct 61 ms 26284 KB Output is correct
32 Correct 61 ms 26240 KB Output is correct
33 Correct 61 ms 18112 KB Output is correct
34 Correct 67 ms 17656 KB Output is correct
35 Correct 60 ms 27576 KB Output is correct
36 Correct 57 ms 27392 KB Output is correct
37 Correct 14 ms 8792 KB Output is correct
38 Correct 60 ms 27780 KB Output is correct
39 Correct 12 ms 8728 KB Output is correct
40 Correct 27 ms 9688 KB Output is correct
41 Correct 74 ms 26292 KB Output is correct
42 Correct 61 ms 27396 KB Output is correct
43 Correct 14 ms 8792 KB Output is correct
44 Correct 58 ms 25780 KB Output is correct
45 Correct 59 ms 27068 KB Output is correct
46 Correct 21 ms 9252 KB Output is correct
47 Correct 62 ms 25784 KB Output is correct
48 Correct 57 ms 26544 KB Output is correct
49 Correct 14 ms 8792 KB Output is correct
50 Correct 56 ms 17996 KB Output is correct
51 Correct 56 ms 25240 KB Output is correct
52 Correct 12 ms 8812 KB Output is correct
53 Correct 13 ms 8764 KB Output is correct
54 Correct 50 ms 18744 KB Output is correct
55 Correct 49 ms 19128 KB Output is correct
56 Correct 157 ms 35716 KB Output is correct
57 Correct 139 ms 32648 KB Output is correct
58 Correct 135 ms 32856 KB Output is correct
59 Correct 125 ms 31732 KB Output is correct
60 Correct 129 ms 26432 KB Output is correct
61 Correct 132 ms 33352 KB Output is correct
62 Correct 112 ms 29872 KB Output is correct
63 Correct 107 ms 26576 KB Output is correct
64 Correct 53 ms 10956 KB Output is correct
65 Correct 135 ms 30784 KB Output is correct
66 Correct 47 ms 11344 KB Output is correct
67 Correct 56 ms 12232 KB Output is correct
68 Correct 72 ms 26808 KB Output is correct
69 Correct 141 ms 31240 KB Output is correct
70 Correct 16 ms 9052 KB Output is correct
71 Correct 69 ms 26532 KB Output is correct
72 Correct 119 ms 29136 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 61 ms 18612 KB Output is correct
75 Correct 137 ms 33896 KB Output is correct
76 Correct 14 ms 8536 KB Output is correct
77 Correct 69 ms 19428 KB Output is correct
78 Correct 108 ms 27608 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 10708 KB Output is correct
2 Correct 36 ms 9544 KB Output is correct
3 Correct 15 ms 8792 KB Output is correct
4 Correct 14 ms 8864 KB Output is correct
5 Correct 145 ms 32312 KB Output is correct
6 Correct 136 ms 29224 KB Output is correct
7 Correct 155 ms 31088 KB Output is correct
8 Correct 143 ms 30264 KB Output is correct
9 Correct 192 ms 32372 KB Output is correct
10 Correct 172 ms 30200 KB Output is correct
11 Correct 159 ms 27704 KB Output is correct
12 Correct 132 ms 30008 KB Output is correct
13 Correct 104 ms 12200 KB Output is correct
14 Correct 170 ms 30776 KB Output is correct
15 Correct 164 ms 30512 KB Output is correct
16 Correct 65 ms 19296 KB Output is correct
17 Correct 74 ms 27388 KB Output is correct
18 Correct 173 ms 30732 KB Output is correct
19 Correct 66 ms 27168 KB Output is correct
20 Correct 96 ms 27364 KB Output is correct
21 Correct 146 ms 30012 KB Output is correct
22 Correct 66 ms 18880 KB Output is correct
23 Correct 80 ms 26808 KB Output is correct
24 Correct 170 ms 32208 KB Output is correct
25 Correct 64 ms 26452 KB Output is correct
26 Correct 68 ms 26892 KB Output is correct
27 Correct 133 ms 29584 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 8664 KB Output is correct
4 Correct 5 ms 8660 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8024 KB Output is correct
10 Correct 5 ms 8664 KB Output is correct
11 Correct 4 ms 8024 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 4 ms 8692 KB Output is correct
14 Correct 5 ms 8540 KB Output is correct
15 Correct 4 ms 8364 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8660 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 4 ms 8536 KB Output is correct
20 Correct 5 ms 8664 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8364 KB Output is correct
23 Correct 6 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 6 ms 8340 KB Output is correct
26 Correct 5 ms 8624 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 58 ms 25964 KB Output is correct
30 Correct 63 ms 25888 KB Output is correct
31 Correct 61 ms 26284 KB Output is correct
32 Correct 61 ms 26240 KB Output is correct
33 Correct 61 ms 18112 KB Output is correct
34 Correct 67 ms 17656 KB Output is correct
35 Correct 60 ms 27576 KB Output is correct
36 Correct 57 ms 27392 KB Output is correct
37 Correct 14 ms 8792 KB Output is correct
38 Correct 60 ms 27780 KB Output is correct
39 Correct 12 ms 8728 KB Output is correct
40 Correct 27 ms 9688 KB Output is correct
41 Correct 74 ms 26292 KB Output is correct
42 Correct 61 ms 27396 KB Output is correct
43 Correct 14 ms 8792 KB Output is correct
44 Correct 58 ms 25780 KB Output is correct
45 Correct 59 ms 27068 KB Output is correct
46 Correct 21 ms 9252 KB Output is correct
47 Correct 62 ms 25784 KB Output is correct
48 Correct 57 ms 26544 KB Output is correct
49 Correct 14 ms 8792 KB Output is correct
50 Correct 56 ms 17996 KB Output is correct
51 Correct 56 ms 25240 KB Output is correct
52 Correct 12 ms 8812 KB Output is correct
53 Correct 13 ms 8764 KB Output is correct
54 Correct 50 ms 18744 KB Output is correct
55 Correct 49 ms 19128 KB Output is correct
56 Correct 157 ms 35716 KB Output is correct
57 Correct 139 ms 32648 KB Output is correct
58 Correct 135 ms 32856 KB Output is correct
59 Correct 125 ms 31732 KB Output is correct
60 Correct 129 ms 26432 KB Output is correct
61 Correct 132 ms 33352 KB Output is correct
62 Correct 112 ms 29872 KB Output is correct
63 Correct 107 ms 26576 KB Output is correct
64 Correct 53 ms 10956 KB Output is correct
65 Correct 135 ms 30784 KB Output is correct
66 Correct 47 ms 11344 KB Output is correct
67 Correct 56 ms 12232 KB Output is correct
68 Correct 72 ms 26808 KB Output is correct
69 Correct 141 ms 31240 KB Output is correct
70 Correct 16 ms 9052 KB Output is correct
71 Correct 69 ms 26532 KB Output is correct
72 Correct 119 ms 29136 KB Output is correct
73 Correct 13 ms 8796 KB Output is correct
74 Correct 61 ms 18612 KB Output is correct
75 Correct 137 ms 33896 KB Output is correct
76 Correct 14 ms 8536 KB Output is correct
77 Correct 69 ms 19428 KB Output is correct
78 Correct 108 ms 27608 KB Output is correct
79 Correct 40 ms 10708 KB Output is correct
80 Correct 36 ms 9544 KB Output is correct
81 Correct 15 ms 8792 KB Output is correct
82 Correct 14 ms 8864 KB Output is correct
83 Correct 145 ms 32312 KB Output is correct
84 Correct 136 ms 29224 KB Output is correct
85 Correct 155 ms 31088 KB Output is correct
86 Correct 143 ms 30264 KB Output is correct
87 Correct 192 ms 32372 KB Output is correct
88 Correct 172 ms 30200 KB Output is correct
89 Correct 159 ms 27704 KB Output is correct
90 Correct 132 ms 30008 KB Output is correct
91 Correct 104 ms 12200 KB Output is correct
92 Correct 170 ms 30776 KB Output is correct
93 Correct 164 ms 30512 KB Output is correct
94 Correct 65 ms 19296 KB Output is correct
95 Correct 74 ms 27388 KB Output is correct
96 Correct 173 ms 30732 KB Output is correct
97 Correct 66 ms 27168 KB Output is correct
98 Correct 96 ms 27364 KB Output is correct
99 Correct 146 ms 30012 KB Output is correct
100 Correct 66 ms 18880 KB Output is correct
101 Correct 80 ms 26808 KB Output is correct
102 Correct 170 ms 32208 KB Output is correct
103 Correct 64 ms 26452 KB Output is correct
104 Correct 68 ms 26892 KB Output is correct
105 Correct 133 ms 29584 KB Output is correct
106 Correct 38 ms 9420 KB Output is correct
107 Correct 41 ms 10956 KB Output is correct
108 Correct 39 ms 9892 KB Output is correct
109 Correct 42 ms 10600 KB Output is correct
110 Correct 170 ms 32300 KB Output is correct
111 Correct 174 ms 30764 KB Output is correct
112 Correct 200 ms 32552 KB Output is correct
113 Correct 173 ms 29528 KB Output is correct
114 Correct 170 ms 33280 KB Output is correct
115 Correct 160 ms 31552 KB Output is correct
116 Correct 202 ms 46100 KB Output is correct
117 Correct 136 ms 29468 KB Output is correct
118 Correct 131 ms 14104 KB Output is correct
119 Correct 58 ms 11308 KB Output is correct
120 Correct 189 ms 30760 KB Output is correct
121 Correct 70 ms 26556 KB Output is correct
122 Correct 81 ms 26292 KB Output is correct
123 Correct 216 ms 31804 KB Output is correct
124 Correct 65 ms 18364 KB Output is correct
125 Correct 109 ms 27572 KB Output is correct
126 Correct 188 ms 30052 KB Output is correct
127 Correct 63 ms 19352 KB Output is correct
128 Correct 83 ms 27068 KB Output is correct
129 Correct 188 ms 32712 KB Output is correct
130 Correct 72 ms 26884 KB Output is correct
131 Correct 79 ms 28192 KB Output is correct
132 Correct 174 ms 29852 KB Output is correct