oj.uz

답안 #988044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988044 2024-05-23T20:58:10 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++11
25 / 25
 204 ms 48492 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;
void 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;
    pq.push(curr);
}
void 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)
        {special(curr);
        return;
        }
    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];
    pq.push(curr);
}
void godown(node curr)
{
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g2]==0)
         {special(curr);return;}
    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];
    pq.push(curr);
}
void shift(node curr)
{
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    pq.push(curr);
}
void 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];
    pq.push(curr);
}
void fixborderandcreate(node curr)
{
    g=ord[curr.layer];
    curr.rghtbord=curr.lst-1;
    curr.lst=0;
    curr.biti++;
    curr.sum+=init[g];
    pq.push(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)
               skip(curr);
            else if(curr.lst==x[g3] && curr.bitipref==x[g3]-1 && curr.biti==x[g3] && curr.layer+1<=m)
                skip(curr);
            if(curr.lst+1<=curr.rghtbord)
                shift(curr);
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
                fixborderandshift(curr);
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g3])
                fixborderandcreate(curr);
            if(curr.layer+1<=m)
                godown(curr);
        }
    }
    while(k--)
        cout<<-1<<'\n';
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:121:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  121 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:141:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:147:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  147 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:165:15: warning: unused variable 'curr2' [-Wunused-variable]
  165 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5724 KB Output is correct
2 Correct 6 ms 5748 KB Output is correct
3 Correct 5 ms 5720 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 6 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5464 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 6 ms 5468 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 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5644 KB Output is correct
27 Correct 6 ms 5844 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 22976 KB Output is correct
2 Correct 64 ms 22968 KB Output is correct
3 Correct 68 ms 22964 KB Output is correct
4 Correct 63 ms 22964 KB Output is correct
5 Correct 59 ms 14768 KB Output is correct
6 Correct 53 ms 14548 KB Output is correct
7 Correct 67 ms 22736 KB Output is correct
8 Correct 59 ms 22456 KB Output is correct
9 Correct 13 ms 5728 KB Output is correct
10 Correct 63 ms 22932 KB Output is correct
11 Correct 13 ms 5724 KB Output is correct
12 Correct 28 ms 6608 KB Output is correct
13 Correct 64 ms 22712 KB Output is correct
14 Correct 79 ms 23216 KB Output is correct
15 Correct 15 ms 5720 KB Output is correct
16 Correct 62 ms 22508 KB Output is correct
17 Correct 62 ms 22960 KB Output is correct
18 Correct 21 ms 6364 KB Output is correct
19 Correct 62 ms 22964 KB Output is correct
20 Correct 64 ms 23464 KB Output is correct
21 Correct 16 ms 5724 KB Output is correct
22 Correct 58 ms 14020 KB Output is correct
23 Correct 63 ms 22196 KB Output is correct
24 Correct 15 ms 5720 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 50 ms 14536 KB Output is correct
27 Correct 49 ms 14520 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 5748 KB Output is correct
3 Correct 5 ms 5720 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 6 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5464 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 6 ms 5468 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 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5644 KB Output is correct
27 Correct 6 ms 5844 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 61 ms 22976 KB Output is correct
30 Correct 64 ms 22968 KB Output is correct
31 Correct 68 ms 22964 KB Output is correct
32 Correct 63 ms 22964 KB Output is correct
33 Correct 59 ms 14768 KB Output is correct
34 Correct 53 ms 14548 KB Output is correct
35 Correct 67 ms 22736 KB Output is correct
36 Correct 59 ms 22456 KB Output is correct
37 Correct 13 ms 5728 KB Output is correct
38 Correct 63 ms 22932 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 28 ms 6608 KB Output is correct
41 Correct 64 ms 22712 KB Output is correct
42 Correct 79 ms 23216 KB Output is correct
43 Correct 15 ms 5720 KB Output is correct
44 Correct 62 ms 22508 KB Output is correct
45 Correct 62 ms 22960 KB Output is correct
46 Correct 21 ms 6364 KB Output is correct
47 Correct 62 ms 22964 KB Output is correct
48 Correct 64 ms 23464 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 63 ms 22196 KB Output is correct
52 Correct 15 ms 5720 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 50 ms 14536 KB Output is correct
55 Correct 49 ms 14520 KB Output is correct
56 Correct 147 ms 33016 KB Output is correct
57 Correct 132 ms 30064 KB Output is correct
58 Correct 146 ms 31244 KB Output is correct
59 Correct 133 ms 28712 KB Output is correct
60 Correct 143 ms 25256 KB Output is correct
61 Correct 138 ms 31372 KB Output is correct
62 Correct 151 ms 27136 KB Output is correct
63 Correct 108 ms 25108 KB Output is correct
64 Correct 60 ms 9420 KB Output is correct
65 Correct 129 ms 30172 KB Output is correct
66 Correct 50 ms 10244 KB Output is correct
67 Correct 49 ms 9348 KB Output is correct
68 Correct 83 ms 23432 KB Output is correct
69 Correct 143 ms 30884 KB Output is correct
70 Correct 14 ms 5924 KB Output is correct
71 Correct 73 ms 23472 KB Output is correct
72 Correct 133 ms 28464 KB Output is correct
73 Correct 13 ms 5724 KB Output is correct
74 Correct 66 ms 15924 KB Output is correct
75 Correct 150 ms 33252 KB Output is correct
76 Correct 12 ms 5720 KB Output is correct
77 Correct 61 ms 14424 KB Output is correct
78 Correct 110 ms 25436 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 7632 KB Output is correct
2 Correct 35 ms 6600 KB Output is correct
3 Correct 15 ms 5724 KB Output is correct
4 Correct 14 ms 5980 KB Output is correct
5 Correct 159 ms 32944 KB Output is correct
6 Correct 148 ms 31600 KB Output is correct
7 Correct 153 ms 32088 KB Output is correct
8 Correct 167 ms 31064 KB Output is correct
9 Correct 158 ms 32976 KB Output is correct
10 Correct 153 ms 31580 KB Output is correct
11 Correct 145 ms 30140 KB Output is correct
12 Correct 124 ms 29352 KB Output is correct
13 Correct 112 ms 14028 KB Output is correct
14 Correct 187 ms 31924 KB Output is correct
15 Correct 147 ms 31664 KB Output is correct
16 Correct 62 ms 15032 KB Output is correct
17 Correct 80 ms 23200 KB Output is correct
18 Correct 165 ms 31900 KB Output is correct
19 Correct 73 ms 23220 KB Output is correct
20 Correct 72 ms 23096 KB Output is correct
21 Correct 160 ms 31076 KB Output is correct
22 Correct 60 ms 14772 KB Output is correct
23 Correct 70 ms 23212 KB Output is correct
24 Correct 159 ms 32964 KB Output is correct
25 Correct 61 ms 23472 KB Output is correct
26 Correct 60 ms 23356 KB Output is correct
27 Correct 133 ms 29056 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 5748 KB Output is correct
3 Correct 5 ms 5720 KB Output is correct
4 Correct 5 ms 5592 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 6 ms 5720 KB Output is correct
7 Correct 5 ms 5588 KB Output is correct
8 Correct 4 ms 5464 KB Output is correct
9 Correct 4 ms 5212 KB Output is correct
10 Correct 6 ms 5708 KB Output is correct
11 Correct 4 ms 5208 KB Output is correct
12 Correct 5 ms 5212 KB Output is correct
13 Correct 5 ms 5468 KB Output is correct
14 Correct 5 ms 5724 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 5 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 6 ms 5468 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 5592 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 5 ms 5212 KB Output is correct
26 Correct 6 ms 5644 KB Output is correct
27 Correct 6 ms 5844 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 61 ms 22976 KB Output is correct
30 Correct 64 ms 22968 KB Output is correct
31 Correct 68 ms 22964 KB Output is correct
32 Correct 63 ms 22964 KB Output is correct
33 Correct 59 ms 14768 KB Output is correct
34 Correct 53 ms 14548 KB Output is correct
35 Correct 67 ms 22736 KB Output is correct
36 Correct 59 ms 22456 KB Output is correct
37 Correct 13 ms 5728 KB Output is correct
38 Correct 63 ms 22932 KB Output is correct
39 Correct 13 ms 5724 KB Output is correct
40 Correct 28 ms 6608 KB Output is correct
41 Correct 64 ms 22712 KB Output is correct
42 Correct 79 ms 23216 KB Output is correct
43 Correct 15 ms 5720 KB Output is correct
44 Correct 62 ms 22508 KB Output is correct
45 Correct 62 ms 22960 KB Output is correct
46 Correct 21 ms 6364 KB Output is correct
47 Correct 62 ms 22964 KB Output is correct
48 Correct 64 ms 23464 KB Output is correct
49 Correct 16 ms 5724 KB Output is correct
50 Correct 58 ms 14020 KB Output is correct
51 Correct 63 ms 22196 KB Output is correct
52 Correct 15 ms 5720 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 50 ms 14536 KB Output is correct
55 Correct 49 ms 14520 KB Output is correct
56 Correct 147 ms 33016 KB Output is correct
57 Correct 132 ms 30064 KB Output is correct
58 Correct 146 ms 31244 KB Output is correct
59 Correct 133 ms 28712 KB Output is correct
60 Correct 143 ms 25256 KB Output is correct
61 Correct 138 ms 31372 KB Output is correct
62 Correct 151 ms 27136 KB Output is correct
63 Correct 108 ms 25108 KB Output is correct
64 Correct 60 ms 9420 KB Output is correct
65 Correct 129 ms 30172 KB Output is correct
66 Correct 50 ms 10244 KB Output is correct
67 Correct 49 ms 9348 KB Output is correct
68 Correct 83 ms 23432 KB Output is correct
69 Correct 143 ms 30884 KB Output is correct
70 Correct 14 ms 5924 KB Output is correct
71 Correct 73 ms 23472 KB Output is correct
72 Correct 133 ms 28464 KB Output is correct
73 Correct 13 ms 5724 KB Output is correct
74 Correct 66 ms 15924 KB Output is correct
75 Correct 150 ms 33252 KB Output is correct
76 Correct 12 ms 5720 KB Output is correct
77 Correct 61 ms 14424 KB Output is correct
78 Correct 110 ms 25436 KB Output is correct
79 Correct 42 ms 7632 KB Output is correct
80 Correct 35 ms 6600 KB Output is correct
81 Correct 15 ms 5724 KB Output is correct
82 Correct 14 ms 5980 KB Output is correct
83 Correct 159 ms 32944 KB Output is correct
84 Correct 148 ms 31600 KB Output is correct
85 Correct 153 ms 32088 KB Output is correct
86 Correct 167 ms 31064 KB Output is correct
87 Correct 158 ms 32976 KB Output is correct
88 Correct 153 ms 31580 KB Output is correct
89 Correct 145 ms 30140 KB Output is correct
90 Correct 124 ms 29352 KB Output is correct
91 Correct 112 ms 14028 KB Output is correct
92 Correct 187 ms 31924 KB Output is correct
93 Correct 147 ms 31664 KB Output is correct
94 Correct 62 ms 15032 KB Output is correct
95 Correct 80 ms 23200 KB Output is correct
96 Correct 165 ms 31900 KB Output is correct
97 Correct 73 ms 23220 KB Output is correct
98 Correct 72 ms 23096 KB Output is correct
99 Correct 160 ms 31076 KB Output is correct
100 Correct 60 ms 14772 KB Output is correct
101 Correct 70 ms 23212 KB Output is correct
102 Correct 159 ms 32964 KB Output is correct
103 Correct 61 ms 23472 KB Output is correct
104 Correct 60 ms 23356 KB Output is correct
105 Correct 133 ms 29056 KB Output is correct
106 Correct 36 ms 6360 KB Output is correct
107 Correct 42 ms 7884 KB Output is correct
108 Correct 39 ms 6920 KB Output is correct
109 Correct 41 ms 7880 KB Output is correct
110 Correct 181 ms 34008 KB Output is correct
111 Correct 173 ms 33036 KB Output is correct
112 Correct 196 ms 32980 KB Output is correct
113 Correct 159 ms 31768 KB Output is correct
114 Correct 204 ms 34144 KB Output is correct
115 Correct 156 ms 32488 KB Output is correct
116 Correct 174 ms 48492 KB Output is correct
117 Correct 155 ms 30180 KB Output is correct
118 Correct 111 ms 15880 KB Output is correct
119 Correct 59 ms 10320 KB Output is correct
120 Correct 178 ms 32368 KB Output is correct
121 Correct 71 ms 23468 KB Output is correct
122 Correct 77 ms 23484 KB Output is correct
123 Correct 161 ms 32924 KB Output is correct
124 Correct 64 ms 15540 KB Output is correct
125 Correct 81 ms 23216 KB Output is correct
126 Correct 154 ms 32180 KB Output is correct
127 Correct 64 ms 14612 KB Output is correct
128 Correct 74 ms 23720 KB Output is correct
129 Correct 160 ms 34504 KB Output is correct
130 Correct 74 ms 23484 KB Output is correct
131 Correct 76 ms 23220 KB Output is correct
132 Correct 140 ms 30116 KB Output is correct