oj.uz

답안 #987986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987986 2024-05-23T20:07:32 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 204 ms 46248 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=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)
{
    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,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: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:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |                 for(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 5 ms 8540 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 ms 8552 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8280 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 7 ms 5592 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5564 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8176 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 26040 KB Output is correct
2 Correct 62 ms 25900 KB Output is correct
3 Correct 63 ms 25796 KB Output is correct
4 Correct 61 ms 25780 KB Output is correct
5 Correct 58 ms 15536 KB Output is correct
6 Correct 55 ms 17460 KB Output is correct
7 Correct 64 ms 25516 KB Output is correct
8 Correct 59 ms 25392 KB Output is correct
9 Correct 18 ms 8536 KB Output is correct
10 Correct 62 ms 25768 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 27 ms 9684 KB Output is correct
13 Correct 66 ms 25664 KB Output is correct
14 Correct 64 ms 25780 KB Output is correct
15 Correct 12 ms 8796 KB Output is correct
16 Correct 63 ms 25400 KB Output is correct
17 Correct 65 ms 25776 KB Output is correct
18 Correct 20 ms 9300 KB Output is correct
19 Correct 63 ms 25780 KB Output is correct
20 Correct 60 ms 26292 KB Output is correct
21 Correct 16 ms 8724 KB Output is correct
22 Correct 66 ms 16860 KB Output is correct
23 Correct 58 ms 25272 KB Output is correct
24 Correct 13 ms 8540 KB Output is correct
25 Correct 12 ms 8536 KB Output is correct
26 Correct 51 ms 17572 KB Output is correct
27 Correct 50 ms 17596 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 ms 8552 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8280 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 7 ms 5592 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5564 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8176 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 69 ms 26040 KB Output is correct
30 Correct 62 ms 25900 KB Output is correct
31 Correct 63 ms 25796 KB Output is correct
32 Correct 61 ms 25780 KB Output is correct
33 Correct 58 ms 15536 KB Output is correct
34 Correct 55 ms 17460 KB Output is correct
35 Correct 64 ms 25516 KB Output is correct
36 Correct 59 ms 25392 KB Output is correct
37 Correct 18 ms 8536 KB Output is correct
38 Correct 62 ms 25768 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 9684 KB Output is correct
41 Correct 66 ms 25664 KB Output is correct
42 Correct 64 ms 25780 KB Output is correct
43 Correct 12 ms 8796 KB Output is correct
44 Correct 63 ms 25400 KB Output is correct
45 Correct 65 ms 25776 KB Output is correct
46 Correct 20 ms 9300 KB Output is correct
47 Correct 63 ms 25780 KB Output is correct
48 Correct 60 ms 26292 KB Output is correct
49 Correct 16 ms 8724 KB Output is correct
50 Correct 66 ms 16860 KB Output is correct
51 Correct 58 ms 25272 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8536 KB Output is correct
54 Correct 51 ms 17572 KB Output is correct
55 Correct 50 ms 17596 KB Output is correct
56 Correct 150 ms 32100 KB Output is correct
57 Correct 129 ms 29896 KB Output is correct
58 Correct 139 ms 30772 KB Output is correct
59 Correct 125 ms 29244 KB Output is correct
60 Correct 156 ms 24240 KB Output is correct
61 Correct 136 ms 28952 KB Output is correct
62 Correct 135 ms 26296 KB Output is correct
63 Correct 105 ms 24564 KB Output is correct
64 Correct 54 ms 8908 KB Output is correct
65 Correct 140 ms 30132 KB Output is correct
66 Correct 65 ms 11440 KB Output is correct
67 Correct 52 ms 10096 KB Output is correct
68 Correct 83 ms 23432 KB Output is correct
69 Correct 179 ms 29488 KB Output is correct
70 Correct 16 ms 7004 KB Output is correct
71 Correct 84 ms 24376 KB Output is correct
72 Correct 130 ms 28476 KB Output is correct
73 Correct 13 ms 5824 KB Output is correct
74 Correct 80 ms 18680 KB Output is correct
75 Correct 156 ms 32312 KB Output is correct
76 Correct 13 ms 5636 KB Output is correct
77 Correct 63 ms 15300 KB Output is correct
78 Correct 123 ms 23800 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 10708 KB Output is correct
2 Correct 36 ms 6652 KB Output is correct
3 Correct 14 ms 6552 KB Output is correct
4 Correct 13 ms 6744 KB Output is correct
5 Correct 167 ms 30748 KB Output is correct
6 Correct 182 ms 29424 KB Output is correct
7 Correct 153 ms 29892 KB Output is correct
8 Correct 154 ms 28904 KB Output is correct
9 Correct 197 ms 30640 KB Output is correct
10 Correct 171 ms 29168 KB Output is correct
11 Correct 143 ms 27712 KB Output is correct
12 Correct 152 ms 28652 KB Output is correct
13 Correct 102 ms 11596 KB Output is correct
14 Correct 157 ms 29312 KB Output is correct
15 Correct 156 ms 29376 KB Output is correct
16 Correct 84 ms 15796 KB Output is correct
17 Correct 74 ms 22960 KB Output is correct
18 Correct 162 ms 29760 KB Output is correct
19 Correct 90 ms 24880 KB Output is correct
20 Correct 94 ms 25420 KB Output is correct
21 Correct 178 ms 28780 KB Output is correct
22 Correct 80 ms 15792 KB Output is correct
23 Correct 86 ms 25896 KB Output is correct
24 Correct 178 ms 30628 KB Output is correct
25 Correct 75 ms 26368 KB Output is correct
26 Correct 70 ms 26252 KB Output is correct
27 Correct 130 ms 27452 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 ms 6492 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 ms 8552 KB Output is correct
8 Correct 4 ms 8536 KB Output is correct
9 Correct 3 ms 8280 KB Output is correct
10 Correct 6 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 7 ms 5592 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5564 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8176 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 5 ms 8540 KB Output is correct
29 Correct 69 ms 26040 KB Output is correct
30 Correct 62 ms 25900 KB Output is correct
31 Correct 63 ms 25796 KB Output is correct
32 Correct 61 ms 25780 KB Output is correct
33 Correct 58 ms 15536 KB Output is correct
34 Correct 55 ms 17460 KB Output is correct
35 Correct 64 ms 25516 KB Output is correct
36 Correct 59 ms 25392 KB Output is correct
37 Correct 18 ms 8536 KB Output is correct
38 Correct 62 ms 25768 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 9684 KB Output is correct
41 Correct 66 ms 25664 KB Output is correct
42 Correct 64 ms 25780 KB Output is correct
43 Correct 12 ms 8796 KB Output is correct
44 Correct 63 ms 25400 KB Output is correct
45 Correct 65 ms 25776 KB Output is correct
46 Correct 20 ms 9300 KB Output is correct
47 Correct 63 ms 25780 KB Output is correct
48 Correct 60 ms 26292 KB Output is correct
49 Correct 16 ms 8724 KB Output is correct
50 Correct 66 ms 16860 KB Output is correct
51 Correct 58 ms 25272 KB Output is correct
52 Correct 13 ms 8540 KB Output is correct
53 Correct 12 ms 8536 KB Output is correct
54 Correct 51 ms 17572 KB Output is correct
55 Correct 50 ms 17596 KB Output is correct
56 Correct 150 ms 32100 KB Output is correct
57 Correct 129 ms 29896 KB Output is correct
58 Correct 139 ms 30772 KB Output is correct
59 Correct 125 ms 29244 KB Output is correct
60 Correct 156 ms 24240 KB Output is correct
61 Correct 136 ms 28952 KB Output is correct
62 Correct 135 ms 26296 KB Output is correct
63 Correct 105 ms 24564 KB Output is correct
64 Correct 54 ms 8908 KB Output is correct
65 Correct 140 ms 30132 KB Output is correct
66 Correct 65 ms 11440 KB Output is correct
67 Correct 52 ms 10096 KB Output is correct
68 Correct 83 ms 23432 KB Output is correct
69 Correct 179 ms 29488 KB Output is correct
70 Correct 16 ms 7004 KB Output is correct
71 Correct 84 ms 24376 KB Output is correct
72 Correct 130 ms 28476 KB Output is correct
73 Correct 13 ms 5824 KB Output is correct
74 Correct 80 ms 18680 KB Output is correct
75 Correct 156 ms 32312 KB Output is correct
76 Correct 13 ms 5636 KB Output is correct
77 Correct 63 ms 15300 KB Output is correct
78 Correct 123 ms 23800 KB Output is correct
79 Correct 41 ms 10708 KB Output is correct
80 Correct 36 ms 6652 KB Output is correct
81 Correct 14 ms 6552 KB Output is correct
82 Correct 13 ms 6744 KB Output is correct
83 Correct 167 ms 30748 KB Output is correct
84 Correct 182 ms 29424 KB Output is correct
85 Correct 153 ms 29892 KB Output is correct
86 Correct 154 ms 28904 KB Output is correct
87 Correct 197 ms 30640 KB Output is correct
88 Correct 171 ms 29168 KB Output is correct
89 Correct 143 ms 27712 KB Output is correct
90 Correct 152 ms 28652 KB Output is correct
91 Correct 102 ms 11596 KB Output is correct
92 Correct 157 ms 29312 KB Output is correct
93 Correct 156 ms 29376 KB Output is correct
94 Correct 84 ms 15796 KB Output is correct
95 Correct 74 ms 22960 KB Output is correct
96 Correct 162 ms 29760 KB Output is correct
97 Correct 90 ms 24880 KB Output is correct
98 Correct 94 ms 25420 KB Output is correct
99 Correct 178 ms 28780 KB Output is correct
100 Correct 80 ms 15792 KB Output is correct
101 Correct 86 ms 25896 KB Output is correct
102 Correct 178 ms 30628 KB Output is correct
103 Correct 75 ms 26368 KB Output is correct
104 Correct 70 ms 26252 KB Output is correct
105 Correct 130 ms 27452 KB Output is correct
106 Correct 36 ms 7388 KB Output is correct
107 Correct 42 ms 8904 KB Output is correct
108 Correct 39 ms 6796 KB Output is correct
109 Correct 53 ms 7768 KB Output is correct
110 Correct 187 ms 31516 KB Output is correct
111 Correct 178 ms 30600 KB Output is correct
112 Correct 204 ms 30640 KB Output is correct
113 Correct 203 ms 30328 KB Output is correct
114 Correct 194 ms 31884 KB Output is correct
115 Correct 158 ms 30276 KB Output is correct
116 Correct 194 ms 46248 KB Output is correct
117 Correct 145 ms 28204 KB Output is correct
118 Correct 115 ms 14296 KB Output is correct
119 Correct 95 ms 11436 KB Output is correct
120 Correct 184 ms 30332 KB Output is correct
121 Correct 82 ms 26292 KB Output is correct
122 Correct 80 ms 26260 KB Output is correct
123 Correct 190 ms 30756 KB Output is correct
124 Correct 66 ms 15384 KB Output is correct
125 Correct 95 ms 23100 KB Output is correct
126 Correct 172 ms 30064 KB Output is correct
127 Correct 69 ms 15556 KB Output is correct
128 Correct 77 ms 24572 KB Output is correct
129 Correct 162 ms 32320 KB Output is correct
130 Correct 76 ms 26296 KB Output is correct
131 Correct 83 ms 24300 KB Output is correct
132 Correct 174 ms 28220 KB Output is correct