oj.uz

답안 #987998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987998 2024-05-23T20:13:53 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 174 ms 48380 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast,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 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5720 KB Output is correct
5 Correct 4 ms 8664 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8624 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 5720 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 25892 KB Output is correct
2 Correct 62 ms 25768 KB Output is correct
3 Correct 63 ms 25856 KB Output is correct
4 Correct 62 ms 26032 KB Output is correct
5 Correct 54 ms 17584 KB Output is correct
6 Correct 59 ms 17684 KB Output is correct
7 Correct 65 ms 25512 KB Output is correct
8 Correct 58 ms 25528 KB Output is correct
9 Correct 13 ms 8540 KB Output is correct
10 Correct 65 ms 25768 KB Output is correct
11 Correct 12 ms 8796 KB Output is correct
12 Correct 27 ms 6612 KB Output is correct
13 Correct 65 ms 22572 KB Output is correct
14 Correct 70 ms 22980 KB Output is correct
15 Correct 13 ms 5720 KB Output is correct
16 Correct 64 ms 25520 KB Output is correct
17 Correct 65 ms 25644 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 78 ms 25832 KB Output is correct
20 Correct 62 ms 26324 KB Output is correct
21 Correct 13 ms 8620 KB Output is correct
22 Correct 57 ms 16976 KB Output is correct
23 Correct 59 ms 25268 KB Output is correct
24 Correct 12 ms 8792 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 51 ms 14528 KB Output is correct
27 Correct 50 ms 17596 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5720 KB Output is correct
5 Correct 4 ms 8664 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8624 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 5720 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 62 ms 25892 KB Output is correct
30 Correct 62 ms 25768 KB Output is correct
31 Correct 63 ms 25856 KB Output is correct
32 Correct 62 ms 26032 KB Output is correct
33 Correct 54 ms 17584 KB Output is correct
34 Correct 59 ms 17684 KB Output is correct
35 Correct 65 ms 25512 KB Output is correct
36 Correct 58 ms 25528 KB Output is correct
37 Correct 13 ms 8540 KB Output is correct
38 Correct 65 ms 25768 KB Output is correct
39 Correct 12 ms 8796 KB Output is correct
40 Correct 27 ms 6612 KB Output is correct
41 Correct 65 ms 22572 KB Output is correct
42 Correct 70 ms 22980 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 64 ms 25520 KB Output is correct
45 Correct 65 ms 25644 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 78 ms 25832 KB Output is correct
48 Correct 62 ms 26324 KB Output is correct
49 Correct 13 ms 8620 KB Output is correct
50 Correct 57 ms 16976 KB Output is correct
51 Correct 59 ms 25268 KB Output is correct
52 Correct 12 ms 8792 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 51 ms 14528 KB Output is correct
55 Correct 50 ms 17596 KB Output is correct
56 Correct 150 ms 34352 KB Output is correct
57 Correct 137 ms 32056 KB Output is correct
58 Correct 145 ms 32824 KB Output is correct
59 Correct 129 ms 31380 KB Output is correct
60 Correct 145 ms 26376 KB Output is correct
61 Correct 151 ms 32904 KB Output is correct
62 Correct 126 ms 29868 KB Output is correct
63 Correct 108 ms 28032 KB Output is correct
64 Correct 59 ms 12496 KB Output is correct
65 Correct 139 ms 32068 KB Output is correct
66 Correct 50 ms 13396 KB Output is correct
67 Correct 50 ms 12052 KB Output is correct
68 Correct 88 ms 26476 KB Output is correct
69 Correct 151 ms 32564 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 81 ms 23472 KB Output is correct
72 Correct 123 ms 31292 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 68 ms 18732 KB Output is correct
75 Correct 164 ms 34560 KB Output is correct
76 Correct 12 ms 8624 KB Output is correct
77 Correct 67 ms 17348 KB Output is correct
78 Correct 105 ms 28324 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 10464 KB Output is correct
2 Correct 35 ms 9432 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 13 ms 8796 KB Output is correct
5 Correct 160 ms 33072 KB Output is correct
6 Correct 146 ms 31808 KB Output is correct
7 Correct 146 ms 32552 KB Output is correct
8 Correct 149 ms 31244 KB Output is correct
9 Correct 164 ms 33108 KB Output is correct
10 Correct 145 ms 31708 KB Output is correct
11 Correct 138 ms 30228 KB Output is correct
12 Correct 132 ms 30852 KB Output is correct
13 Correct 103 ms 14916 KB Output is correct
14 Correct 166 ms 31636 KB Output is correct
15 Correct 156 ms 31796 KB Output is correct
16 Correct 59 ms 17872 KB Output is correct
17 Correct 76 ms 26028 KB Output is correct
18 Correct 169 ms 32000 KB Output is correct
19 Correct 66 ms 26164 KB Output is correct
20 Correct 75 ms 25788 KB Output is correct
21 Correct 145 ms 31072 KB Output is correct
22 Correct 61 ms 17848 KB Output is correct
23 Correct 70 ms 26044 KB Output is correct
24 Correct 150 ms 33072 KB Output is correct
25 Correct 60 ms 26288 KB Output is correct
26 Correct 60 ms 26288 KB Output is correct
27 Correct 138 ms 30348 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8660 KB Output is correct
2 Correct 4 ms 8540 KB Output is correct
3 Correct 6 ms 5724 KB Output is correct
4 Correct 6 ms 5720 KB Output is correct
5 Correct 4 ms 8664 KB Output is correct
6 Correct 5 ms 8540 KB Output is correct
7 Correct 5 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 5 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 4 ms 8540 KB Output is correct
14 Correct 5 ms 8664 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8624 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 5724 KB Output is correct
21 Correct 3 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8540 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8284 KB Output is correct
26 Correct 5 ms 5720 KB Output is correct
27 Correct 6 ms 5724 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 62 ms 25892 KB Output is correct
30 Correct 62 ms 25768 KB Output is correct
31 Correct 63 ms 25856 KB Output is correct
32 Correct 62 ms 26032 KB Output is correct
33 Correct 54 ms 17584 KB Output is correct
34 Correct 59 ms 17684 KB Output is correct
35 Correct 65 ms 25512 KB Output is correct
36 Correct 58 ms 25528 KB Output is correct
37 Correct 13 ms 8540 KB Output is correct
38 Correct 65 ms 25768 KB Output is correct
39 Correct 12 ms 8796 KB Output is correct
40 Correct 27 ms 6612 KB Output is correct
41 Correct 65 ms 22572 KB Output is correct
42 Correct 70 ms 22980 KB Output is correct
43 Correct 13 ms 5720 KB Output is correct
44 Correct 64 ms 25520 KB Output is correct
45 Correct 65 ms 25644 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 78 ms 25832 KB Output is correct
48 Correct 62 ms 26324 KB Output is correct
49 Correct 13 ms 8620 KB Output is correct
50 Correct 57 ms 16976 KB Output is correct
51 Correct 59 ms 25268 KB Output is correct
52 Correct 12 ms 8792 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 51 ms 14528 KB Output is correct
55 Correct 50 ms 17596 KB Output is correct
56 Correct 150 ms 34352 KB Output is correct
57 Correct 137 ms 32056 KB Output is correct
58 Correct 145 ms 32824 KB Output is correct
59 Correct 129 ms 31380 KB Output is correct
60 Correct 145 ms 26376 KB Output is correct
61 Correct 151 ms 32904 KB Output is correct
62 Correct 126 ms 29868 KB Output is correct
63 Correct 108 ms 28032 KB Output is correct
64 Correct 59 ms 12496 KB Output is correct
65 Correct 139 ms 32068 KB Output is correct
66 Correct 50 ms 13396 KB Output is correct
67 Correct 50 ms 12052 KB Output is correct
68 Correct 88 ms 26476 KB Output is correct
69 Correct 151 ms 32564 KB Output is correct
70 Correct 14 ms 9052 KB Output is correct
71 Correct 81 ms 23472 KB Output is correct
72 Correct 123 ms 31292 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 68 ms 18732 KB Output is correct
75 Correct 164 ms 34560 KB Output is correct
76 Correct 12 ms 8624 KB Output is correct
77 Correct 67 ms 17348 KB Output is correct
78 Correct 105 ms 28324 KB Output is correct
79 Correct 41 ms 10464 KB Output is correct
80 Correct 35 ms 9432 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 13 ms 8796 KB Output is correct
83 Correct 160 ms 33072 KB Output is correct
84 Correct 146 ms 31808 KB Output is correct
85 Correct 146 ms 32552 KB Output is correct
86 Correct 149 ms 31244 KB Output is correct
87 Correct 164 ms 33108 KB Output is correct
88 Correct 145 ms 31708 KB Output is correct
89 Correct 138 ms 30228 KB Output is correct
90 Correct 132 ms 30852 KB Output is correct
91 Correct 103 ms 14916 KB Output is correct
92 Correct 166 ms 31636 KB Output is correct
93 Correct 156 ms 31796 KB Output is correct
94 Correct 59 ms 17872 KB Output is correct
95 Correct 76 ms 26028 KB Output is correct
96 Correct 169 ms 32000 KB Output is correct
97 Correct 66 ms 26164 KB Output is correct
98 Correct 75 ms 25788 KB Output is correct
99 Correct 145 ms 31072 KB Output is correct
100 Correct 61 ms 17848 KB Output is correct
101 Correct 70 ms 26044 KB Output is correct
102 Correct 150 ms 33072 KB Output is correct
103 Correct 60 ms 26288 KB Output is correct
104 Correct 60 ms 26288 KB Output is correct
105 Correct 138 ms 30348 KB Output is correct
106 Correct 36 ms 9436 KB Output is correct
107 Correct 41 ms 10956 KB Output is correct
108 Correct 39 ms 10164 KB Output is correct
109 Correct 42 ms 10696 KB Output is correct
110 Correct 156 ms 33896 KB Output is correct
111 Correct 171 ms 33336 KB Output is correct
112 Correct 162 ms 33096 KB Output is correct
113 Correct 168 ms 31812 KB Output is correct
114 Correct 156 ms 34100 KB Output is correct
115 Correct 153 ms 32628 KB Output is correct
116 Correct 174 ms 48380 KB Output is correct
117 Correct 139 ms 30500 KB Output is correct
118 Correct 109 ms 16844 KB Output is correct
119 Correct 57 ms 13336 KB Output is correct
120 Correct 160 ms 32400 KB Output is correct
121 Correct 71 ms 26548 KB Output is correct
122 Correct 87 ms 26352 KB Output is correct
123 Correct 165 ms 32832 KB Output is correct
124 Correct 78 ms 18436 KB Output is correct
125 Correct 80 ms 26040 KB Output is correct
126 Correct 152 ms 32376 KB Output is correct
127 Correct 61 ms 17608 KB Output is correct
128 Correct 89 ms 26804 KB Output is correct
129 Correct 167 ms 34532 KB Output is correct
130 Correct 68 ms 26640 KB Output is correct
131 Correct 75 ms 26208 KB Output is correct
132 Correct 159 ms 30632 KB Output is correct