oj.uz

답안 #988045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988045 2024-05-23T20:58:45 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++11
25 / 25
 196 ms 46104 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma gcc optimize("Ofast,unroll-loops")
using namespace std;
int inf=1000000007;
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];
int ord[200005];
bool cmp2(int a,int b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
int init[200005];
int g,g2;
void special(node curr)
{
    g2=ord[curr.layer+1];
    curr.lst=0;
    curr.sum+=init[g2];
    curr.layer++;
    curr.biti=1;
    curr.bitipref=0;
    curr.rghtbord=adj[g2].size()-1;
    pq.push(curr);
}
void 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)
        {special(curr);
        return;
        }
    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];
    pq.push(curr);
}
void godown(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
         {special(curr);return;}
    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];
    pq.push(curr);
}
void shift(node curr)
{
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    pq.push(curr);
}
void 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];
    pq.push(curr);
}
void fixborderandcreate(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    pq.push(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[i-1]=i;
    }
    sort(ord,ord+m,cmp2);
    m--;
    for(i=0; i<=m; 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)
               skip(curr);
            else if(curr.lst==x[g3] && curr.bitipref==x[g3]-1 && curr.biti==x[g3] && curr.layer+1<=m)
                skip(curr);
            if(curr.lst+1<=curr.rghtbord)
                shift(curr);
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
                fixborderandshift(curr);
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g3])
                fixborderandcreate(curr);
            if(curr.layer+1<=m)
                godown(curr);
        }
    }
    while(k--)
        cout<<-1<<'\n';
    return 0;
}

Compilation message

Main.cpp:6: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    6 | #pragma gcc optimize("Ofast,unroll-loops")
      | 
Main.cpp: In function 'int main()':
Main.cpp:121:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  121 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:141:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:147:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  147 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:165:15: warning: unused variable 'curr2' [-Wunused-variable]
  165 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5592 KB Output is correct
9 Correct 6 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 4 ms 5468 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 5468 KB Output is correct
17 Correct 5 ms 5584 KB Output is correct
18 Correct 3 ms 5208 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 23160 KB Output is correct
2 Correct 70 ms 22776 KB Output is correct
3 Correct 65 ms 22956 KB Output is correct
4 Correct 60 ms 22964 KB Output is correct
5 Correct 61 ms 14872 KB Output is correct
6 Correct 51 ms 14348 KB Output is correct
7 Correct 61 ms 22712 KB Output is correct
8 Correct 62 ms 22624 KB Output is correct
9 Correct 14 ms 5724 KB Output is correct
10 Correct 59 ms 22960 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 24 ms 6604 KB Output is correct
13 Correct 61 ms 22704 KB Output is correct
14 Correct 61 ms 22928 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 60 ms 22708 KB Output is correct
17 Correct 61 ms 22912 KB Output is correct
18 Correct 21 ms 6360 KB Output is correct
19 Correct 65 ms 22960 KB Output is correct
20 Correct 56 ms 23344 KB Output is correct
21 Correct 13 ms 5672 KB Output is correct
22 Correct 54 ms 14024 KB Output is correct
23 Correct 59 ms 22224 KB Output is correct
24 Correct 13 ms 5624 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 48 ms 14524 KB Output is correct
27 Correct 47 ms 14524 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5592 KB Output is correct
9 Correct 6 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 4 ms 5468 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 5468 KB Output is correct
17 Correct 5 ms 5584 KB Output is correct
18 Correct 3 ms 5208 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 69 ms 23160 KB Output is correct
30 Correct 70 ms 22776 KB Output is correct
31 Correct 65 ms 22956 KB Output is correct
32 Correct 60 ms 22964 KB Output is correct
33 Correct 61 ms 14872 KB Output is correct
34 Correct 51 ms 14348 KB Output is correct
35 Correct 61 ms 22712 KB Output is correct
36 Correct 62 ms 22624 KB Output is correct
37 Correct 14 ms 5724 KB Output is correct
38 Correct 59 ms 22960 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 24 ms 6604 KB Output is correct
41 Correct 61 ms 22704 KB Output is correct
42 Correct 61 ms 22928 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 60 ms 22708 KB Output is correct
45 Correct 61 ms 22912 KB Output is correct
46 Correct 21 ms 6360 KB Output is correct
47 Correct 65 ms 22960 KB Output is correct
48 Correct 56 ms 23344 KB Output is correct
49 Correct 13 ms 5672 KB Output is correct
50 Correct 54 ms 14024 KB Output is correct
51 Correct 59 ms 22224 KB Output is correct
52 Correct 13 ms 5624 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 48 ms 14524 KB Output is correct
55 Correct 47 ms 14524 KB Output is correct
56 Correct 160 ms 31116 KB Output is correct
57 Correct 127 ms 28172 KB Output is correct
58 Correct 135 ms 29164 KB Output is correct
59 Correct 144 ms 26804 KB Output is correct
60 Correct 133 ms 23100 KB Output is correct
61 Correct 130 ms 29104 KB Output is correct
62 Correct 124 ms 25408 KB Output is correct
63 Correct 124 ms 23712 KB Output is correct
64 Correct 54 ms 7844 KB Output is correct
65 Correct 134 ms 28336 KB Output is correct
66 Correct 47 ms 8532 KB Output is correct
67 Correct 47 ms 9300 KB Output is correct
68 Correct 80 ms 23512 KB Output is correct
69 Correct 141 ms 28876 KB Output is correct
70 Correct 15 ms 5976 KB Output is correct
71 Correct 72 ms 23468 KB Output is correct
72 Correct 136 ms 26684 KB Output is correct
73 Correct 13 ms 5980 KB Output is correct
74 Correct 65 ms 15784 KB Output is correct
75 Correct 139 ms 31388 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 67 ms 14404 KB Output is correct
78 Correct 104 ms 23980 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 7628 KB Output is correct
2 Correct 31 ms 6604 KB Output is correct
3 Correct 13 ms 5724 KB Output is correct
4 Correct 17 ms 5976 KB Output is correct
5 Correct 143 ms 30628 KB Output is correct
6 Correct 154 ms 29416 KB Output is correct
7 Correct 142 ms 30116 KB Output is correct
8 Correct 146 ms 28872 KB Output is correct
9 Correct 148 ms 30640 KB Output is correct
10 Correct 156 ms 29288 KB Output is correct
11 Correct 154 ms 27748 KB Output is correct
12 Correct 119 ms 27048 KB Output is correct
13 Correct 98 ms 11724 KB Output is correct
14 Correct 144 ms 29356 KB Output is correct
15 Correct 158 ms 29364 KB Output is correct
16 Correct 60 ms 14912 KB Output is correct
17 Correct 74 ms 22968 KB Output is correct
18 Correct 177 ms 29492 KB Output is correct
19 Correct 70 ms 23216 KB Output is correct
20 Correct 75 ms 22960 KB Output is correct
21 Correct 178 ms 28752 KB Output is correct
22 Correct 59 ms 14772 KB Output is correct
23 Correct 78 ms 23092 KB Output is correct
24 Correct 181 ms 30636 KB Output is correct
25 Correct 64 ms 23468 KB Output is correct
26 Correct 61 ms 23292 KB Output is correct
27 Correct 130 ms 26628 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 5 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 5 ms 5696 KB Output is correct
6 Correct 5 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5592 KB Output is correct
9 Correct 6 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 4 ms 5468 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 5468 KB Output is correct
17 Correct 5 ms 5584 KB Output is correct
18 Correct 3 ms 5208 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 69 ms 23160 KB Output is correct
30 Correct 70 ms 22776 KB Output is correct
31 Correct 65 ms 22956 KB Output is correct
32 Correct 60 ms 22964 KB Output is correct
33 Correct 61 ms 14872 KB Output is correct
34 Correct 51 ms 14348 KB Output is correct
35 Correct 61 ms 22712 KB Output is correct
36 Correct 62 ms 22624 KB Output is correct
37 Correct 14 ms 5724 KB Output is correct
38 Correct 59 ms 22960 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 24 ms 6604 KB Output is correct
41 Correct 61 ms 22704 KB Output is correct
42 Correct 61 ms 22928 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 60 ms 22708 KB Output is correct
45 Correct 61 ms 22912 KB Output is correct
46 Correct 21 ms 6360 KB Output is correct
47 Correct 65 ms 22960 KB Output is correct
48 Correct 56 ms 23344 KB Output is correct
49 Correct 13 ms 5672 KB Output is correct
50 Correct 54 ms 14024 KB Output is correct
51 Correct 59 ms 22224 KB Output is correct
52 Correct 13 ms 5624 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 48 ms 14524 KB Output is correct
55 Correct 47 ms 14524 KB Output is correct
56 Correct 160 ms 31116 KB Output is correct
57 Correct 127 ms 28172 KB Output is correct
58 Correct 135 ms 29164 KB Output is correct
59 Correct 144 ms 26804 KB Output is correct
60 Correct 133 ms 23100 KB Output is correct
61 Correct 130 ms 29104 KB Output is correct
62 Correct 124 ms 25408 KB Output is correct
63 Correct 124 ms 23712 KB Output is correct
64 Correct 54 ms 7844 KB Output is correct
65 Correct 134 ms 28336 KB Output is correct
66 Correct 47 ms 8532 KB Output is correct
67 Correct 47 ms 9300 KB Output is correct
68 Correct 80 ms 23512 KB Output is correct
69 Correct 141 ms 28876 KB Output is correct
70 Correct 15 ms 5976 KB Output is correct
71 Correct 72 ms 23468 KB Output is correct
72 Correct 136 ms 26684 KB Output is correct
73 Correct 13 ms 5980 KB Output is correct
74 Correct 65 ms 15784 KB Output is correct
75 Correct 139 ms 31388 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 67 ms 14404 KB Output is correct
78 Correct 104 ms 23980 KB Output is correct
79 Correct 36 ms 7628 KB Output is correct
80 Correct 31 ms 6604 KB Output is correct
81 Correct 13 ms 5724 KB Output is correct
82 Correct 17 ms 5976 KB Output is correct
83 Correct 143 ms 30628 KB Output is correct
84 Correct 154 ms 29416 KB Output is correct
85 Correct 142 ms 30116 KB Output is correct
86 Correct 146 ms 28872 KB Output is correct
87 Correct 148 ms 30640 KB Output is correct
88 Correct 156 ms 29288 KB Output is correct
89 Correct 154 ms 27748 KB Output is correct
90 Correct 119 ms 27048 KB Output is correct
91 Correct 98 ms 11724 KB Output is correct
92 Correct 144 ms 29356 KB Output is correct
93 Correct 158 ms 29364 KB Output is correct
94 Correct 60 ms 14912 KB Output is correct
95 Correct 74 ms 22968 KB Output is correct
96 Correct 177 ms 29492 KB Output is correct
97 Correct 70 ms 23216 KB Output is correct
98 Correct 75 ms 22960 KB Output is correct
99 Correct 178 ms 28752 KB Output is correct
100 Correct 59 ms 14772 KB Output is correct
101 Correct 78 ms 23092 KB Output is correct
102 Correct 181 ms 30636 KB Output is correct
103 Correct 64 ms 23468 KB Output is correct
104 Correct 61 ms 23292 KB Output is correct
105 Correct 130 ms 26628 KB Output is correct
106 Correct 30 ms 6360 KB Output is correct
107 Correct 37 ms 7880 KB Output is correct
108 Correct 33 ms 6992 KB Output is correct
109 Correct 45 ms 7884 KB Output is correct
110 Correct 155 ms 31556 KB Output is correct
111 Correct 161 ms 30620 KB Output is correct
112 Correct 189 ms 30644 KB Output is correct
113 Correct 159 ms 29624 KB Output is correct
114 Correct 162 ms 31920 KB Output is correct
115 Correct 186 ms 30368 KB Output is correct
116 Correct 196 ms 46104 KB Output is correct
117 Correct 140 ms 27768 KB Output is correct
118 Correct 104 ms 13580 KB Output is correct
119 Correct 72 ms 8784 KB Output is correct
120 Correct 161 ms 30108 KB Output is correct
121 Correct 76 ms 23508 KB Output is correct
122 Correct 83 ms 23472 KB Output is correct
123 Correct 166 ms 30640 KB Output is correct
124 Correct 62 ms 15532 KB Output is correct
125 Correct 84 ms 23224 KB Output is correct
126 Correct 155 ms 29876 KB Output is correct
127 Correct 63 ms 14536 KB Output is correct
128 Correct 78 ms 23732 KB Output is correct
129 Correct 159 ms 32344 KB Output is correct
130 Correct 72 ms 23500 KB Output is correct
131 Correct 92 ms 23352 KB Output is correct
132 Correct 139 ms 27764 KB Output is correct