oj.uz

답안 #988012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988012 2024-05-23T20:27:04 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 209 ms 46216 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)
{
    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.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: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:157:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |     for(i=0; i<ord.size(); 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 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 5 ms 8592 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 5208 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 5 ms 5468 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 4 ms 5252 KB Output is correct
19 Correct 4 ms 5720 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 6 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 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 22960 KB Output is correct
2 Correct 65 ms 22964 KB Output is correct
3 Correct 70 ms 22968 KB Output is correct
4 Correct 75 ms 23132 KB Output is correct
5 Correct 55 ms 14760 KB Output is correct
6 Correct 56 ms 14508 KB Output is correct
7 Correct 65 ms 22708 KB Output is correct
8 Correct 58 ms 22528 KB Output is correct
9 Correct 15 ms 5724 KB Output is correct
10 Correct 65 ms 22964 KB Output is correct
11 Correct 13 ms 5720 KB Output is correct
12 Correct 29 ms 6616 KB Output is correct
13 Correct 65 ms 22708 KB Output is correct
14 Correct 64 ms 22964 KB Output is correct
15 Correct 15 ms 5892 KB Output is correct
16 Correct 65 ms 22652 KB Output is correct
17 Correct 68 ms 22720 KB Output is correct
18 Correct 22 ms 6364 KB Output is correct
19 Correct 66 ms 22964 KB Output is correct
20 Correct 61 ms 23232 KB Output is correct
21 Correct 15 ms 5720 KB Output is correct
22 Correct 59 ms 13924 KB Output is correct
23 Correct 60 ms 22364 KB Output is correct
24 Correct 19 ms 5724 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 51 ms 14528 KB Output is correct
27 Correct 52 ms 14524 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 5 ms 8592 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 5208 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 5 ms 5468 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 4 ms 5252 KB Output is correct
19 Correct 4 ms 5720 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 6 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 5 ms 5468 KB Output is correct
29 Correct 65 ms 22960 KB Output is correct
30 Correct 65 ms 22964 KB Output is correct
31 Correct 70 ms 22968 KB Output is correct
32 Correct 75 ms 23132 KB Output is correct
33 Correct 55 ms 14760 KB Output is correct
34 Correct 56 ms 14508 KB Output is correct
35 Correct 65 ms 22708 KB Output is correct
36 Correct 58 ms 22528 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22964 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 29 ms 6616 KB Output is correct
41 Correct 65 ms 22708 KB Output is correct
42 Correct 64 ms 22964 KB Output is correct
43 Correct 15 ms 5892 KB Output is correct
44 Correct 65 ms 22652 KB Output is correct
45 Correct 68 ms 22720 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 66 ms 22964 KB Output is correct
48 Correct 61 ms 23232 KB Output is correct
49 Correct 15 ms 5720 KB Output is correct
50 Correct 59 ms 13924 KB Output is correct
51 Correct 60 ms 22364 KB Output is correct
52 Correct 19 ms 5724 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 51 ms 14528 KB Output is correct
55 Correct 52 ms 14524 KB Output is correct
56 Correct 138 ms 30820 KB Output is correct
57 Correct 145 ms 28216 KB Output is correct
58 Correct 137 ms 29092 KB Output is correct
59 Correct 129 ms 26732 KB Output is correct
60 Correct 135 ms 23084 KB Output is correct
61 Correct 149 ms 28996 KB Output is correct
62 Correct 130 ms 25544 KB Output is correct
63 Correct 106 ms 23660 KB Output is correct
64 Correct 54 ms 7872 KB Output is correct
65 Correct 129 ms 28224 KB Output is correct
66 Correct 52 ms 8532 KB Output is correct
67 Correct 50 ms 9164 KB Output is correct
68 Correct 80 ms 23468 KB Output is correct
69 Correct 138 ms 28976 KB Output is correct
70 Correct 16 ms 5976 KB Output is correct
71 Correct 81 ms 23664 KB Output is correct
72 Correct 130 ms 26672 KB Output is correct
73 Correct 14 ms 5720 KB Output is correct
74 Correct 67 ms 15696 KB Output is correct
75 Correct 155 ms 31364 KB Output is correct
76 Correct 14 ms 5720 KB Output is correct
77 Correct 64 ms 14564 KB Output is correct
78 Correct 107 ms 24000 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7636 KB Output is correct
2 Correct 35 ms 6432 KB Output is correct
3 Correct 15 ms 5724 KB Output is correct
4 Correct 15 ms 5980 KB Output is correct
5 Correct 152 ms 30524 KB Output is correct
6 Correct 143 ms 29252 KB Output is correct
7 Correct 152 ms 29820 KB Output is correct
8 Correct 152 ms 28928 KB Output is correct
9 Correct 166 ms 30732 KB Output is correct
10 Correct 148 ms 29292 KB Output is correct
11 Correct 139 ms 27716 KB Output is correct
12 Correct 125 ms 27772 KB Output is correct
13 Correct 101 ms 11520 KB Output is correct
14 Correct 144 ms 29376 KB Output is correct
15 Correct 160 ms 29388 KB Output is correct
16 Correct 61 ms 15028 KB Output is correct
17 Correct 71 ms 22968 KB Output is correct
18 Correct 154 ms 29496 KB Output is correct
19 Correct 69 ms 23308 KB Output is correct
20 Correct 73 ms 22972 KB Output is correct
21 Correct 140 ms 28724 KB Output is correct
22 Correct 62 ms 14900 KB Output is correct
23 Correct 82 ms 22968 KB Output is correct
24 Correct 153 ms 30772 KB Output is correct
25 Correct 63 ms 23500 KB Output is correct
26 Correct 61 ms 23472 KB Output is correct
27 Correct 131 ms 27552 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 8 ms 8536 KB Output is correct
5 Correct 5 ms 8592 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 5 ms 6492 KB Output is correct
11 Correct 4 ms 5980 KB Output is correct
12 Correct 4 ms 5208 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 5 ms 5468 KB Output is correct
17 Correct 5 ms 5588 KB Output is correct
18 Correct 4 ms 5252 KB Output is correct
19 Correct 4 ms 5720 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 6 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 5 ms 5468 KB Output is correct
29 Correct 65 ms 22960 KB Output is correct
30 Correct 65 ms 22964 KB Output is correct
31 Correct 70 ms 22968 KB Output is correct
32 Correct 75 ms 23132 KB Output is correct
33 Correct 55 ms 14760 KB Output is correct
34 Correct 56 ms 14508 KB Output is correct
35 Correct 65 ms 22708 KB Output is correct
36 Correct 58 ms 22528 KB Output is correct
37 Correct 15 ms 5724 KB Output is correct
38 Correct 65 ms 22964 KB Output is correct
39 Correct 13 ms 5720 KB Output is correct
40 Correct 29 ms 6616 KB Output is correct
41 Correct 65 ms 22708 KB Output is correct
42 Correct 64 ms 22964 KB Output is correct
43 Correct 15 ms 5892 KB Output is correct
44 Correct 65 ms 22652 KB Output is correct
45 Correct 68 ms 22720 KB Output is correct
46 Correct 22 ms 6364 KB Output is correct
47 Correct 66 ms 22964 KB Output is correct
48 Correct 61 ms 23232 KB Output is correct
49 Correct 15 ms 5720 KB Output is correct
50 Correct 59 ms 13924 KB Output is correct
51 Correct 60 ms 22364 KB Output is correct
52 Correct 19 ms 5724 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 51 ms 14528 KB Output is correct
55 Correct 52 ms 14524 KB Output is correct
56 Correct 138 ms 30820 KB Output is correct
57 Correct 145 ms 28216 KB Output is correct
58 Correct 137 ms 29092 KB Output is correct
59 Correct 129 ms 26732 KB Output is correct
60 Correct 135 ms 23084 KB Output is correct
61 Correct 149 ms 28996 KB Output is correct
62 Correct 130 ms 25544 KB Output is correct
63 Correct 106 ms 23660 KB Output is correct
64 Correct 54 ms 7872 KB Output is correct
65 Correct 129 ms 28224 KB Output is correct
66 Correct 52 ms 8532 KB Output is correct
67 Correct 50 ms 9164 KB Output is correct
68 Correct 80 ms 23468 KB Output is correct
69 Correct 138 ms 28976 KB Output is correct
70 Correct 16 ms 5976 KB Output is correct
71 Correct 81 ms 23664 KB Output is correct
72 Correct 130 ms 26672 KB Output is correct
73 Correct 14 ms 5720 KB Output is correct
74 Correct 67 ms 15696 KB Output is correct
75 Correct 155 ms 31364 KB Output is correct
76 Correct 14 ms 5720 KB Output is correct
77 Correct 64 ms 14564 KB Output is correct
78 Correct 107 ms 24000 KB Output is correct
79 Correct 40 ms 7636 KB Output is correct
80 Correct 35 ms 6432 KB Output is correct
81 Correct 15 ms 5724 KB Output is correct
82 Correct 15 ms 5980 KB Output is correct
83 Correct 152 ms 30524 KB Output is correct
84 Correct 143 ms 29252 KB Output is correct
85 Correct 152 ms 29820 KB Output is correct
86 Correct 152 ms 28928 KB Output is correct
87 Correct 166 ms 30732 KB Output is correct
88 Correct 148 ms 29292 KB Output is correct
89 Correct 139 ms 27716 KB Output is correct
90 Correct 125 ms 27772 KB Output is correct
91 Correct 101 ms 11520 KB Output is correct
92 Correct 144 ms 29376 KB Output is correct
93 Correct 160 ms 29388 KB Output is correct
94 Correct 61 ms 15028 KB Output is correct
95 Correct 71 ms 22968 KB Output is correct
96 Correct 154 ms 29496 KB Output is correct
97 Correct 69 ms 23308 KB Output is correct
98 Correct 73 ms 22972 KB Output is correct
99 Correct 140 ms 28724 KB Output is correct
100 Correct 62 ms 14900 KB Output is correct
101 Correct 82 ms 22968 KB Output is correct
102 Correct 153 ms 30772 KB Output is correct
103 Correct 63 ms 23500 KB Output is correct
104 Correct 61 ms 23472 KB Output is correct
105 Correct 131 ms 27552 KB Output is correct
106 Correct 40 ms 6360 KB Output is correct
107 Correct 44 ms 7884 KB Output is correct
108 Correct 45 ms 6884 KB Output is correct
109 Correct 42 ms 7824 KB Output is correct
110 Correct 169 ms 31628 KB Output is correct
111 Correct 164 ms 30752 KB Output is correct
112 Correct 161 ms 30488 KB Output is correct
113 Correct 156 ms 29400 KB Output is correct
114 Correct 183 ms 31780 KB Output is correct
115 Correct 160 ms 30260 KB Output is correct
116 Correct 182 ms 46216 KB Output is correct
117 Correct 135 ms 27652 KB Output is correct
118 Correct 109 ms 13540 KB Output is correct
119 Correct 53 ms 8528 KB Output is correct
120 Correct 209 ms 30232 KB Output is correct
121 Correct 71 ms 23472 KB Output is correct
122 Correct 81 ms 23476 KB Output is correct
123 Correct 190 ms 30652 KB Output is correct
124 Correct 65 ms 15536 KB Output is correct
125 Correct 97 ms 23476 KB Output is correct
126 Correct 174 ms 30036 KB Output is correct
127 Correct 64 ms 14524 KB Output is correct
128 Correct 81 ms 23732 KB Output is correct
129 Correct 157 ms 32244 KB Output is correct
130 Correct 73 ms 23476 KB Output is correct
131 Correct 101 ms 23212 KB Output is correct
132 Correct 148 ms 27884 KB Output is correct