oj.uz

답안 #988010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988010 2024-05-23T20:24:51 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 211 ms 48524 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 6 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5088 KB Output is correct
10 Correct 6 ms 5592 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 6328 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 6 ms 5976 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5548 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5180 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 6076 KB Output is correct
25 Correct 6 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 23064 KB Output is correct
2 Correct 64 ms 22960 KB Output is correct
3 Correct 73 ms 23724 KB Output is correct
4 Correct 64 ms 23784 KB Output is correct
5 Correct 57 ms 15708 KB Output is correct
6 Correct 55 ms 15304 KB Output is correct
7 Correct 64 ms 23476 KB Output is correct
8 Correct 60 ms 23396 KB Output is correct
9 Correct 15 ms 5720 KB Output is correct
10 Correct 68 ms 22892 KB Output is correct
11 Correct 12 ms 6748 KB Output is correct
12 Correct 28 ms 6616 KB Output is correct
13 Correct 66 ms 22624 KB Output is correct
14 Correct 66 ms 22984 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 64 ms 22620 KB Output is correct
17 Correct 65 ms 22772 KB Output is correct
18 Correct 20 ms 6360 KB Output is correct
19 Correct 65 ms 22964 KB Output is correct
20 Correct 63 ms 24232 KB Output is correct
21 Correct 13 ms 6744 KB Output is correct
22 Correct 58 ms 14020 KB Output is correct
23 Correct 60 ms 22200 KB Output is correct
24 Correct 14 ms 5824 KB Output is correct
25 Correct 12 ms 5684 KB Output is correct
26 Correct 52 ms 14516 KB Output is correct
27 Correct 51 ms 15552 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5088 KB Output is correct
10 Correct 6 ms 5592 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 6328 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 6 ms 5976 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5548 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5180 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 6076 KB Output is correct
25 Correct 6 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct
29 Correct 62 ms 23064 KB Output is correct
30 Correct 64 ms 22960 KB Output is correct
31 Correct 73 ms 23724 KB Output is correct
32 Correct 64 ms 23784 KB Output is correct
33 Correct 57 ms 15708 KB Output is correct
34 Correct 55 ms 15304 KB Output is correct
35 Correct 64 ms 23476 KB Output is correct
36 Correct 60 ms 23396 KB Output is correct
37 Correct 15 ms 5720 KB Output is correct
38 Correct 68 ms 22892 KB Output is correct
39 Correct 12 ms 6748 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 66 ms 22624 KB Output is correct
42 Correct 66 ms 22984 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 64 ms 22620 KB Output is correct
45 Correct 65 ms 22772 KB Output is correct
46 Correct 20 ms 6360 KB Output is correct
47 Correct 65 ms 22964 KB Output is correct
48 Correct 63 ms 24232 KB Output is correct
49 Correct 13 ms 6744 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 60 ms 22200 KB Output is correct
52 Correct 14 ms 5824 KB Output is correct
53 Correct 12 ms 5684 KB Output is correct
54 Correct 52 ms 14516 KB Output is correct
55 Correct 51 ms 15552 KB Output is correct
56 Correct 146 ms 33696 KB Output is correct
57 Correct 140 ms 30908 KB Output is correct
58 Correct 136 ms 31900 KB Output is correct
59 Correct 126 ms 29492 KB Output is correct
60 Correct 157 ms 25908 KB Output is correct
61 Correct 131 ms 32192 KB Output is correct
62 Correct 125 ms 28176 KB Output is correct
63 Correct 109 ms 26380 KB Output is correct
64 Correct 55 ms 10700 KB Output is correct
65 Correct 145 ms 30584 KB Output is correct
66 Correct 51 ms 10324 KB Output is correct
67 Correct 52 ms 9160 KB Output is correct
68 Correct 82 ms 23472 KB Output is correct
69 Correct 140 ms 31276 KB Output is correct
70 Correct 14 ms 7204 KB Output is correct
71 Correct 77 ms 23652 KB Output is correct
72 Correct 129 ms 29480 KB Output is correct
73 Correct 12 ms 6748 KB Output is correct
74 Correct 68 ms 15788 KB Output is correct
75 Correct 162 ms 34140 KB Output is correct
76 Correct 12 ms 6492 KB Output is correct
77 Correct 60 ms 15308 KB Output is correct
78 Correct 108 ms 26700 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 8660 KB Output is correct
2 Correct 35 ms 6616 KB Output is correct
3 Correct 14 ms 5724 KB Output is correct
4 Correct 13 ms 5976 KB Output is correct
5 Correct 154 ms 32856 KB Output is correct
6 Correct 158 ms 31544 KB Output is correct
7 Correct 153 ms 32056 KB Output is correct
8 Correct 139 ms 31020 KB Output is correct
9 Correct 160 ms 33072 KB Output is correct
10 Correct 153 ms 31536 KB Output is correct
11 Correct 143 ms 29956 KB Output is correct
12 Correct 126 ms 30188 KB Output is correct
13 Correct 101 ms 13948 KB Output is correct
14 Correct 165 ms 31668 KB Output is correct
15 Correct 171 ms 31580 KB Output is correct
16 Correct 64 ms 15792 KB Output is correct
17 Correct 75 ms 23984 KB Output is correct
18 Correct 160 ms 31796 KB Output is correct
19 Correct 66 ms 24244 KB Output is correct
20 Correct 85 ms 23872 KB Output is correct
21 Correct 149 ms 31020 KB Output is correct
22 Correct 63 ms 15792 KB Output is correct
23 Correct 71 ms 24072 KB Output is correct
24 Correct 154 ms 33072 KB Output is correct
25 Correct 63 ms 23472 KB Output is correct
26 Correct 60 ms 23448 KB Output is correct
27 Correct 129 ms 30300 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5724 KB Output is correct
6 Correct 5 ms 5592 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5468 KB Output is correct
9 Correct 4 ms 5088 KB Output is correct
10 Correct 6 ms 5592 KB Output is correct
11 Correct 3 ms 5980 KB Output is correct
12 Correct 5 ms 6328 KB Output is correct
13 Correct 4 ms 6488 KB Output is correct
14 Correct 6 ms 5976 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 5 ms 5548 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 4 ms 5180 KB Output is correct
22 Correct 4 ms 5464 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 6076 KB Output is correct
25 Correct 6 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5592 KB Output is correct
28 Correct 5 ms 6492 KB Output is correct
29 Correct 62 ms 23064 KB Output is correct
30 Correct 64 ms 22960 KB Output is correct
31 Correct 73 ms 23724 KB Output is correct
32 Correct 64 ms 23784 KB Output is correct
33 Correct 57 ms 15708 KB Output is correct
34 Correct 55 ms 15304 KB Output is correct
35 Correct 64 ms 23476 KB Output is correct
36 Correct 60 ms 23396 KB Output is correct
37 Correct 15 ms 5720 KB Output is correct
38 Correct 68 ms 22892 KB Output is correct
39 Correct 12 ms 6748 KB Output is correct
40 Correct 28 ms 6616 KB Output is correct
41 Correct 66 ms 22624 KB Output is correct
42 Correct 66 ms 22984 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 64 ms 22620 KB Output is correct
45 Correct 65 ms 22772 KB Output is correct
46 Correct 20 ms 6360 KB Output is correct
47 Correct 65 ms 22964 KB Output is correct
48 Correct 63 ms 24232 KB Output is correct
49 Correct 13 ms 6744 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 60 ms 22200 KB Output is correct
52 Correct 14 ms 5824 KB Output is correct
53 Correct 12 ms 5684 KB Output is correct
54 Correct 52 ms 14516 KB Output is correct
55 Correct 51 ms 15552 KB Output is correct
56 Correct 146 ms 33696 KB Output is correct
57 Correct 140 ms 30908 KB Output is correct
58 Correct 136 ms 31900 KB Output is correct
59 Correct 126 ms 29492 KB Output is correct
60 Correct 157 ms 25908 KB Output is correct
61 Correct 131 ms 32192 KB Output is correct
62 Correct 125 ms 28176 KB Output is correct
63 Correct 109 ms 26380 KB Output is correct
64 Correct 55 ms 10700 KB Output is correct
65 Correct 145 ms 30584 KB Output is correct
66 Correct 51 ms 10324 KB Output is correct
67 Correct 52 ms 9160 KB Output is correct
68 Correct 82 ms 23472 KB Output is correct
69 Correct 140 ms 31276 KB Output is correct
70 Correct 14 ms 7204 KB Output is correct
71 Correct 77 ms 23652 KB Output is correct
72 Correct 129 ms 29480 KB Output is correct
73 Correct 12 ms 6748 KB Output is correct
74 Correct 68 ms 15788 KB Output is correct
75 Correct 162 ms 34140 KB Output is correct
76 Correct 12 ms 6492 KB Output is correct
77 Correct 60 ms 15308 KB Output is correct
78 Correct 108 ms 26700 KB Output is correct
79 Correct 40 ms 8660 KB Output is correct
80 Correct 35 ms 6616 KB Output is correct
81 Correct 14 ms 5724 KB Output is correct
82 Correct 13 ms 5976 KB Output is correct
83 Correct 154 ms 32856 KB Output is correct
84 Correct 158 ms 31544 KB Output is correct
85 Correct 153 ms 32056 KB Output is correct
86 Correct 139 ms 31020 KB Output is correct
87 Correct 160 ms 33072 KB Output is correct
88 Correct 153 ms 31536 KB Output is correct
89 Correct 143 ms 29956 KB Output is correct
90 Correct 126 ms 30188 KB Output is correct
91 Correct 101 ms 13948 KB Output is correct
92 Correct 165 ms 31668 KB Output is correct
93 Correct 171 ms 31580 KB Output is correct
94 Correct 64 ms 15792 KB Output is correct
95 Correct 75 ms 23984 KB Output is correct
96 Correct 160 ms 31796 KB Output is correct
97 Correct 66 ms 24244 KB Output is correct
98 Correct 85 ms 23872 KB Output is correct
99 Correct 149 ms 31020 KB Output is correct
100 Correct 63 ms 15792 KB Output is correct
101 Correct 71 ms 24072 KB Output is correct
102 Correct 154 ms 33072 KB Output is correct
103 Correct 63 ms 23472 KB Output is correct
104 Correct 60 ms 23448 KB Output is correct
105 Correct 129 ms 30300 KB Output is correct
106 Correct 41 ms 7616 KB Output is correct
107 Correct 42 ms 7880 KB Output is correct
108 Correct 43 ms 6956 KB Output is correct
109 Correct 42 ms 7876 KB Output is correct
110 Correct 169 ms 33884 KB Output is correct
111 Correct 160 ms 33056 KB Output is correct
112 Correct 211 ms 32868 KB Output is correct
113 Correct 155 ms 31788 KB Output is correct
114 Correct 161 ms 34108 KB Output is correct
115 Correct 177 ms 32700 KB Output is correct
116 Correct 188 ms 48524 KB Output is correct
117 Correct 140 ms 30128 KB Output is correct
118 Correct 111 ms 15824 KB Output is correct
119 Correct 61 ms 11616 KB Output is correct
120 Correct 161 ms 32320 KB Output is correct
121 Correct 71 ms 24500 KB Output is correct
122 Correct 80 ms 24244 KB Output is correct
123 Correct 174 ms 32960 KB Output is correct
124 Correct 66 ms 16388 KB Output is correct
125 Correct 83 ms 23936 KB Output is correct
126 Correct 151 ms 32256 KB Output is correct
127 Correct 61 ms 15556 KB Output is correct
128 Correct 72 ms 24564 KB Output is correct
129 Correct 176 ms 34748 KB Output is correct
130 Correct 87 ms 24304 KB Output is correct
131 Correct 81 ms 24160 KB Output is correct
132 Correct 140 ms 29996 KB Output is correct