oj.uz

답안 #988023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988023 2024-05-23T20:35:21 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 204 ms 48584 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
int inf=1000000007;
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];
int ord[200005];
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[i-1]=i;
    }
    sort(ord,ord+m,cmp2);
    m--;
    for(i=0; i<=m; 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:119:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  119 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:139:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:145:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  145 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:163:15: warning: unused variable 'curr2' [-Wunused-variable]
  163 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 6 ms 5692 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 6 ms 5692 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5464 KB Output is correct
14 Correct 7 ms 5724 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5648 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5720 KB Output is correct
21 Correct 3 ms 5168 KB Output is correct
22 Correct 3 ms 5468 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 5 ms 5604 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 23000 KB Output is correct
2 Correct 66 ms 22964 KB Output is correct
3 Correct 73 ms 23152 KB Output is correct
4 Correct 65 ms 23108 KB Output is correct
5 Correct 56 ms 14760 KB Output is correct
6 Correct 56 ms 14516 KB Output is correct
7 Correct 74 ms 22716 KB Output is correct
8 Correct 60 ms 22504 KB Output is correct
9 Correct 15 ms 5720 KB Output is correct
10 Correct 67 ms 22960 KB Output is correct
11 Correct 17 ms 5724 KB Output is correct
12 Correct 28 ms 6608 KB Output is correct
13 Correct 66 ms 22704 KB Output is correct
14 Correct 71 ms 22968 KB Output is correct
15 Correct 18 ms 5816 KB Output is correct
16 Correct 69 ms 22460 KB Output is correct
17 Correct 65 ms 22768 KB Output is correct
18 Correct 27 ms 6360 KB Output is correct
19 Correct 70 ms 22968 KB Output is correct
20 Correct 66 ms 23276 KB Output is correct
21 Correct 16 ms 5720 KB Output is correct
22 Correct 65 ms 14024 KB Output is correct
23 Correct 61 ms 22192 KB Output is correct
24 Correct 13 ms 5720 KB Output is correct
25 Correct 14 ms 5724 KB Output is correct
26 Correct 52 ms 14528 KB Output is correct
27 Correct 54 ms 14532 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 6 ms 5692 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 6 ms 5692 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5464 KB Output is correct
14 Correct 7 ms 5724 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5648 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5720 KB Output is correct
21 Correct 3 ms 5168 KB Output is correct
22 Correct 3 ms 5468 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 5 ms 5604 KB Output is correct
29 Correct 65 ms 23000 KB Output is correct
30 Correct 66 ms 22964 KB Output is correct
31 Correct 73 ms 23152 KB Output is correct
32 Correct 65 ms 23108 KB Output is correct
33 Correct 56 ms 14760 KB Output is correct
34 Correct 56 ms 14516 KB Output is correct
35 Correct 74 ms 22716 KB Output is correct
36 Correct 60 ms 22504 KB Output is correct
37 Correct 15 ms 5720 KB Output is correct
38 Correct 67 ms 22960 KB Output is correct
39 Correct 17 ms 5724 KB Output is correct
40 Correct 28 ms 6608 KB Output is correct
41 Correct 66 ms 22704 KB Output is correct
42 Correct 71 ms 22968 KB Output is correct
43 Correct 18 ms 5816 KB Output is correct
44 Correct 69 ms 22460 KB Output is correct
45 Correct 65 ms 22768 KB Output is correct
46 Correct 27 ms 6360 KB Output is correct
47 Correct 70 ms 22968 KB Output is correct
48 Correct 66 ms 23276 KB Output is correct
49 Correct 16 ms 5720 KB Output is correct
50 Correct 65 ms 14024 KB Output is correct
51 Correct 61 ms 22192 KB Output is correct
52 Correct 13 ms 5720 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 52 ms 14528 KB Output is correct
55 Correct 54 ms 14532 KB Output is correct
56 Correct 165 ms 33412 KB Output is correct
57 Correct 157 ms 30092 KB Output is correct
58 Correct 139 ms 31400 KB Output is correct
59 Correct 126 ms 29096 KB Output is correct
60 Correct 164 ms 25768 KB Output is correct
61 Correct 134 ms 31256 KB Output is correct
62 Correct 132 ms 27288 KB Output is correct
63 Correct 112 ms 25228 KB Output is correct
64 Correct 55 ms 9444 KB Output is correct
65 Correct 155 ms 29256 KB Output is correct
66 Correct 54 ms 8444 KB Output is correct
67 Correct 51 ms 9160 KB Output is correct
68 Correct 76 ms 23576 KB Output is correct
69 Correct 140 ms 28840 KB Output is correct
70 Correct 17 ms 5976 KB Output is correct
71 Correct 82 ms 23472 KB Output is correct
72 Correct 124 ms 26796 KB Output is correct
73 Correct 18 ms 5720 KB Output is correct
74 Correct 67 ms 15888 KB Output is correct
75 Correct 148 ms 31404 KB Output is correct
76 Correct 16 ms 5724 KB Output is correct
77 Correct 65 ms 14524 KB Output is correct
78 Correct 107 ms 24024 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7636 KB Output is correct
2 Correct 44 ms 6608 KB Output is correct
3 Correct 16 ms 5724 KB Output is correct
4 Correct 16 ms 5980 KB Output is correct
5 Correct 152 ms 30648 KB Output is correct
6 Correct 151 ms 29264 KB Output is correct
7 Correct 145 ms 29864 KB Output is correct
8 Correct 148 ms 29044 KB Output is correct
9 Correct 146 ms 30720 KB Output is correct
10 Correct 155 ms 29128 KB Output is correct
11 Correct 148 ms 27828 KB Output is correct
12 Correct 122 ms 27048 KB Output is correct
13 Correct 103 ms 11532 KB Output is correct
14 Correct 154 ms 29240 KB Output is correct
15 Correct 145 ms 29372 KB Output is correct
16 Correct 62 ms 15024 KB Output is correct
17 Correct 98 ms 22960 KB Output is correct
18 Correct 152 ms 29468 KB Output is correct
19 Correct 67 ms 23216 KB Output is correct
20 Correct 75 ms 22904 KB Output is correct
21 Correct 141 ms 28588 KB Output is correct
22 Correct 62 ms 14960 KB Output is correct
23 Correct 72 ms 22956 KB Output is correct
24 Correct 162 ms 30720 KB Output is correct
25 Correct 70 ms 23476 KB Output is correct
26 Correct 62 ms 23480 KB Output is correct
27 Correct 128 ms 26772 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 6 ms 5692 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 6 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 4 ms 5224 KB Output is correct
10 Correct 6 ms 5692 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5464 KB Output is correct
14 Correct 7 ms 5724 KB Output is correct
15 Correct 5 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5648 KB Output is correct
18 Correct 5 ms 5212 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 6 ms 5720 KB Output is correct
21 Correct 3 ms 5168 KB Output is correct
22 Correct 3 ms 5468 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 6 ms 5592 KB Output is correct
28 Correct 5 ms 5604 KB Output is correct
29 Correct 65 ms 23000 KB Output is correct
30 Correct 66 ms 22964 KB Output is correct
31 Correct 73 ms 23152 KB Output is correct
32 Correct 65 ms 23108 KB Output is correct
33 Correct 56 ms 14760 KB Output is correct
34 Correct 56 ms 14516 KB Output is correct
35 Correct 74 ms 22716 KB Output is correct
36 Correct 60 ms 22504 KB Output is correct
37 Correct 15 ms 5720 KB Output is correct
38 Correct 67 ms 22960 KB Output is correct
39 Correct 17 ms 5724 KB Output is correct
40 Correct 28 ms 6608 KB Output is correct
41 Correct 66 ms 22704 KB Output is correct
42 Correct 71 ms 22968 KB Output is correct
43 Correct 18 ms 5816 KB Output is correct
44 Correct 69 ms 22460 KB Output is correct
45 Correct 65 ms 22768 KB Output is correct
46 Correct 27 ms 6360 KB Output is correct
47 Correct 70 ms 22968 KB Output is correct
48 Correct 66 ms 23276 KB Output is correct
49 Correct 16 ms 5720 KB Output is correct
50 Correct 65 ms 14024 KB Output is correct
51 Correct 61 ms 22192 KB Output is correct
52 Correct 13 ms 5720 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 52 ms 14528 KB Output is correct
55 Correct 54 ms 14532 KB Output is correct
56 Correct 165 ms 33412 KB Output is correct
57 Correct 157 ms 30092 KB Output is correct
58 Correct 139 ms 31400 KB Output is correct
59 Correct 126 ms 29096 KB Output is correct
60 Correct 164 ms 25768 KB Output is correct
61 Correct 134 ms 31256 KB Output is correct
62 Correct 132 ms 27288 KB Output is correct
63 Correct 112 ms 25228 KB Output is correct
64 Correct 55 ms 9444 KB Output is correct
65 Correct 155 ms 29256 KB Output is correct
66 Correct 54 ms 8444 KB Output is correct
67 Correct 51 ms 9160 KB Output is correct
68 Correct 76 ms 23576 KB Output is correct
69 Correct 140 ms 28840 KB Output is correct
70 Correct 17 ms 5976 KB Output is correct
71 Correct 82 ms 23472 KB Output is correct
72 Correct 124 ms 26796 KB Output is correct
73 Correct 18 ms 5720 KB Output is correct
74 Correct 67 ms 15888 KB Output is correct
75 Correct 148 ms 31404 KB Output is correct
76 Correct 16 ms 5724 KB Output is correct
77 Correct 65 ms 14524 KB Output is correct
78 Correct 107 ms 24024 KB Output is correct
79 Correct 40 ms 7636 KB Output is correct
80 Correct 44 ms 6608 KB Output is correct
81 Correct 16 ms 5724 KB Output is correct
82 Correct 16 ms 5980 KB Output is correct
83 Correct 152 ms 30648 KB Output is correct
84 Correct 151 ms 29264 KB Output is correct
85 Correct 145 ms 29864 KB Output is correct
86 Correct 148 ms 29044 KB Output is correct
87 Correct 146 ms 30720 KB Output is correct
88 Correct 155 ms 29128 KB Output is correct
89 Correct 148 ms 27828 KB Output is correct
90 Correct 122 ms 27048 KB Output is correct
91 Correct 103 ms 11532 KB Output is correct
92 Correct 154 ms 29240 KB Output is correct
93 Correct 145 ms 29372 KB Output is correct
94 Correct 62 ms 15024 KB Output is correct
95 Correct 98 ms 22960 KB Output is correct
96 Correct 152 ms 29468 KB Output is correct
97 Correct 67 ms 23216 KB Output is correct
98 Correct 75 ms 22904 KB Output is correct
99 Correct 141 ms 28588 KB Output is correct
100 Correct 62 ms 14960 KB Output is correct
101 Correct 72 ms 22956 KB Output is correct
102 Correct 162 ms 30720 KB Output is correct
103 Correct 70 ms 23476 KB Output is correct
104 Correct 62 ms 23480 KB Output is correct
105 Correct 128 ms 26772 KB Output is correct
106 Correct 37 ms 6364 KB Output is correct
107 Correct 43 ms 7892 KB Output is correct
108 Correct 39 ms 6864 KB Output is correct
109 Correct 41 ms 7880 KB Output is correct
110 Correct 190 ms 31504 KB Output is correct
111 Correct 181 ms 33244 KB Output is correct
112 Correct 188 ms 33236 KB Output is correct
113 Correct 156 ms 31912 KB Output is correct
114 Correct 174 ms 34172 KB Output is correct
115 Correct 160 ms 32696 KB Output is correct
116 Correct 182 ms 48584 KB Output is correct
117 Correct 152 ms 30236 KB Output is correct
118 Correct 119 ms 16212 KB Output is correct
119 Correct 53 ms 10324 KB Output is correct
120 Correct 193 ms 32440 KB Output is correct
121 Correct 73 ms 23468 KB Output is correct
122 Correct 83 ms 23484 KB Output is correct
123 Correct 174 ms 32940 KB Output is correct
124 Correct 67 ms 15540 KB Output is correct
125 Correct 86 ms 23228 KB Output is correct
126 Correct 151 ms 32440 KB Output is correct
127 Correct 65 ms 14708 KB Output is correct
128 Correct 79 ms 23800 KB Output is correct
129 Correct 204 ms 34728 KB Output is correct
130 Correct 81 ms 23784 KB Output is correct
131 Correct 79 ms 23228 KB Output is correct
132 Correct 143 ms 30156 KB Output is correct