oj.uz

Submission #987887

# Submission time Handle Problem Language Result Execution time Memory
987887 2024-05-23T18:26:39 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
20 / 25
 202 ms 46324 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
//ifstream cin("a.in");
//ofstream cout("a.out");
long long inf=1e9+10;
struct node
{
    long long  layer,sum,bitipref,lst,rghtbord,biti;
    //  node(long long a,long long b,long long c,long long d,long long e) : layer(a),sum(b),bitipref(c),lst(d),rghtbord(e){}
};
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(long long a,long long b)
{
    return cost[a]<cost[b];
}
long long y[200005];
long long 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=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node godown(node curr)
{
    long long 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=curr.sum+adj[g2][curr.lst]-adj[g2][curr.lst-1];
    return curr;
}
node shift(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.lst++;
    curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandshift(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=curr.bitipref;
    curr.bitipref--;
    curr.sum=curr.sum+adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandcreate(node curr)
{
    long long g;
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum=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]];
                }
            }
        }
        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)
    {
        long long 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;
}
/*
5 2 33
1 5
1 3
2 3
1 6
2 1
0 3
0 2*/

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:36:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   36 |     long long g,g2;
      |               ^
Main.cpp: In function 'node godown(node)':
Main.cpp:72:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   72 |     long long g,g2;
      |               ^
Main.cpp: In function 'int main()':
Main.cpp:138:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  138 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:162: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]
  162 |                 for(long long j=0; j<adj[i].size(); j++)
      |                                    ~^~~~~~~~~~~~~~
Main.cpp:170:33: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long 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<long long 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 5 ms 11884 KB Output is correct
2 Correct 5 ms 11872 KB Output is correct
3 Correct 5 ms 11872 KB Output is correct
4 Correct 5 ms 11864 KB Output is correct
5 Correct 5 ms 11828 KB Output is correct
6 Correct 6 ms 11812 KB Output is correct
7 Correct 5 ms 11804 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 7 ms 11876 KB Output is correct
11 Correct 4 ms 11100 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 4 ms 11808 KB Output is correct
14 Correct 5 ms 11852 KB Output is correct
15 Correct 3 ms 11552 KB Output is correct
16 Correct 4 ms 11704 KB Output is correct
17 Correct 5 ms 11868 KB Output is correct
18 Correct 3 ms 11352 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11896 KB Output is correct
21 Correct 4 ms 11096 KB Output is correct
22 Correct 4 ms 11800 KB Output is correct
23 Correct 6 ms 11816 KB Output is correct
24 Correct 4 ms 11352 KB Output is correct
25 Correct 4 ms 11356 KB Output is correct
26 Correct 5 ms 11816 KB Output is correct
27 Correct 6 ms 11804 KB Output is correct
28 Correct 5 ms 11728 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 37840 KB Output is correct
2 Correct 74 ms 38900 KB Output is correct
3 Correct 70 ms 37820 KB Output is correct
4 Correct 71 ms 38812 KB Output is correct
5 Correct 64 ms 25584 KB Output is correct
6 Correct 65 ms 25224 KB Output is correct
7 Correct 70 ms 37828 KB Output is correct
8 Correct 83 ms 37808 KB Output is correct
9 Correct 14 ms 11868 KB Output is correct
10 Correct 82 ms 39092 KB Output is correct
11 Correct 15 ms 11836 KB Output is correct
12 Correct 29 ms 13016 KB Output is correct
13 Correct 74 ms 37300 KB Output is correct
14 Correct 70 ms 38080 KB Output is correct
15 Correct 13 ms 11868 KB Output is correct
16 Correct 79 ms 37416 KB Output is correct
17 Correct 78 ms 37984 KB Output is correct
18 Correct 21 ms 12496 KB Output is correct
19 Correct 102 ms 38152 KB Output is correct
20 Correct 66 ms 39012 KB Output is correct
21 Correct 14 ms 11868 KB Output is correct
22 Correct 64 ms 25020 KB Output is correct
23 Correct 65 ms 37052 KB Output is correct
24 Correct 13 ms 11868 KB Output is correct
25 Correct 16 ms 11864 KB Output is correct
26 Correct 60 ms 26060 KB Output is correct
27 Correct 59 ms 26332 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11884 KB Output is correct
2 Correct 5 ms 11872 KB Output is correct
3 Correct 5 ms 11872 KB Output is correct
4 Correct 5 ms 11864 KB Output is correct
5 Correct 5 ms 11828 KB Output is correct
6 Correct 6 ms 11812 KB Output is correct
7 Correct 5 ms 11804 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 7 ms 11876 KB Output is correct
11 Correct 4 ms 11100 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 4 ms 11808 KB Output is correct
14 Correct 5 ms 11852 KB Output is correct
15 Correct 3 ms 11552 KB Output is correct
16 Correct 4 ms 11704 KB Output is correct
17 Correct 5 ms 11868 KB Output is correct
18 Correct 3 ms 11352 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11896 KB Output is correct
21 Correct 4 ms 11096 KB Output is correct
22 Correct 4 ms 11800 KB Output is correct
23 Correct 6 ms 11816 KB Output is correct
24 Correct 4 ms 11352 KB Output is correct
25 Correct 4 ms 11356 KB Output is correct
26 Correct 5 ms 11816 KB Output is correct
27 Correct 6 ms 11804 KB Output is correct
28 Correct 5 ms 11728 KB Output is correct
29 Correct 69 ms 37840 KB Output is correct
30 Correct 74 ms 38900 KB Output is correct
31 Correct 70 ms 37820 KB Output is correct
32 Correct 71 ms 38812 KB Output is correct
33 Correct 64 ms 25584 KB Output is correct
34 Correct 65 ms 25224 KB Output is correct
35 Correct 70 ms 37828 KB Output is correct
36 Correct 83 ms 37808 KB Output is correct
37 Correct 14 ms 11868 KB Output is correct
38 Correct 82 ms 39092 KB Output is correct
39 Correct 15 ms 11836 KB Output is correct
40 Correct 29 ms 13016 KB Output is correct
41 Correct 74 ms 37300 KB Output is correct
42 Correct 70 ms 38080 KB Output is correct
43 Correct 13 ms 11868 KB Output is correct
44 Correct 79 ms 37416 KB Output is correct
45 Correct 78 ms 37984 KB Output is correct
46 Correct 21 ms 12496 KB Output is correct
47 Correct 102 ms 38152 KB Output is correct
48 Correct 66 ms 39012 KB Output is correct
49 Correct 14 ms 11868 KB Output is correct
50 Correct 64 ms 25020 KB Output is correct
51 Correct 65 ms 37052 KB Output is correct
52 Correct 13 ms 11868 KB Output is correct
53 Correct 16 ms 11864 KB Output is correct
54 Correct 60 ms 26060 KB Output is correct
55 Correct 59 ms 26332 KB Output is correct
56 Correct 192 ms 46172 KB Output is correct
57 Correct 152 ms 44212 KB Output is correct
58 Correct 158 ms 43784 KB Output is correct
59 Correct 171 ms 42800 KB Output is correct
60 Correct 165 ms 33448 KB Output is correct
61 Correct 144 ms 43564 KB Output is correct
62 Correct 158 ms 42784 KB Output is correct
63 Correct 122 ms 39004 KB Output is correct
64 Correct 69 ms 14680 KB Output is correct
65 Correct 145 ms 43956 KB Output is correct
66 Correct 52 ms 15188 KB Output is correct
67 Correct 66 ms 16128 KB Output is correct
68 Correct 111 ms 38320 KB Output is correct
69 Correct 166 ms 45356 KB Output is correct
70 Correct 14 ms 12060 KB Output is correct
71 Correct 90 ms 39252 KB Output is correct
72 Correct 151 ms 43052 KB Output is correct
73 Correct 13 ms 11868 KB Output is correct
74 Correct 74 ms 26032 KB Output is correct
75 Correct 150 ms 46324 KB Output is correct
76 Correct 13 ms 11868 KB Output is correct
77 Correct 90 ms 26552 KB Output is correct
78 Correct 120 ms 40132 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 14764 KB Output is correct
2 Correct 40 ms 13016 KB Output is correct
3 Correct 14 ms 11864 KB Output is correct
4 Correct 18 ms 12284 KB Output is correct
5 Correct 161 ms 44720 KB Output is correct
6 Correct 166 ms 45108 KB Output is correct
7 Correct 171 ms 44284 KB Output is correct
8 Correct 156 ms 45232 KB Output is correct
9 Correct 199 ms 45744 KB Output is correct
10 Correct 162 ms 43436 KB Output is correct
11 Correct 174 ms 43056 KB Output is correct
12 Correct 134 ms 43864 KB Output is correct
13 Correct 103 ms 18192 KB Output is correct
14 Correct 178 ms 44508 KB Output is correct
15 Correct 168 ms 45092 KB Output is correct
16 Correct 77 ms 25280 KB Output is correct
17 Correct 96 ms 37456 KB Output is correct
18 Correct 198 ms 44988 KB Output is correct
19 Correct 80 ms 39088 KB Output is correct
20 Correct 93 ms 38008 KB Output is correct
21 Correct 155 ms 44452 KB Output is correct
22 Correct 72 ms 25536 KB Output is correct
23 Correct 86 ms 39088 KB Output is correct
24 Correct 202 ms 45740 KB Output is correct
25 Correct 76 ms 38316 KB Output is correct
26 Correct 70 ms 38068 KB Output is correct
27 Correct 154 ms 41608 KB Output is correct

Subtask #5
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11884 KB Output is correct
2 Correct 5 ms 11872 KB Output is correct
3 Correct 5 ms 11872 KB Output is correct
4 Correct 5 ms 11864 KB Output is correct
5 Correct 5 ms 11828 KB Output is correct
6 Correct 6 ms 11812 KB Output is correct
7 Correct 5 ms 11804 KB Output is correct
8 Correct 5 ms 11816 KB Output is correct
9 Correct 5 ms 11100 KB Output is correct
10 Correct 7 ms 11876 KB Output is correct
11 Correct 4 ms 11100 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 4 ms 11808 KB Output is correct
14 Correct 5 ms 11852 KB Output is correct
15 Correct 3 ms 11552 KB Output is correct
16 Correct 4 ms 11704 KB Output is correct
17 Correct 5 ms 11868 KB Output is correct
18 Correct 3 ms 11352 KB Output is correct
19 Correct 4 ms 11808 KB Output is correct
20 Correct 5 ms 11896 KB Output is correct
21 Correct 4 ms 11096 KB Output is correct
22 Correct 4 ms 11800 KB Output is correct
23 Correct 6 ms 11816 KB Output is correct
24 Correct 4 ms 11352 KB Output is correct
25 Correct 4 ms 11356 KB Output is correct
26 Correct 5 ms 11816 KB Output is correct
27 Correct 6 ms 11804 KB Output is correct
28 Correct 5 ms 11728 KB Output is correct
29 Correct 69 ms 37840 KB Output is correct
30 Correct 74 ms 38900 KB Output is correct
31 Correct 70 ms 37820 KB Output is correct
32 Correct 71 ms 38812 KB Output is correct
33 Correct 64 ms 25584 KB Output is correct
34 Correct 65 ms 25224 KB Output is correct
35 Correct 70 ms 37828 KB Output is correct
36 Correct 83 ms 37808 KB Output is correct
37 Correct 14 ms 11868 KB Output is correct
38 Correct 82 ms 39092 KB Output is correct
39 Correct 15 ms 11836 KB Output is correct
40 Correct 29 ms 13016 KB Output is correct
41 Correct 74 ms 37300 KB Output is correct
42 Correct 70 ms 38080 KB Output is correct
43 Correct 13 ms 11868 KB Output is correct
44 Correct 79 ms 37416 KB Output is correct
45 Correct 78 ms 37984 KB Output is correct
46 Correct 21 ms 12496 KB Output is correct
47 Correct 102 ms 38152 KB Output is correct
48 Correct 66 ms 39012 KB Output is correct
49 Correct 14 ms 11868 KB Output is correct
50 Correct 64 ms 25020 KB Output is correct
51 Correct 65 ms 37052 KB Output is correct
52 Correct 13 ms 11868 KB Output is correct
53 Correct 16 ms 11864 KB Output is correct
54 Correct 60 ms 26060 KB Output is correct
55 Correct 59 ms 26332 KB Output is correct
56 Correct 192 ms 46172 KB Output is correct
57 Correct 152 ms 44212 KB Output is correct
58 Correct 158 ms 43784 KB Output is correct
59 Correct 171 ms 42800 KB Output is correct
60 Correct 165 ms 33448 KB Output is correct
61 Correct 144 ms 43564 KB Output is correct
62 Correct 158 ms 42784 KB Output is correct
63 Correct 122 ms 39004 KB Output is correct
64 Correct 69 ms 14680 KB Output is correct
65 Correct 145 ms 43956 KB Output is correct
66 Correct 52 ms 15188 KB Output is correct
67 Correct 66 ms 16128 KB Output is correct
68 Correct 111 ms 38320 KB Output is correct
69 Correct 166 ms 45356 KB Output is correct
70 Correct 14 ms 12060 KB Output is correct
71 Correct 90 ms 39252 KB Output is correct
72 Correct 151 ms 43052 KB Output is correct
73 Correct 13 ms 11868 KB Output is correct
74 Correct 74 ms 26032 KB Output is correct
75 Correct 150 ms 46324 KB Output is correct
76 Correct 13 ms 11868 KB Output is correct
77 Correct 90 ms 26552 KB Output is correct
78 Correct 120 ms 40132 KB Output is correct
79 Correct 47 ms 14764 KB Output is correct
80 Correct 40 ms 13016 KB Output is correct
81 Correct 14 ms 11864 KB Output is correct
82 Correct 18 ms 12284 KB Output is correct
83 Correct 161 ms 44720 KB Output is correct
84 Correct 166 ms 45108 KB Output is correct
85 Correct 171 ms 44284 KB Output is correct
86 Correct 156 ms 45232 KB Output is correct
87 Correct 199 ms 45744 KB Output is correct
88 Correct 162 ms 43436 KB Output is correct
89 Correct 174 ms 43056 KB Output is correct
90 Correct 134 ms 43864 KB Output is correct
91 Correct 103 ms 18192 KB Output is correct
92 Correct 178 ms 44508 KB Output is correct
93 Correct 168 ms 45092 KB Output is correct
94 Correct 77 ms 25280 KB Output is correct
95 Correct 96 ms 37456 KB Output is correct
96 Correct 198 ms 44988 KB Output is correct
97 Correct 80 ms 39088 KB Output is correct
98 Correct 93 ms 38008 KB Output is correct
99 Correct 155 ms 44452 KB Output is correct
100 Correct 72 ms 25536 KB Output is correct
101 Correct 86 ms 39088 KB Output is correct
102 Correct 202 ms 45740 KB Output is correct
103 Correct 76 ms 38316 KB Output is correct
104 Correct 70 ms 38068 KB Output is correct
105 Correct 154 ms 41608 KB Output is correct
106 Correct 38 ms 12636 KB Output is correct
107 Incorrect 63 ms 18256 KB Output isn't correct
108 Halted 0 ms 0 KB -