oj.uz

답안 #988004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988004 2024-05-23T20:18:48 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 171 ms 46248 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 5 ms 5552 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5584 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8484 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5720 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8792 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 25840 KB Output is correct
2 Correct 66 ms 25780 KB Output is correct
3 Correct 64 ms 25772 KB Output is correct
4 Correct 64 ms 25768 KB Output is correct
5 Correct 55 ms 17588 KB Output is correct
6 Correct 54 ms 17336 KB Output is correct
7 Correct 63 ms 25660 KB Output is correct
8 Correct 62 ms 25776 KB Output is correct
9 Correct 13 ms 5724 KB Output is correct
10 Correct 62 ms 22964 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 27 ms 9628 KB Output is correct
13 Correct 63 ms 25628 KB Output is correct
14 Correct 67 ms 25908 KB Output is correct
15 Correct 16 ms 8796 KB Output is correct
16 Correct 63 ms 22456 KB Output is correct
17 Correct 63 ms 25796 KB Output is correct
18 Correct 20 ms 9168 KB Output is correct
19 Correct 63 ms 25780 KB Output is correct
20 Correct 63 ms 23264 KB Output is correct
21 Correct 13 ms 5724 KB Output is correct
22 Correct 56 ms 13912 KB Output is correct
23 Correct 63 ms 25260 KB Output is correct
24 Correct 13 ms 8540 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 50 ms 17572 KB Output is correct
27 Correct 49 ms 17500 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 5 ms 5552 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5584 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8484 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5720 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8792 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 63 ms 25840 KB Output is correct
30 Correct 66 ms 25780 KB Output is correct
31 Correct 64 ms 25772 KB Output is correct
32 Correct 64 ms 25768 KB Output is correct
33 Correct 55 ms 17588 KB Output is correct
34 Correct 54 ms 17336 KB Output is correct
35 Correct 63 ms 25660 KB Output is correct
36 Correct 62 ms 25776 KB Output is correct
37 Correct 13 ms 5724 KB Output is correct
38 Correct 62 ms 22964 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 9628 KB Output is correct
41 Correct 63 ms 25628 KB Output is correct
42 Correct 67 ms 25908 KB Output is correct
43 Correct 16 ms 8796 KB Output is correct
44 Correct 63 ms 22456 KB Output is correct
45 Correct 63 ms 25796 KB Output is correct
46 Correct 20 ms 9168 KB Output is correct
47 Correct 63 ms 25780 KB Output is correct
48 Correct 63 ms 23264 KB Output is correct
49 Correct 13 ms 5724 KB Output is correct
50 Correct 56 ms 13912 KB Output is correct
51 Correct 63 ms 25260 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 50 ms 17572 KB Output is correct
55 Correct 49 ms 17500 KB Output is correct
56 Correct 147 ms 32132 KB Output is correct
57 Correct 150 ms 30004 KB Output is correct
58 Correct 131 ms 30628 KB Output is correct
59 Correct 124 ms 29124 KB Output is correct
60 Correct 139 ms 24068 KB Output is correct
61 Correct 139 ms 30760 KB Output is correct
62 Correct 120 ms 28204 KB Output is correct
63 Correct 108 ms 26652 KB Output is correct
64 Correct 54 ms 10956 KB Output is correct
65 Correct 134 ms 30088 KB Output is correct
66 Correct 50 ms 11652 KB Output is correct
67 Correct 52 ms 12204 KB Output is correct
68 Correct 76 ms 26448 KB Output is correct
69 Correct 137 ms 30520 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 76 ms 26556 KB Output is correct
72 Correct 128 ms 29228 KB Output is correct
73 Correct 16 ms 8796 KB Output is correct
74 Correct 72 ms 15688 KB Output is correct
75 Correct 137 ms 31284 KB Output is correct
76 Correct 12 ms 8536 KB Output is correct
77 Correct 60 ms 17344 KB Output is correct
78 Correct 104 ms 26804 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 10700 KB Output is correct
2 Correct 36 ms 9436 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 13 ms 8796 KB Output is correct
5 Correct 145 ms 30752 KB Output is correct
6 Correct 170 ms 29732 KB Output is correct
7 Correct 151 ms 30100 KB Output is correct
8 Correct 141 ms 28740 KB Output is correct
9 Correct 156 ms 30768 KB Output is correct
10 Correct 146 ms 29240 KB Output is correct
11 Correct 135 ms 27708 KB Output is correct
12 Correct 121 ms 28384 KB Output is correct
13 Correct 98 ms 12108 KB Output is correct
14 Correct 140 ms 29324 KB Output is correct
15 Correct 157 ms 29228 KB Output is correct
16 Correct 62 ms 17840 KB Output is correct
17 Correct 72 ms 25924 KB Output is correct
18 Correct 156 ms 29504 KB Output is correct
19 Correct 67 ms 26292 KB Output is correct
20 Correct 74 ms 25776 KB Output is correct
21 Correct 138 ms 28696 KB Output is correct
22 Correct 60 ms 17852 KB Output is correct
23 Correct 71 ms 26048 KB Output is correct
24 Correct 146 ms 30764 KB Output is correct
25 Correct 62 ms 26300 KB Output is correct
26 Correct 70 ms 26300 KB Output is correct
27 Correct 145 ms 27948 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 5 ms 5552 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5584 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 8484 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8540 KB Output is correct
14 Correct 5 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5720 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 4 ms 8792 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 63 ms 25840 KB Output is correct
30 Correct 66 ms 25780 KB Output is correct
31 Correct 64 ms 25772 KB Output is correct
32 Correct 64 ms 25768 KB Output is correct
33 Correct 55 ms 17588 KB Output is correct
34 Correct 54 ms 17336 KB Output is correct
35 Correct 63 ms 25660 KB Output is correct
36 Correct 62 ms 25776 KB Output is correct
37 Correct 13 ms 5724 KB Output is correct
38 Correct 62 ms 22964 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 9628 KB Output is correct
41 Correct 63 ms 25628 KB Output is correct
42 Correct 67 ms 25908 KB Output is correct
43 Correct 16 ms 8796 KB Output is correct
44 Correct 63 ms 22456 KB Output is correct
45 Correct 63 ms 25796 KB Output is correct
46 Correct 20 ms 9168 KB Output is correct
47 Correct 63 ms 25780 KB Output is correct
48 Correct 63 ms 23264 KB Output is correct
49 Correct 13 ms 5724 KB Output is correct
50 Correct 56 ms 13912 KB Output is correct
51 Correct 63 ms 25260 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 50 ms 17572 KB Output is correct
55 Correct 49 ms 17500 KB Output is correct
56 Correct 147 ms 32132 KB Output is correct
57 Correct 150 ms 30004 KB Output is correct
58 Correct 131 ms 30628 KB Output is correct
59 Correct 124 ms 29124 KB Output is correct
60 Correct 139 ms 24068 KB Output is correct
61 Correct 139 ms 30760 KB Output is correct
62 Correct 120 ms 28204 KB Output is correct
63 Correct 108 ms 26652 KB Output is correct
64 Correct 54 ms 10956 KB Output is correct
65 Correct 134 ms 30088 KB Output is correct
66 Correct 50 ms 11652 KB Output is correct
67 Correct 52 ms 12204 KB Output is correct
68 Correct 76 ms 26448 KB Output is correct
69 Correct 137 ms 30520 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 76 ms 26556 KB Output is correct
72 Correct 128 ms 29228 KB Output is correct
73 Correct 16 ms 8796 KB Output is correct
74 Correct 72 ms 15688 KB Output is correct
75 Correct 137 ms 31284 KB Output is correct
76 Correct 12 ms 8536 KB Output is correct
77 Correct 60 ms 17344 KB Output is correct
78 Correct 104 ms 26804 KB Output is correct
79 Correct 39 ms 10700 KB Output is correct
80 Correct 36 ms 9436 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 13 ms 8796 KB Output is correct
83 Correct 145 ms 30752 KB Output is correct
84 Correct 170 ms 29732 KB Output is correct
85 Correct 151 ms 30100 KB Output is correct
86 Correct 141 ms 28740 KB Output is correct
87 Correct 156 ms 30768 KB Output is correct
88 Correct 146 ms 29240 KB Output is correct
89 Correct 135 ms 27708 KB Output is correct
90 Correct 121 ms 28384 KB Output is correct
91 Correct 98 ms 12108 KB Output is correct
92 Correct 140 ms 29324 KB Output is correct
93 Correct 157 ms 29228 KB Output is correct
94 Correct 62 ms 17840 KB Output is correct
95 Correct 72 ms 25924 KB Output is correct
96 Correct 156 ms 29504 KB Output is correct
97 Correct 67 ms 26292 KB Output is correct
98 Correct 74 ms 25776 KB Output is correct
99 Correct 138 ms 28696 KB Output is correct
100 Correct 60 ms 17852 KB Output is correct
101 Correct 71 ms 26048 KB Output is correct
102 Correct 146 ms 30764 KB Output is correct
103 Correct 62 ms 26300 KB Output is correct
104 Correct 70 ms 26300 KB Output is correct
105 Correct 145 ms 27948 KB Output is correct
106 Correct 35 ms 9632 KB Output is correct
107 Correct 41 ms 10992 KB Output is correct
108 Correct 38 ms 9764 KB Output is correct
109 Correct 44 ms 10696 KB Output is correct
110 Correct 161 ms 31540 KB Output is correct
111 Correct 171 ms 30752 KB Output is correct
112 Correct 159 ms 30512 KB Output is correct
113 Correct 153 ms 29484 KB Output is correct
114 Correct 159 ms 31680 KB Output is correct
115 Correct 161 ms 30520 KB Output is correct
116 Correct 166 ms 46248 KB Output is correct
117 Correct 140 ms 28416 KB Output is correct
118 Correct 107 ms 14280 KB Output is correct
119 Correct 54 ms 11260 KB Output is correct
120 Correct 168 ms 29896 KB Output is correct
121 Correct 73 ms 26416 KB Output is correct
122 Correct 79 ms 26448 KB Output is correct
123 Correct 153 ms 30616 KB Output is correct
124 Correct 64 ms 18356 KB Output is correct
125 Correct 87 ms 26036 KB Output is correct
126 Correct 145 ms 29964 KB Output is correct
127 Correct 71 ms 18096 KB Output is correct
128 Correct 75 ms 26720 KB Output is correct
129 Correct 170 ms 32296 KB Output is correct
130 Correct 71 ms 24336 KB Output is correct
131 Correct 80 ms 24240 KB Output is correct
132 Correct 138 ms 27768 KB Output is correct