oj.uz

답안 #988007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988007 2024-05-23T20:20:49 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 185 ms 46240 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)
{
    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;
}
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:122:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  122 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:148:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  148 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:158:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:166:15: warning: unused variable 'curr2' [-Wunused-variable]
  166 |     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 7 ms 5592 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 6 ms 5468 KB Output is correct
9 Correct 4 ms 5212 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 5464 KB Output is correct
13 Correct 5 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5208 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 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 5472 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 6 ms 5596 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 22964 KB Output is correct
2 Correct 64 ms 23740 KB Output is correct
3 Correct 76 ms 25808 KB Output is correct
4 Correct 65 ms 23716 KB Output is correct
5 Correct 55 ms 15652 KB Output is correct
6 Correct 55 ms 15468 KB Output is correct
7 Correct 64 ms 23472 KB Output is correct
8 Correct 58 ms 23456 KB Output is correct
9 Correct 12 ms 6492 KB Output is correct
10 Correct 63 ms 22848 KB Output is correct
11 Correct 12 ms 6488 KB Output is correct
12 Correct 28 ms 6616 KB Output is correct
13 Correct 67 ms 23540 KB Output is correct
14 Correct 65 ms 23764 KB Output is correct
15 Correct 16 ms 6804 KB Output is correct
16 Correct 62 ms 22456 KB Output is correct
17 Correct 65 ms 23740 KB Output is correct
18 Correct 20 ms 7132 KB Output is correct
19 Correct 64 ms 22992 KB Output is correct
20 Correct 61 ms 24248 KB Output is correct
21 Correct 13 ms 6744 KB Output is correct
22 Correct 61 ms 14024 KB Output is correct
23 Correct 58 ms 23212 KB Output is correct
24 Correct 19 ms 6748 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 52 ms 15548 KB Output is correct
27 Correct 61 ms 15544 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 7 ms 5592 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 6 ms 5468 KB Output is correct
9 Correct 4 ms 5212 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 5464 KB Output is correct
13 Correct 5 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5208 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 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 5472 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 6 ms 5596 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 64 ms 22964 KB Output is correct
30 Correct 64 ms 23740 KB Output is correct
31 Correct 76 ms 25808 KB Output is correct
32 Correct 65 ms 23716 KB Output is correct
33 Correct 55 ms 15652 KB Output is correct
34 Correct 55 ms 15468 KB Output is correct
35 Correct 64 ms 23472 KB Output is correct
36 Correct 58 ms 23456 KB Output is correct
37 Correct 12 ms 6492 KB Output is correct
38 Correct 63 ms 22848 KB Output is correct
39 Correct 12 ms 6488 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 67 ms 23540 KB Output is correct
42 Correct 65 ms 23764 KB Output is correct
43 Correct 16 ms 6804 KB Output is correct
44 Correct 62 ms 22456 KB Output is correct
45 Correct 65 ms 23740 KB Output is correct
46 Correct 20 ms 7132 KB Output is correct
47 Correct 64 ms 22992 KB Output is correct
48 Correct 61 ms 24248 KB Output is correct
49 Correct 13 ms 6744 KB Output is correct
50 Correct 61 ms 14024 KB Output is correct
51 Correct 58 ms 23212 KB Output is correct
52 Correct 19 ms 6748 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 52 ms 15548 KB Output is correct
55 Correct 61 ms 15544 KB Output is correct
56 Correct 137 ms 31288 KB Output is correct
57 Correct 158 ms 28684 KB Output is correct
58 Correct 136 ms 29704 KB Output is correct
59 Correct 130 ms 27616 KB Output is correct
60 Correct 138 ms 23568 KB Output is correct
61 Correct 129 ms 29476 KB Output is correct
62 Correct 121 ms 26348 KB Output is correct
63 Correct 111 ms 24516 KB Output is correct
64 Correct 58 ms 8868 KB Output is correct
65 Correct 129 ms 28736 KB Output is correct
66 Correct 60 ms 9428 KB Output is correct
67 Correct 50 ms 10180 KB Output is correct
68 Correct 77 ms 24240 KB Output is correct
69 Correct 146 ms 29488 KB Output is correct
70 Correct 15 ms 7004 KB Output is correct
71 Correct 77 ms 24536 KB Output is correct
72 Correct 123 ms 27372 KB Output is correct
73 Correct 14 ms 6748 KB Output is correct
74 Correct 66 ms 16820 KB Output is correct
75 Correct 163 ms 31824 KB Output is correct
76 Correct 13 ms 6488 KB Output is correct
77 Correct 65 ms 15308 KB Output is correct
78 Correct 103 ms 24748 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 8664 KB Output is correct
2 Correct 35 ms 6604 KB Output is correct
3 Correct 13 ms 5848 KB Output is correct
4 Correct 13 ms 6744 KB Output is correct
5 Correct 147 ms 30524 KB Output is correct
6 Correct 141 ms 29248 KB Output is correct
7 Correct 156 ms 30020 KB Output is correct
8 Correct 142 ms 28784 KB Output is correct
9 Correct 161 ms 30648 KB Output is correct
10 Correct 154 ms 29276 KB Output is correct
11 Correct 137 ms 27692 KB Output is correct
12 Correct 123 ms 27816 KB Output is correct
13 Correct 100 ms 11632 KB Output is correct
14 Correct 146 ms 29280 KB Output is correct
15 Correct 149 ms 29420 KB Output is correct
16 Correct 62 ms 15792 KB Output is correct
17 Correct 73 ms 24024 KB Output is correct
18 Correct 154 ms 29648 KB Output is correct
19 Correct 77 ms 24148 KB Output is correct
20 Correct 75 ms 23732 KB Output is correct
21 Correct 142 ms 28664 KB Output is correct
22 Correct 62 ms 15720 KB Output is correct
23 Correct 73 ms 23920 KB Output is correct
24 Correct 162 ms 30648 KB Output is correct
25 Correct 65 ms 24432 KB Output is correct
26 Correct 63 ms 24260 KB Output is correct
27 Correct 129 ms 27580 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 7 ms 5592 KB Output is correct
5 Correct 6 ms 6492 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 6 ms 5468 KB Output is correct
9 Correct 4 ms 5212 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 5464 KB Output is correct
13 Correct 5 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5208 KB Output is correct
16 Correct 5 ms 5468 KB Output is correct
17 Correct 5 ms 5592 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 5 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 5472 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 6 ms 5596 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 64 ms 22964 KB Output is correct
30 Correct 64 ms 23740 KB Output is correct
31 Correct 76 ms 25808 KB Output is correct
32 Correct 65 ms 23716 KB Output is correct
33 Correct 55 ms 15652 KB Output is correct
34 Correct 55 ms 15468 KB Output is correct
35 Correct 64 ms 23472 KB Output is correct
36 Correct 58 ms 23456 KB Output is correct
37 Correct 12 ms 6492 KB Output is correct
38 Correct 63 ms 22848 KB Output is correct
39 Correct 12 ms 6488 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 67 ms 23540 KB Output is correct
42 Correct 65 ms 23764 KB Output is correct
43 Correct 16 ms 6804 KB Output is correct
44 Correct 62 ms 22456 KB Output is correct
45 Correct 65 ms 23740 KB Output is correct
46 Correct 20 ms 7132 KB Output is correct
47 Correct 64 ms 22992 KB Output is correct
48 Correct 61 ms 24248 KB Output is correct
49 Correct 13 ms 6744 KB Output is correct
50 Correct 61 ms 14024 KB Output is correct
51 Correct 58 ms 23212 KB Output is correct
52 Correct 19 ms 6748 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 52 ms 15548 KB Output is correct
55 Correct 61 ms 15544 KB Output is correct
56 Correct 137 ms 31288 KB Output is correct
57 Correct 158 ms 28684 KB Output is correct
58 Correct 136 ms 29704 KB Output is correct
59 Correct 130 ms 27616 KB Output is correct
60 Correct 138 ms 23568 KB Output is correct
61 Correct 129 ms 29476 KB Output is correct
62 Correct 121 ms 26348 KB Output is correct
63 Correct 111 ms 24516 KB Output is correct
64 Correct 58 ms 8868 KB Output is correct
65 Correct 129 ms 28736 KB Output is correct
66 Correct 60 ms 9428 KB Output is correct
67 Correct 50 ms 10180 KB Output is correct
68 Correct 77 ms 24240 KB Output is correct
69 Correct 146 ms 29488 KB Output is correct
70 Correct 15 ms 7004 KB Output is correct
71 Correct 77 ms 24536 KB Output is correct
72 Correct 123 ms 27372 KB Output is correct
73 Correct 14 ms 6748 KB Output is correct
74 Correct 66 ms 16820 KB Output is correct
75 Correct 163 ms 31824 KB Output is correct
76 Correct 13 ms 6488 KB Output is correct
77 Correct 65 ms 15308 KB Output is correct
78 Correct 103 ms 24748 KB Output is correct
79 Correct 40 ms 8664 KB Output is correct
80 Correct 35 ms 6604 KB Output is correct
81 Correct 13 ms 5848 KB Output is correct
82 Correct 13 ms 6744 KB Output is correct
83 Correct 147 ms 30524 KB Output is correct
84 Correct 141 ms 29248 KB Output is correct
85 Correct 156 ms 30020 KB Output is correct
86 Correct 142 ms 28784 KB Output is correct
87 Correct 161 ms 30648 KB Output is correct
88 Correct 154 ms 29276 KB Output is correct
89 Correct 137 ms 27692 KB Output is correct
90 Correct 123 ms 27816 KB Output is correct
91 Correct 100 ms 11632 KB Output is correct
92 Correct 146 ms 29280 KB Output is correct
93 Correct 149 ms 29420 KB Output is correct
94 Correct 62 ms 15792 KB Output is correct
95 Correct 73 ms 24024 KB Output is correct
96 Correct 154 ms 29648 KB Output is correct
97 Correct 77 ms 24148 KB Output is correct
98 Correct 75 ms 23732 KB Output is correct
99 Correct 142 ms 28664 KB Output is correct
100 Correct 62 ms 15720 KB Output is correct
101 Correct 73 ms 23920 KB Output is correct
102 Correct 162 ms 30648 KB Output is correct
103 Correct 65 ms 24432 KB Output is correct
104 Correct 63 ms 24260 KB Output is correct
105 Correct 129 ms 27580 KB Output is correct
106 Correct 36 ms 7268 KB Output is correct
107 Correct 41 ms 7884 KB Output is correct
108 Correct 39 ms 6864 KB Output is correct
109 Correct 41 ms 7892 KB Output is correct
110 Correct 167 ms 31684 KB Output is correct
111 Correct 177 ms 30584 KB Output is correct
112 Correct 182 ms 30536 KB Output is correct
113 Correct 159 ms 29492 KB Output is correct
114 Correct 173 ms 31896 KB Output is correct
115 Correct 185 ms 30280 KB Output is correct
116 Correct 184 ms 46240 KB Output is correct
117 Correct 139 ms 27796 KB Output is correct
118 Correct 128 ms 13508 KB Output is correct
119 Correct 51 ms 9296 KB Output is correct
120 Correct 162 ms 29972 KB Output is correct
121 Correct 78 ms 24376 KB Output is correct
122 Correct 86 ms 24240 KB Output is correct
123 Correct 173 ms 30812 KB Output is correct
124 Correct 68 ms 16304 KB Output is correct
125 Correct 85 ms 23048 KB Output is correct
126 Correct 151 ms 32560 KB Output is correct
127 Correct 62 ms 14532 KB Output is correct
128 Correct 76 ms 23796 KB Output is correct
129 Correct 165 ms 34864 KB Output is correct
130 Correct 78 ms 23488 KB Output is correct
131 Correct 76 ms 23216 KB Output is correct
132 Correct 143 ms 30304 KB Output is correct