oj.uz

답안 #988020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988020 2024-05-23T20:33:05 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 189 ms 46112 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;
node 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;
    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[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)
                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:119:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  119 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:139:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:145:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  145 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:163:15: warning: unused variable 'curr2' [-Wunused-variable]
  163 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 22972 KB Output is correct
2 Correct 70 ms 22780 KB Output is correct
3 Correct 78 ms 22816 KB Output is correct
4 Correct 63 ms 22816 KB Output is correct
5 Correct 57 ms 14764 KB Output is correct
6 Correct 70 ms 14516 KB Output is correct
7 Correct 72 ms 22696 KB Output is correct
8 Correct 69 ms 22452 KB Output is correct
9 Correct 15 ms 5724 KB Output is correct
10 Correct 69 ms 22872 KB Output is correct
11 Correct 13 ms 5748 KB Output is correct
12 Correct 28 ms 6716 KB Output is correct
13 Correct 67 ms 22712 KB Output is correct
14 Correct 64 ms 22956 KB Output is correct
15 Correct 16 ms 5720 KB Output is correct
16 Correct 65 ms 22672 KB Output is correct
17 Correct 66 ms 22708 KB Output is correct
18 Correct 23 ms 6352 KB Output is correct
19 Correct 69 ms 22924 KB Output is correct
20 Correct 78 ms 23212 KB Output is correct
21 Correct 16 ms 5720 KB Output is correct
22 Correct 58 ms 14032 KB Output is correct
23 Correct 60 ms 22252 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5600 KB Output is correct
26 Correct 52 ms 14528 KB Output is correct
27 Correct 51 ms 14528 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 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 7 ms 5592 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5468 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 6 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 5 ms 5468 KB Output is correct
29 Correct 65 ms 22972 KB Output is correct
30 Correct 70 ms 22780 KB Output is correct
31 Correct 78 ms 22816 KB Output is correct
32 Correct 63 ms 22816 KB Output is correct
33 Correct 57 ms 14764 KB Output is correct
34 Correct 70 ms 14516 KB Output is correct
35 Correct 72 ms 22696 KB Output is correct
36 Correct 69 ms 22452 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 69 ms 22872 KB Output is correct
39 Correct 13 ms 5748 KB Output is correct
40 Correct 28 ms 6716 KB Output is correct
41 Correct 67 ms 22712 KB Output is correct
42 Correct 64 ms 22956 KB Output is correct
43 Correct 16 ms 5720 KB Output is correct
44 Correct 65 ms 22672 KB Output is correct
45 Correct 66 ms 22708 KB Output is correct
46 Correct 23 ms 6352 KB Output is correct
47 Correct 69 ms 22924 KB Output is correct
48 Correct 78 ms 23212 KB Output is correct
49 Correct 16 ms 5720 KB Output is correct
50 Correct 58 ms 14032 KB Output is correct
51 Correct 60 ms 22252 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5600 KB Output is correct
54 Correct 52 ms 14528 KB Output is correct
55 Correct 51 ms 14528 KB Output is correct
56 Correct 162 ms 30944 KB Output is correct
57 Correct 137 ms 28184 KB Output is correct
58 Correct 136 ms 29212 KB Output is correct
59 Correct 134 ms 26796 KB Output is correct
60 Correct 155 ms 23176 KB Output is correct
61 Correct 153 ms 29116 KB Output is correct
62 Correct 126 ms 25392 KB Output is correct
63 Correct 114 ms 23560 KB Output is correct
64 Correct 54 ms 7884 KB Output is correct
65 Correct 169 ms 28556 KB Output is correct
66 Correct 49 ms 8532 KB Output is correct
67 Correct 50 ms 9160 KB Output is correct
68 Correct 76 ms 23472 KB Output is correct
69 Correct 141 ms 28844 KB Output is correct
70 Correct 17 ms 5976 KB Output is correct
71 Correct 74 ms 23472 KB Output is correct
72 Correct 123 ms 26832 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 67 ms 15788 KB Output is correct
75 Correct 138 ms 31400 KB Output is correct
76 Correct 17 ms 5724 KB Output is correct
77 Correct 61 ms 14532 KB Output is correct
78 Correct 108 ms 23976 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 7636 KB Output is correct
2 Correct 36 ms 6440 KB Output is correct
3 Correct 16 ms 5724 KB Output is correct
4 Correct 16 ms 5980 KB Output is correct
5 Correct 155 ms 30708 KB Output is correct
6 Correct 166 ms 29620 KB Output is correct
7 Correct 148 ms 29996 KB Output is correct
8 Correct 140 ms 28844 KB Output is correct
9 Correct 188 ms 31004 KB Output is correct
10 Correct 146 ms 29108 KB Output is correct
11 Correct 144 ms 27824 KB Output is correct
12 Correct 129 ms 27324 KB Output is correct
13 Correct 101 ms 11728 KB Output is correct
14 Correct 146 ms 29360 KB Output is correct
15 Correct 162 ms 29344 KB Output is correct
16 Correct 63 ms 15028 KB Output is correct
17 Correct 72 ms 23080 KB Output is correct
18 Correct 152 ms 29540 KB Output is correct
19 Correct 69 ms 23220 KB Output is correct
20 Correct 75 ms 22956 KB Output is correct
21 Correct 138 ms 28588 KB Output is correct
22 Correct 62 ms 14772 KB Output is correct
23 Correct 69 ms 22956 KB Output is correct
24 Correct 164 ms 30636 KB Output is correct
25 Correct 67 ms 23372 KB Output is correct
26 Correct 60 ms 23472 KB Output is correct
27 Correct 126 ms 26764 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5592 KB Output is correct
4 Correct 5 ms 5588 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 5 ms 5592 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 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 7 ms 5592 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5724 KB Output is correct
21 Correct 4 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 5 ms 5468 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 6 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 5 ms 5468 KB Output is correct
29 Correct 65 ms 22972 KB Output is correct
30 Correct 70 ms 22780 KB Output is correct
31 Correct 78 ms 22816 KB Output is correct
32 Correct 63 ms 22816 KB Output is correct
33 Correct 57 ms 14764 KB Output is correct
34 Correct 70 ms 14516 KB Output is correct
35 Correct 72 ms 22696 KB Output is correct
36 Correct 69 ms 22452 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 69 ms 22872 KB Output is correct
39 Correct 13 ms 5748 KB Output is correct
40 Correct 28 ms 6716 KB Output is correct
41 Correct 67 ms 22712 KB Output is correct
42 Correct 64 ms 22956 KB Output is correct
43 Correct 16 ms 5720 KB Output is correct
44 Correct 65 ms 22672 KB Output is correct
45 Correct 66 ms 22708 KB Output is correct
46 Correct 23 ms 6352 KB Output is correct
47 Correct 69 ms 22924 KB Output is correct
48 Correct 78 ms 23212 KB Output is correct
49 Correct 16 ms 5720 KB Output is correct
50 Correct 58 ms 14032 KB Output is correct
51 Correct 60 ms 22252 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5600 KB Output is correct
54 Correct 52 ms 14528 KB Output is correct
55 Correct 51 ms 14528 KB Output is correct
56 Correct 162 ms 30944 KB Output is correct
57 Correct 137 ms 28184 KB Output is correct
58 Correct 136 ms 29212 KB Output is correct
59 Correct 134 ms 26796 KB Output is correct
60 Correct 155 ms 23176 KB Output is correct
61 Correct 153 ms 29116 KB Output is correct
62 Correct 126 ms 25392 KB Output is correct
63 Correct 114 ms 23560 KB Output is correct
64 Correct 54 ms 7884 KB Output is correct
65 Correct 169 ms 28556 KB Output is correct
66 Correct 49 ms 8532 KB Output is correct
67 Correct 50 ms 9160 KB Output is correct
68 Correct 76 ms 23472 KB Output is correct
69 Correct 141 ms 28844 KB Output is correct
70 Correct 17 ms 5976 KB Output is correct
71 Correct 74 ms 23472 KB Output is correct
72 Correct 123 ms 26832 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 67 ms 15788 KB Output is correct
75 Correct 138 ms 31400 KB Output is correct
76 Correct 17 ms 5724 KB Output is correct
77 Correct 61 ms 14532 KB Output is correct
78 Correct 108 ms 23976 KB Output is correct
79 Correct 47 ms 7636 KB Output is correct
80 Correct 36 ms 6440 KB Output is correct
81 Correct 16 ms 5724 KB Output is correct
82 Correct 16 ms 5980 KB Output is correct
83 Correct 155 ms 30708 KB Output is correct
84 Correct 166 ms 29620 KB Output is correct
85 Correct 148 ms 29996 KB Output is correct
86 Correct 140 ms 28844 KB Output is correct
87 Correct 188 ms 31004 KB Output is correct
88 Correct 146 ms 29108 KB Output is correct
89 Correct 144 ms 27824 KB Output is correct
90 Correct 129 ms 27324 KB Output is correct
91 Correct 101 ms 11728 KB Output is correct
92 Correct 146 ms 29360 KB Output is correct
93 Correct 162 ms 29344 KB Output is correct
94 Correct 63 ms 15028 KB Output is correct
95 Correct 72 ms 23080 KB Output is correct
96 Correct 152 ms 29540 KB Output is correct
97 Correct 69 ms 23220 KB Output is correct
98 Correct 75 ms 22956 KB Output is correct
99 Correct 138 ms 28588 KB Output is correct
100 Correct 62 ms 14772 KB Output is correct
101 Correct 69 ms 22956 KB Output is correct
102 Correct 164 ms 30636 KB Output is correct
103 Correct 67 ms 23372 KB Output is correct
104 Correct 60 ms 23472 KB Output is correct
105 Correct 126 ms 26764 KB Output is correct
106 Correct 36 ms 6228 KB Output is correct
107 Correct 43 ms 8052 KB Output is correct
108 Correct 38 ms 6900 KB Output is correct
109 Correct 42 ms 7876 KB Output is correct
110 Correct 160 ms 31480 KB Output is correct
111 Correct 168 ms 30620 KB Output is correct
112 Correct 163 ms 30548 KB Output is correct
113 Correct 153 ms 29608 KB Output is correct
114 Correct 180 ms 31920 KB Output is correct
115 Correct 156 ms 30384 KB Output is correct
116 Correct 174 ms 46112 KB Output is correct
117 Correct 140 ms 27596 KB Output is correct
118 Correct 109 ms 13648 KB Output is correct
119 Correct 56 ms 8532 KB Output is correct
120 Correct 185 ms 30048 KB Output is correct
121 Correct 73 ms 23520 KB Output is correct
122 Correct 82 ms 23420 KB Output is correct
123 Correct 189 ms 30720 KB Output is correct
124 Correct 68 ms 15456 KB Output is correct
125 Correct 87 ms 23228 KB Output is correct
126 Correct 167 ms 30176 KB Output is correct
127 Correct 62 ms 14552 KB Output is correct
128 Correct 77 ms 23764 KB Output is correct
129 Correct 157 ms 32268 KB Output is correct
130 Correct 80 ms 23480 KB Output is correct
131 Correct 76 ms 23272 KB Output is correct
132 Correct 140 ms 27860 KB Output is correct