oj.uz

답안 #987983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987983 2024-05-23T20:05:56 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 193 ms 46244 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
int inf=1e9+10;
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;
}
signed  main()
{
    int  n,m,k,i,a,b;
    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(int 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
            {
                long long vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(int 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:123:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  123 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:143:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |                 for(int j=0; j<adj[i].size(); j++)
      |                              ~^~~~~~~~~~~~~~
Main.cpp:149:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  149 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:159:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:167:15: warning: unused variable 'curr2' [-Wunused-variable]
  167 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 4 ms 8792 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 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 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8536 KB Output is correct
14 Correct 4 ms 8632 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8388 KB Output is correct
23 Correct 5 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 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8496 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 25988 KB Output is correct
2 Correct 61 ms 25760 KB Output is correct
3 Correct 62 ms 25784 KB Output is correct
4 Correct 59 ms 25836 KB Output is correct
5 Correct 60 ms 17820 KB Output is correct
6 Correct 54 ms 18364 KB Output is correct
7 Correct 61 ms 25516 KB Output is correct
8 Correct 55 ms 25360 KB Output is correct
9 Correct 15 ms 8540 KB Output is correct
10 Correct 60 ms 25776 KB Output is correct
11 Correct 12 ms 8536 KB Output is correct
12 Correct 26 ms 9684 KB Output is correct
13 Correct 76 ms 25536 KB Output is correct
14 Correct 64 ms 25772 KB Output is correct
15 Correct 13 ms 8796 KB Output is correct
16 Correct 62 ms 25520 KB Output is correct
17 Correct 64 ms 25696 KB Output is correct
18 Correct 20 ms 9432 KB Output is correct
19 Correct 64 ms 22960 KB Output is correct
20 Correct 61 ms 26280 KB Output is correct
21 Correct 13 ms 8796 KB Output is correct
22 Correct 65 ms 16852 KB Output is correct
23 Correct 58 ms 25088 KB Output is correct
24 Correct 13 ms 8540 KB Output is correct
25 Correct 12 ms 8740 KB Output is correct
26 Correct 51 ms 14496 KB Output is correct
27 Correct 50 ms 14520 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 4 ms 8792 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 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 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8536 KB Output is correct
14 Correct 4 ms 8632 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8388 KB Output is correct
23 Correct 5 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 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8496 KB Output is correct
29 Correct 59 ms 25988 KB Output is correct
30 Correct 61 ms 25760 KB Output is correct
31 Correct 62 ms 25784 KB Output is correct
32 Correct 59 ms 25836 KB Output is correct
33 Correct 60 ms 17820 KB Output is correct
34 Correct 54 ms 18364 KB Output is correct
35 Correct 61 ms 25516 KB Output is correct
36 Correct 55 ms 25360 KB Output is correct
37 Correct 15 ms 8540 KB Output is correct
38 Correct 60 ms 25776 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 26 ms 9684 KB Output is correct
41 Correct 76 ms 25536 KB Output is correct
42 Correct 64 ms 25772 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 62 ms 25520 KB Output is correct
45 Correct 64 ms 25696 KB Output is correct
46 Correct 20 ms 9432 KB Output is correct
47 Correct 64 ms 22960 KB Output is correct
48 Correct 61 ms 26280 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 65 ms 16852 KB Output is correct
51 Correct 58 ms 25088 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8740 KB Output is correct
54 Correct 51 ms 14496 KB Output is correct
55 Correct 50 ms 14520 KB Output is correct
56 Correct 148 ms 31204 KB Output is correct
57 Correct 163 ms 28784 KB Output is correct
58 Correct 135 ms 29744 KB Output is correct
59 Correct 124 ms 27648 KB Output is correct
60 Correct 135 ms 23448 KB Output is correct
61 Correct 127 ms 29500 KB Output is correct
62 Correct 153 ms 26332 KB Output is correct
63 Correct 118 ms 24596 KB Output is correct
64 Correct 53 ms 10960 KB Output is correct
65 Correct 125 ms 30172 KB Output is correct
66 Correct 50 ms 11436 KB Output is correct
67 Correct 53 ms 12320 KB Output is correct
68 Correct 75 ms 26280 KB Output is correct
69 Correct 136 ms 30568 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 75 ms 26556 KB Output is correct
72 Correct 131 ms 29064 KB Output is correct
73 Correct 13 ms 8792 KB Output is correct
74 Correct 67 ms 18880 KB Output is correct
75 Correct 140 ms 32404 KB Output is correct
76 Correct 16 ms 8536 KB Output is correct
77 Correct 61 ms 17472 KB Output is correct
78 Correct 107 ms 27040 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 10712 KB Output is correct
2 Correct 38 ms 9432 KB Output is correct
3 Correct 13 ms 6748 KB Output is correct
4 Correct 17 ms 6776 KB Output is correct
5 Correct 155 ms 30556 KB Output is correct
6 Correct 147 ms 29232 KB Output is correct
7 Correct 164 ms 29964 KB Output is correct
8 Correct 146 ms 28868 KB Output is correct
9 Correct 190 ms 30704 KB Output is correct
10 Correct 168 ms 29228 KB Output is correct
11 Correct 132 ms 27700 KB Output is correct
12 Correct 137 ms 28352 KB Output is correct
13 Correct 102 ms 12224 KB Output is correct
14 Correct 140 ms 29244 KB Output is correct
15 Correct 146 ms 29416 KB Output is correct
16 Correct 60 ms 19252 KB Output is correct
17 Correct 73 ms 26040 KB Output is correct
18 Correct 148 ms 29496 KB Output is correct
19 Correct 79 ms 26324 KB Output is correct
20 Correct 75 ms 25972 KB Output is correct
21 Correct 143 ms 28724 KB Output is correct
22 Correct 61 ms 18888 KB Output is correct
23 Correct 76 ms 26052 KB Output is correct
24 Correct 158 ms 30764 KB Output is correct
25 Correct 63 ms 26444 KB Output is correct
26 Correct 84 ms 26404 KB Output is correct
27 Correct 132 ms 28044 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 4 ms 8792 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 5 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 4 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 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8536 KB Output is correct
14 Correct 4 ms 8632 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8540 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 5 ms 8388 KB Output is correct
23 Correct 5 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 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8496 KB Output is correct
29 Correct 59 ms 25988 KB Output is correct
30 Correct 61 ms 25760 KB Output is correct
31 Correct 62 ms 25784 KB Output is correct
32 Correct 59 ms 25836 KB Output is correct
33 Correct 60 ms 17820 KB Output is correct
34 Correct 54 ms 18364 KB Output is correct
35 Correct 61 ms 25516 KB Output is correct
36 Correct 55 ms 25360 KB Output is correct
37 Correct 15 ms 8540 KB Output is correct
38 Correct 60 ms 25776 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 26 ms 9684 KB Output is correct
41 Correct 76 ms 25536 KB Output is correct
42 Correct 64 ms 25772 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 62 ms 25520 KB Output is correct
45 Correct 64 ms 25696 KB Output is correct
46 Correct 20 ms 9432 KB Output is correct
47 Correct 64 ms 22960 KB Output is correct
48 Correct 61 ms 26280 KB Output is correct
49 Correct 13 ms 8796 KB Output is correct
50 Correct 65 ms 16852 KB Output is correct
51 Correct 58 ms 25088 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8740 KB Output is correct
54 Correct 51 ms 14496 KB Output is correct
55 Correct 50 ms 14520 KB Output is correct
56 Correct 148 ms 31204 KB Output is correct
57 Correct 163 ms 28784 KB Output is correct
58 Correct 135 ms 29744 KB Output is correct
59 Correct 124 ms 27648 KB Output is correct
60 Correct 135 ms 23448 KB Output is correct
61 Correct 127 ms 29500 KB Output is correct
62 Correct 153 ms 26332 KB Output is correct
63 Correct 118 ms 24596 KB Output is correct
64 Correct 53 ms 10960 KB Output is correct
65 Correct 125 ms 30172 KB Output is correct
66 Correct 50 ms 11436 KB Output is correct
67 Correct 53 ms 12320 KB Output is correct
68 Correct 75 ms 26280 KB Output is correct
69 Correct 136 ms 30568 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 75 ms 26556 KB Output is correct
72 Correct 131 ms 29064 KB Output is correct
73 Correct 13 ms 8792 KB Output is correct
74 Correct 67 ms 18880 KB Output is correct
75 Correct 140 ms 32404 KB Output is correct
76 Correct 16 ms 8536 KB Output is correct
77 Correct 61 ms 17472 KB Output is correct
78 Correct 107 ms 27040 KB Output is correct
79 Correct 39 ms 10712 KB Output is correct
80 Correct 38 ms 9432 KB Output is correct
81 Correct 13 ms 6748 KB Output is correct
82 Correct 17 ms 6776 KB Output is correct
83 Correct 155 ms 30556 KB Output is correct
84 Correct 147 ms 29232 KB Output is correct
85 Correct 164 ms 29964 KB Output is correct
86 Correct 146 ms 28868 KB Output is correct
87 Correct 190 ms 30704 KB Output is correct
88 Correct 168 ms 29228 KB Output is correct
89 Correct 132 ms 27700 KB Output is correct
90 Correct 137 ms 28352 KB Output is correct
91 Correct 102 ms 12224 KB Output is correct
92 Correct 140 ms 29244 KB Output is correct
93 Correct 146 ms 29416 KB Output is correct
94 Correct 60 ms 19252 KB Output is correct
95 Correct 73 ms 26040 KB Output is correct
96 Correct 148 ms 29496 KB Output is correct
97 Correct 79 ms 26324 KB Output is correct
98 Correct 75 ms 25972 KB Output is correct
99 Correct 143 ms 28724 KB Output is correct
100 Correct 61 ms 18888 KB Output is correct
101 Correct 76 ms 26052 KB Output is correct
102 Correct 158 ms 30764 KB Output is correct
103 Correct 63 ms 26444 KB Output is correct
104 Correct 84 ms 26404 KB Output is correct
105 Correct 132 ms 28044 KB Output is correct
106 Correct 36 ms 9176 KB Output is correct
107 Correct 42 ms 10948 KB Output is correct
108 Correct 38 ms 9684 KB Output is correct
109 Correct 41 ms 10672 KB Output is correct
110 Correct 171 ms 31712 KB Output is correct
111 Correct 155 ms 30672 KB Output is correct
112 Correct 172 ms 30500 KB Output is correct
113 Correct 160 ms 29496 KB Output is correct
114 Correct 193 ms 31780 KB Output is correct
115 Correct 156 ms 30400 KB Output is correct
116 Correct 167 ms 46244 KB Output is correct
117 Correct 136 ms 28380 KB Output is correct
118 Correct 108 ms 14292 KB Output is correct
119 Correct 59 ms 11348 KB Output is correct
120 Correct 157 ms 30008 KB Output is correct
121 Correct 72 ms 26328 KB Output is correct
122 Correct 76 ms 26288 KB Output is correct
123 Correct 173 ms 30520 KB Output is correct
124 Correct 65 ms 18360 KB Output is correct
125 Correct 85 ms 26040 KB Output is correct
126 Correct 145 ms 29944 KB Output is correct
127 Correct 61 ms 19396 KB Output is correct
128 Correct 72 ms 26552 KB Output is correct
129 Correct 185 ms 32340 KB Output is correct
130 Correct 68 ms 26308 KB Output is correct
131 Correct 75 ms 26308 KB Output is correct
132 Correct 143 ms 28244 KB Output is correct