oj.uz

답안 #987993

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987993 2024-05-23T20:10:53 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++
25 / 25
 200 ms 46244 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("O3,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 6488 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 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 4 ms 5596 KB Output is correct
8 Correct 4 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 3 ms 5212 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 6340 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8408 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 3 ms 6340 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 25868 KB Output is correct
2 Correct 63 ms 25780 KB Output is correct
3 Correct 66 ms 25864 KB Output is correct
4 Correct 74 ms 25724 KB Output is correct
5 Correct 54 ms 17584 KB Output is correct
6 Correct 56 ms 17344 KB Output is correct
7 Correct 65 ms 25684 KB Output is correct
8 Correct 58 ms 25540 KB Output is correct
9 Correct 12 ms 8540 KB Output is correct
10 Correct 64 ms 25904 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 27 ms 6616 KB Output is correct
13 Correct 66 ms 25536 KB Output is correct
14 Correct 66 ms 25976 KB Output is correct
15 Correct 12 ms 8796 KB Output is correct
16 Correct 62 ms 25516 KB Output is correct
17 Correct 65 ms 26072 KB Output is correct
18 Correct 20 ms 9152 KB Output is correct
19 Correct 67 ms 25788 KB Output is correct
20 Correct 64 ms 26204 KB Output is correct
21 Correct 13 ms 9048 KB Output is correct
22 Correct 56 ms 16848 KB Output is correct
23 Correct 59 ms 25336 KB Output is correct
24 Correct 12 ms 8536 KB Output is correct
25 Correct 13 ms 5720 KB Output is correct
26 Correct 52 ms 14536 KB Output is correct
27 Correct 50 ms 14524 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6488 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 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 4 ms 5596 KB Output is correct
8 Correct 4 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 3 ms 5212 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 6340 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8408 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 3 ms 6340 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 62 ms 25868 KB Output is correct
30 Correct 63 ms 25780 KB Output is correct
31 Correct 66 ms 25864 KB Output is correct
32 Correct 74 ms 25724 KB Output is correct
33 Correct 54 ms 17584 KB Output is correct
34 Correct 56 ms 17344 KB Output is correct
35 Correct 65 ms 25684 KB Output is correct
36 Correct 58 ms 25540 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 64 ms 25904 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 6616 KB Output is correct
41 Correct 66 ms 25536 KB Output is correct
42 Correct 66 ms 25976 KB Output is correct
43 Correct 12 ms 8796 KB Output is correct
44 Correct 62 ms 25516 KB Output is correct
45 Correct 65 ms 26072 KB Output is correct
46 Correct 20 ms 9152 KB Output is correct
47 Correct 67 ms 25788 KB Output is correct
48 Correct 64 ms 26204 KB Output is correct
49 Correct 13 ms 9048 KB Output is correct
50 Correct 56 ms 16848 KB Output is correct
51 Correct 59 ms 25336 KB Output is correct
52 Correct 12 ms 8536 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 52 ms 14536 KB Output is correct
55 Correct 50 ms 14524 KB Output is correct
56 Correct 140 ms 30776 KB Output is correct
57 Correct 138 ms 28164 KB Output is correct
58 Correct 133 ms 30576 KB Output is correct
59 Correct 133 ms 29304 KB Output is correct
60 Correct 142 ms 24112 KB Output is correct
61 Correct 131 ms 30592 KB Output is correct
62 Correct 122 ms 28076 KB Output is correct
63 Correct 106 ms 26636 KB Output is correct
64 Correct 54 ms 10916 KB Output is correct
65 Correct 124 ms 30016 KB Output is correct
66 Correct 48 ms 11344 KB Output is correct
67 Correct 52 ms 12240 KB Output is correct
68 Correct 79 ms 26532 KB Output is correct
69 Correct 134 ms 30520 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 74 ms 26548 KB Output is correct
72 Correct 124 ms 29268 KB Output is correct
73 Correct 12 ms 9048 KB Output is correct
74 Correct 67 ms 15792 KB Output is correct
75 Correct 150 ms 31364 KB Output is correct
76 Correct 12 ms 8536 KB Output is correct
77 Correct 61 ms 17356 KB Output is correct
78 Correct 109 ms 26932 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 10704 KB Output is correct
2 Correct 35 ms 9436 KB Output is correct
3 Correct 13 ms 8792 KB Output is correct
4 Correct 13 ms 5980 KB Output is correct
5 Correct 163 ms 30760 KB Output is correct
6 Correct 146 ms 29244 KB Output is correct
7 Correct 148 ms 29816 KB Output is correct
8 Correct 148 ms 28724 KB Output is correct
9 Correct 146 ms 30612 KB Output is correct
10 Correct 143 ms 29244 KB Output is correct
11 Correct 150 ms 27776 KB Output is correct
12 Correct 124 ms 28340 KB Output is correct
13 Correct 98 ms 12248 KB Output is correct
14 Correct 145 ms 29284 KB Output is correct
15 Correct 141 ms 29296 KB Output is correct
16 Correct 65 ms 17980 KB Output is correct
17 Correct 74 ms 26040 KB Output is correct
18 Correct 153 ms 29612 KB Output is correct
19 Correct 67 ms 26348 KB Output is correct
20 Correct 80 ms 26016 KB Output is correct
21 Correct 134 ms 28716 KB Output is correct
22 Correct 61 ms 17852 KB Output is correct
23 Correct 72 ms 26044 KB Output is correct
24 Correct 154 ms 30776 KB Output is correct
25 Correct 62 ms 26304 KB Output is correct
26 Correct 63 ms 26340 KB Output is correct
27 Correct 123 ms 28116 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6488 KB Output is correct
2 Correct 5 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Correct 4 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 4 ms 5596 KB Output is correct
8 Correct 4 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 3 ms 5212 KB Output is correct
12 Correct 3 ms 6236 KB Output is correct
13 Correct 3 ms 6492 KB Output is correct
14 Correct 6 ms 5592 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 6340 KB Output is correct
17 Correct 5 ms 6492 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 8540 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8408 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 3 ms 6340 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 5 ms 6492 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 62 ms 25868 KB Output is correct
30 Correct 63 ms 25780 KB Output is correct
31 Correct 66 ms 25864 KB Output is correct
32 Correct 74 ms 25724 KB Output is correct
33 Correct 54 ms 17584 KB Output is correct
34 Correct 56 ms 17344 KB Output is correct
35 Correct 65 ms 25684 KB Output is correct
36 Correct 58 ms 25540 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 64 ms 25904 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 6616 KB Output is correct
41 Correct 66 ms 25536 KB Output is correct
42 Correct 66 ms 25976 KB Output is correct
43 Correct 12 ms 8796 KB Output is correct
44 Correct 62 ms 25516 KB Output is correct
45 Correct 65 ms 26072 KB Output is correct
46 Correct 20 ms 9152 KB Output is correct
47 Correct 67 ms 25788 KB Output is correct
48 Correct 64 ms 26204 KB Output is correct
49 Correct 13 ms 9048 KB Output is correct
50 Correct 56 ms 16848 KB Output is correct
51 Correct 59 ms 25336 KB Output is correct
52 Correct 12 ms 8536 KB Output is correct
53 Correct 13 ms 5720 KB Output is correct
54 Correct 52 ms 14536 KB Output is correct
55 Correct 50 ms 14524 KB Output is correct
56 Correct 140 ms 30776 KB Output is correct
57 Correct 138 ms 28164 KB Output is correct
58 Correct 133 ms 30576 KB Output is correct
59 Correct 133 ms 29304 KB Output is correct
60 Correct 142 ms 24112 KB Output is correct
61 Correct 131 ms 30592 KB Output is correct
62 Correct 122 ms 28076 KB Output is correct
63 Correct 106 ms 26636 KB Output is correct
64 Correct 54 ms 10916 KB Output is correct
65 Correct 124 ms 30016 KB Output is correct
66 Correct 48 ms 11344 KB Output is correct
67 Correct 52 ms 12240 KB Output is correct
68 Correct 79 ms 26532 KB Output is correct
69 Correct 134 ms 30520 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 74 ms 26548 KB Output is correct
72 Correct 124 ms 29268 KB Output is correct
73 Correct 12 ms 9048 KB Output is correct
74 Correct 67 ms 15792 KB Output is correct
75 Correct 150 ms 31364 KB Output is correct
76 Correct 12 ms 8536 KB Output is correct
77 Correct 61 ms 17356 KB Output is correct
78 Correct 109 ms 26932 KB Output is correct
79 Correct 40 ms 10704 KB Output is correct
80 Correct 35 ms 9436 KB Output is correct
81 Correct 13 ms 8792 KB Output is correct
82 Correct 13 ms 5980 KB Output is correct
83 Correct 163 ms 30760 KB Output is correct
84 Correct 146 ms 29244 KB Output is correct
85 Correct 148 ms 29816 KB Output is correct
86 Correct 148 ms 28724 KB Output is correct
87 Correct 146 ms 30612 KB Output is correct
88 Correct 143 ms 29244 KB Output is correct
89 Correct 150 ms 27776 KB Output is correct
90 Correct 124 ms 28340 KB Output is correct
91 Correct 98 ms 12248 KB Output is correct
92 Correct 145 ms 29284 KB Output is correct
93 Correct 141 ms 29296 KB Output is correct
94 Correct 65 ms 17980 KB Output is correct
95 Correct 74 ms 26040 KB Output is correct
96 Correct 153 ms 29612 KB Output is correct
97 Correct 67 ms 26348 KB Output is correct
98 Correct 80 ms 26016 KB Output is correct
99 Correct 134 ms 28716 KB Output is correct
100 Correct 61 ms 17852 KB Output is correct
101 Correct 72 ms 26044 KB Output is correct
102 Correct 154 ms 30776 KB Output is correct
103 Correct 62 ms 26304 KB Output is correct
104 Correct 63 ms 26340 KB Output is correct
105 Correct 123 ms 28116 KB Output is correct
106 Correct 42 ms 9420 KB Output is correct
107 Correct 41 ms 10956 KB Output is correct
108 Correct 38 ms 9932 KB Output is correct
109 Correct 41 ms 10692 KB Output is correct
110 Correct 168 ms 31660 KB Output is correct
111 Correct 172 ms 30748 KB Output is correct
112 Correct 159 ms 30564 KB Output is correct
113 Correct 158 ms 29564 KB Output is correct
114 Correct 200 ms 31708 KB Output is correct
115 Correct 152 ms 30316 KB Output is correct
116 Correct 171 ms 46244 KB Output is correct
117 Correct 135 ms 28192 KB Output is correct
118 Correct 110 ms 14148 KB Output is correct
119 Correct 61 ms 11484 KB Output is correct
120 Correct 170 ms 29984 KB Output is correct
121 Correct 74 ms 26376 KB Output is correct
122 Correct 97 ms 26376 KB Output is correct
123 Correct 159 ms 30752 KB Output is correct
124 Correct 63 ms 15544 KB Output is correct
125 Correct 80 ms 23212 KB Output is correct
126 Correct 172 ms 29932 KB Output is correct
127 Correct 65 ms 17608 KB Output is correct
128 Correct 93 ms 24900 KB Output is correct
129 Correct 187 ms 32148 KB Output is correct
130 Correct 84 ms 24256 KB Output is correct
131 Correct 92 ms 24144 KB Output is correct
132 Correct 144 ms 27728 KB Output is correct