oj.uz

답안 #988033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988033 2024-05-23T20:45:33 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 208 ms 48624 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: 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 5 ms 5724 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 7 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5612 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 5 ms 5696 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 5724 KB Output is correct
15 Correct 3 ms 5424 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5688 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5468 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 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5216 KB Output is correct
26 Correct 5 ms 5604 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 23160 KB Output is correct
2 Correct 74 ms 22960 KB Output is correct
3 Correct 63 ms 22928 KB Output is correct
4 Correct 63 ms 23220 KB Output is correct
5 Correct 53 ms 14724 KB Output is correct
6 Correct 56 ms 14452 KB Output is correct
7 Correct 70 ms 22696 KB Output is correct
8 Correct 58 ms 22684 KB Output is correct
9 Correct 13 ms 5796 KB Output is correct
10 Correct 60 ms 22964 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 27 ms 6712 KB Output is correct
13 Correct 73 ms 22744 KB Output is correct
14 Correct 61 ms 22964 KB Output is correct
15 Correct 13 ms 5724 KB Output is correct
16 Correct 61 ms 22624 KB Output is correct
17 Correct 78 ms 22732 KB Output is correct
18 Correct 24 ms 6316 KB Output is correct
19 Correct 62 ms 22960 KB Output is correct
20 Correct 57 ms 23480 KB Output is correct
21 Correct 14 ms 5724 KB Output is correct
22 Correct 57 ms 14032 KB Output is correct
23 Correct 60 ms 22448 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 49 ms 14528 KB Output is correct
27 Correct 50 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 6 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 7 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5612 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 5 ms 5696 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 5724 KB Output is correct
15 Correct 3 ms 5424 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5688 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5468 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 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5216 KB Output is correct
26 Correct 5 ms 5604 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 61 ms 23160 KB Output is correct
30 Correct 74 ms 22960 KB Output is correct
31 Correct 63 ms 22928 KB Output is correct
32 Correct 63 ms 23220 KB Output is correct
33 Correct 53 ms 14724 KB Output is correct
34 Correct 56 ms 14452 KB Output is correct
35 Correct 70 ms 22696 KB Output is correct
36 Correct 58 ms 22684 KB Output is correct
37 Correct 13 ms 5796 KB Output is correct
38 Correct 60 ms 22964 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 6712 KB Output is correct
41 Correct 73 ms 22744 KB Output is correct
42 Correct 61 ms 22964 KB Output is correct
43 Correct 13 ms 5724 KB Output is correct
44 Correct 61 ms 22624 KB Output is correct
45 Correct 78 ms 22732 KB Output is correct
46 Correct 24 ms 6316 KB Output is correct
47 Correct 62 ms 22960 KB Output is correct
48 Correct 57 ms 23480 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 57 ms 14032 KB Output is correct
51 Correct 60 ms 22448 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 49 ms 14528 KB Output is correct
55 Correct 50 ms 14528 KB Output is correct
56 Correct 139 ms 34228 KB Output is correct
57 Correct 131 ms 30388 KB Output is correct
58 Correct 137 ms 31348 KB Output is correct
59 Correct 124 ms 28920 KB Output is correct
60 Correct 138 ms 25236 KB Output is correct
61 Correct 155 ms 31228 KB Output is correct
62 Correct 128 ms 27444 KB Output is correct
63 Correct 106 ms 25096 KB Output is correct
64 Correct 61 ms 9416 KB Output is correct
65 Correct 134 ms 30300 KB Output is correct
66 Correct 50 ms 10576 KB Output is correct
67 Correct 49 ms 9160 KB Output is correct
68 Correct 77 ms 23476 KB Output is correct
69 Correct 146 ms 31268 KB Output is correct
70 Correct 15 ms 5976 KB Output is correct
71 Correct 84 ms 23732 KB Output is correct
72 Correct 133 ms 28852 KB Output is correct
73 Correct 12 ms 5724 KB Output is correct
74 Correct 65 ms 15804 KB Output is correct
75 Correct 150 ms 33372 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 61 ms 14784 KB Output is correct
78 Correct 119 ms 25524 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7628 KB Output is correct
2 Correct 36 ms 6604 KB Output is correct
3 Correct 14 ms 5908 KB Output is correct
4 Correct 13 ms 5984 KB Output is correct
5 Correct 182 ms 33180 KB Output is correct
6 Correct 208 ms 31748 KB Output is correct
7 Correct 153 ms 32436 KB Output is correct
8 Correct 146 ms 31412 KB Output is correct
9 Correct 178 ms 33084 KB Output is correct
10 Correct 172 ms 31752 KB Output is correct
11 Correct 151 ms 30376 KB Output is correct
12 Correct 126 ms 29356 KB Output is correct
13 Correct 105 ms 14016 KB Output is correct
14 Correct 158 ms 31728 KB Output is correct
15 Correct 155 ms 31664 KB Output is correct
16 Correct 64 ms 15028 KB Output is correct
17 Correct 75 ms 22972 KB Output is correct
18 Correct 158 ms 32164 KB Output is correct
19 Correct 72 ms 23280 KB Output is correct
20 Correct 76 ms 22968 KB Output is correct
21 Correct 140 ms 31168 KB Output is correct
22 Correct 64 ms 14916 KB Output is correct
23 Correct 75 ms 23224 KB Output is correct
24 Correct 186 ms 33044 KB Output is correct
25 Correct 64 ms 23484 KB Output is correct
26 Correct 66 ms 23468 KB Output is correct
27 Correct 142 ms 28972 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 6 ms 5724 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 7 ms 5720 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 5 ms 5612 KB Output is correct
9 Correct 4 ms 5208 KB Output is correct
10 Correct 5 ms 5696 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 5724 KB Output is correct
15 Correct 3 ms 5424 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5688 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 5 ms 5468 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 5464 KB Output is correct
23 Correct 5 ms 5588 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5216 KB Output is correct
26 Correct 5 ms 5604 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 61 ms 23160 KB Output is correct
30 Correct 74 ms 22960 KB Output is correct
31 Correct 63 ms 22928 KB Output is correct
32 Correct 63 ms 23220 KB Output is correct
33 Correct 53 ms 14724 KB Output is correct
34 Correct 56 ms 14452 KB Output is correct
35 Correct 70 ms 22696 KB Output is correct
36 Correct 58 ms 22684 KB Output is correct
37 Correct 13 ms 5796 KB Output is correct
38 Correct 60 ms 22964 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 27 ms 6712 KB Output is correct
41 Correct 73 ms 22744 KB Output is correct
42 Correct 61 ms 22964 KB Output is correct
43 Correct 13 ms 5724 KB Output is correct
44 Correct 61 ms 22624 KB Output is correct
45 Correct 78 ms 22732 KB Output is correct
46 Correct 24 ms 6316 KB Output is correct
47 Correct 62 ms 22960 KB Output is correct
48 Correct 57 ms 23480 KB Output is correct
49 Correct 14 ms 5724 KB Output is correct
50 Correct 57 ms 14032 KB Output is correct
51 Correct 60 ms 22448 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 49 ms 14528 KB Output is correct
55 Correct 50 ms 14528 KB Output is correct
56 Correct 139 ms 34228 KB Output is correct
57 Correct 131 ms 30388 KB Output is correct
58 Correct 137 ms 31348 KB Output is correct
59 Correct 124 ms 28920 KB Output is correct
60 Correct 138 ms 25236 KB Output is correct
61 Correct 155 ms 31228 KB Output is correct
62 Correct 128 ms 27444 KB Output is correct
63 Correct 106 ms 25096 KB Output is correct
64 Correct 61 ms 9416 KB Output is correct
65 Correct 134 ms 30300 KB Output is correct
66 Correct 50 ms 10576 KB Output is correct
67 Correct 49 ms 9160 KB Output is correct
68 Correct 77 ms 23476 KB Output is correct
69 Correct 146 ms 31268 KB Output is correct
70 Correct 15 ms 5976 KB Output is correct
71 Correct 84 ms 23732 KB Output is correct
72 Correct 133 ms 28852 KB Output is correct
73 Correct 12 ms 5724 KB Output is correct
74 Correct 65 ms 15804 KB Output is correct
75 Correct 150 ms 33372 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 61 ms 14784 KB Output is correct
78 Correct 119 ms 25524 KB Output is correct
79 Correct 40 ms 7628 KB Output is correct
80 Correct 36 ms 6604 KB Output is correct
81 Correct 14 ms 5908 KB Output is correct
82 Correct 13 ms 5984 KB Output is correct
83 Correct 182 ms 33180 KB Output is correct
84 Correct 208 ms 31748 KB Output is correct
85 Correct 153 ms 32436 KB Output is correct
86 Correct 146 ms 31412 KB Output is correct
87 Correct 178 ms 33084 KB Output is correct
88 Correct 172 ms 31752 KB Output is correct
89 Correct 151 ms 30376 KB Output is correct
90 Correct 126 ms 29356 KB Output is correct
91 Correct 105 ms 14016 KB Output is correct
92 Correct 158 ms 31728 KB Output is correct
93 Correct 155 ms 31664 KB Output is correct
94 Correct 64 ms 15028 KB Output is correct
95 Correct 75 ms 22972 KB Output is correct
96 Correct 158 ms 32164 KB Output is correct
97 Correct 72 ms 23280 KB Output is correct
98 Correct 76 ms 22968 KB Output is correct
99 Correct 140 ms 31168 KB Output is correct
100 Correct 64 ms 14916 KB Output is correct
101 Correct 75 ms 23224 KB Output is correct
102 Correct 186 ms 33044 KB Output is correct
103 Correct 64 ms 23484 KB Output is correct
104 Correct 66 ms 23468 KB Output is correct
105 Correct 142 ms 28972 KB Output is correct
106 Correct 36 ms 6368 KB Output is correct
107 Correct 42 ms 7976 KB Output is correct
108 Correct 40 ms 6852 KB Output is correct
109 Correct 42 ms 7644 KB Output is correct
110 Correct 188 ms 34064 KB Output is correct
111 Correct 181 ms 33176 KB Output is correct
112 Correct 166 ms 32968 KB Output is correct
113 Correct 169 ms 31984 KB Output is correct
114 Correct 180 ms 34264 KB Output is correct
115 Correct 188 ms 32824 KB Output is correct
116 Correct 168 ms 48624 KB Output is correct
117 Correct 144 ms 30080 KB Output is correct
118 Correct 113 ms 16036 KB Output is correct
119 Correct 54 ms 10740 KB Output is correct
120 Correct 186 ms 32504 KB Output is correct
121 Correct 77 ms 23588 KB Output is correct
122 Correct 89 ms 23532 KB Output is correct
123 Correct 166 ms 33868 KB Output is correct
124 Correct 69 ms 15560 KB Output is correct
125 Correct 85 ms 23316 KB Output is correct
126 Correct 147 ms 33192 KB Output is correct
127 Correct 64 ms 14528 KB Output is correct
128 Correct 76 ms 23724 KB Output is correct
129 Correct 167 ms 35664 KB Output is correct
130 Correct 76 ms 23276 KB Output is correct
131 Correct 84 ms 23316 KB Output is correct
132 Correct 143 ms 31196 KB Output is correct