oj.uz

답안 #987981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987981 2024-05-23T20:04:22 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 182 ms 46132 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;
int inf=1e9+10;
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;
    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(int 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
            {
                long long vkuk=adj[i][0];
                init[i]=adj[i][0];
                for(int 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:124:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:144:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |                 for(int j=0; j<adj[i].size(); j++)
      |                              ~^~~~~~~~~~~~~~
Main.cpp:150:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  150 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:160:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:168:15: warning: unused variable 'curr2' [-Wunused-variable]
  168 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 6 ms 8584 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8136 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 7 ms 8536 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8436 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 25916 KB Output is correct
2 Correct 63 ms 25780 KB Output is correct
3 Correct 64 ms 25768 KB Output is correct
4 Correct 69 ms 25772 KB Output is correct
5 Correct 59 ms 18816 KB Output is correct
6 Correct 57 ms 17508 KB Output is correct
7 Correct 68 ms 25820 KB Output is correct
8 Correct 57 ms 22416 KB Output is correct
9 Correct 12 ms 6492 KB Output is correct
10 Correct 66 ms 23724 KB Output is correct
11 Correct 12 ms 6492 KB Output is correct
12 Correct 32 ms 6840 KB Output is correct
13 Correct 65 ms 22712 KB Output is correct
14 Correct 63 ms 22968 KB Output is correct
15 Correct 13 ms 9052 KB Output is correct
16 Correct 65 ms 25520 KB Output is correct
17 Correct 65 ms 25816 KB Output is correct
18 Correct 24 ms 9180 KB Output is correct
19 Correct 70 ms 25788 KB Output is correct
20 Correct 60 ms 26256 KB Output is correct
21 Correct 12 ms 8792 KB Output is correct
22 Correct 56 ms 14020 KB Output is correct
23 Correct 61 ms 22212 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 6492 KB Output is correct
26 Correct 58 ms 17616 KB Output is correct
27 Correct 56 ms 17604 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 6 ms 8584 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8136 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 7 ms 8536 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8436 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 61 ms 25916 KB Output is correct
30 Correct 63 ms 25780 KB Output is correct
31 Correct 64 ms 25768 KB Output is correct
32 Correct 69 ms 25772 KB Output is correct
33 Correct 59 ms 18816 KB Output is correct
34 Correct 57 ms 17508 KB Output is correct
35 Correct 68 ms 25820 KB Output is correct
36 Correct 57 ms 22416 KB Output is correct
37 Correct 12 ms 6492 KB Output is correct
38 Correct 66 ms 23724 KB Output is correct
39 Correct 12 ms 6492 KB Output is correct
40 Correct 32 ms 6840 KB Output is correct
41 Correct 65 ms 22712 KB Output is correct
42 Correct 63 ms 22968 KB Output is correct
43 Correct 13 ms 9052 KB Output is correct
44 Correct 65 ms 25520 KB Output is correct
45 Correct 65 ms 25816 KB Output is correct
46 Correct 24 ms 9180 KB Output is correct
47 Correct 70 ms 25788 KB Output is correct
48 Correct 60 ms 26256 KB Output is correct
49 Correct 12 ms 8792 KB Output is correct
50 Correct 56 ms 14020 KB Output is correct
51 Correct 61 ms 22212 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 6492 KB Output is correct
54 Correct 58 ms 17616 KB Output is correct
55 Correct 56 ms 17604 KB Output is correct
56 Correct 137 ms 32048 KB Output is correct
57 Correct 132 ms 30024 KB Output is correct
58 Correct 140 ms 30616 KB Output is correct
59 Correct 128 ms 29236 KB Output is correct
60 Correct 135 ms 24096 KB Output is correct
61 Correct 130 ms 30772 KB Output is correct
62 Correct 121 ms 28516 KB Output is correct
63 Correct 108 ms 26748 KB Output is correct
64 Correct 54 ms 10820 KB Output is correct
65 Correct 135 ms 30012 KB Output is correct
66 Correct 50 ms 11344 KB Output is correct
67 Correct 51 ms 12488 KB Output is correct
68 Correct 75 ms 26280 KB Output is correct
69 Correct 144 ms 30516 KB Output is correct
70 Correct 15 ms 9304 KB Output is correct
71 Correct 79 ms 26400 KB Output is correct
72 Correct 122 ms 29092 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 75 ms 19140 KB Output is correct
75 Correct 143 ms 32304 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 61 ms 15296 KB Output is correct
78 Correct 107 ms 26808 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 10700 KB Output is correct
2 Correct 35 ms 9688 KB Output is correct
3 Correct 13 ms 8792 KB Output is correct
4 Correct 13 ms 8740 KB Output is correct
5 Correct 148 ms 30548 KB Output is correct
6 Correct 144 ms 29280 KB Output is correct
7 Correct 159 ms 30040 KB Output is correct
8 Correct 136 ms 28836 KB Output is correct
9 Correct 160 ms 30772 KB Output is correct
10 Correct 143 ms 29300 KB Output is correct
11 Correct 143 ms 27704 KB Output is correct
12 Correct 120 ms 28336 KB Output is correct
13 Correct 111 ms 12116 KB Output is correct
14 Correct 144 ms 29220 KB Output is correct
15 Correct 182 ms 29324 KB Output is correct
16 Correct 62 ms 17852 KB Output is correct
17 Correct 79 ms 25988 KB Output is correct
18 Correct 147 ms 29484 KB Output is correct
19 Correct 67 ms 26296 KB Output is correct
20 Correct 80 ms 26040 KB Output is correct
21 Correct 144 ms 28568 KB Output is correct
22 Correct 69 ms 17848 KB Output is correct
23 Correct 71 ms 26044 KB Output is correct
24 Correct 152 ms 30736 KB Output is correct
25 Correct 64 ms 26304 KB Output is correct
26 Correct 61 ms 26296 KB Output is correct
27 Correct 148 ms 28100 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 5 ms 8536 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 6 ms 8584 KB Output is correct
7 Correct 4 ms 6492 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8136 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 5 ms 8536 KB Output is correct
14 Correct 8 ms 8536 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 5 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 7 ms 8536 KB Output is correct
21 Correct 4 ms 8028 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 5 ms 8536 KB Output is correct
24 Correct 5 ms 8284 KB Output is correct
25 Correct 4 ms 8436 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 5 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 61 ms 25916 KB Output is correct
30 Correct 63 ms 25780 KB Output is correct
31 Correct 64 ms 25768 KB Output is correct
32 Correct 69 ms 25772 KB Output is correct
33 Correct 59 ms 18816 KB Output is correct
34 Correct 57 ms 17508 KB Output is correct
35 Correct 68 ms 25820 KB Output is correct
36 Correct 57 ms 22416 KB Output is correct
37 Correct 12 ms 6492 KB Output is correct
38 Correct 66 ms 23724 KB Output is correct
39 Correct 12 ms 6492 KB Output is correct
40 Correct 32 ms 6840 KB Output is correct
41 Correct 65 ms 22712 KB Output is correct
42 Correct 63 ms 22968 KB Output is correct
43 Correct 13 ms 9052 KB Output is correct
44 Correct 65 ms 25520 KB Output is correct
45 Correct 65 ms 25816 KB Output is correct
46 Correct 24 ms 9180 KB Output is correct
47 Correct 70 ms 25788 KB Output is correct
48 Correct 60 ms 26256 KB Output is correct
49 Correct 12 ms 8792 KB Output is correct
50 Correct 56 ms 14020 KB Output is correct
51 Correct 61 ms 22212 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 6492 KB Output is correct
54 Correct 58 ms 17616 KB Output is correct
55 Correct 56 ms 17604 KB Output is correct
56 Correct 137 ms 32048 KB Output is correct
57 Correct 132 ms 30024 KB Output is correct
58 Correct 140 ms 30616 KB Output is correct
59 Correct 128 ms 29236 KB Output is correct
60 Correct 135 ms 24096 KB Output is correct
61 Correct 130 ms 30772 KB Output is correct
62 Correct 121 ms 28516 KB Output is correct
63 Correct 108 ms 26748 KB Output is correct
64 Correct 54 ms 10820 KB Output is correct
65 Correct 135 ms 30012 KB Output is correct
66 Correct 50 ms 11344 KB Output is correct
67 Correct 51 ms 12488 KB Output is correct
68 Correct 75 ms 26280 KB Output is correct
69 Correct 144 ms 30516 KB Output is correct
70 Correct 15 ms 9304 KB Output is correct
71 Correct 79 ms 26400 KB Output is correct
72 Correct 122 ms 29092 KB Output is correct
73 Correct 12 ms 8796 KB Output is correct
74 Correct 75 ms 19140 KB Output is correct
75 Correct 143 ms 32304 KB Output is correct
76 Correct 12 ms 8540 KB Output is correct
77 Correct 61 ms 15296 KB Output is correct
78 Correct 107 ms 26808 KB Output is correct
79 Correct 40 ms 10700 KB Output is correct
80 Correct 35 ms 9688 KB Output is correct
81 Correct 13 ms 8792 KB Output is correct
82 Correct 13 ms 8740 KB Output is correct
83 Correct 148 ms 30548 KB Output is correct
84 Correct 144 ms 29280 KB Output is correct
85 Correct 159 ms 30040 KB Output is correct
86 Correct 136 ms 28836 KB Output is correct
87 Correct 160 ms 30772 KB Output is correct
88 Correct 143 ms 29300 KB Output is correct
89 Correct 143 ms 27704 KB Output is correct
90 Correct 120 ms 28336 KB Output is correct
91 Correct 111 ms 12116 KB Output is correct
92 Correct 144 ms 29220 KB Output is correct
93 Correct 182 ms 29324 KB Output is correct
94 Correct 62 ms 17852 KB Output is correct
95 Correct 79 ms 25988 KB Output is correct
96 Correct 147 ms 29484 KB Output is correct
97 Correct 67 ms 26296 KB Output is correct
98 Correct 80 ms 26040 KB Output is correct
99 Correct 144 ms 28568 KB Output is correct
100 Correct 69 ms 17848 KB Output is correct
101 Correct 71 ms 26044 KB Output is correct
102 Correct 152 ms 30736 KB Output is correct
103 Correct 64 ms 26304 KB Output is correct
104 Correct 61 ms 26296 KB Output is correct
105 Correct 148 ms 28100 KB Output is correct
106 Correct 35 ms 9184 KB Output is correct
107 Correct 41 ms 10956 KB Output is correct
108 Correct 39 ms 7884 KB Output is correct
109 Correct 41 ms 8736 KB Output is correct
110 Correct 171 ms 31652 KB Output is correct
111 Correct 171 ms 30748 KB Output is correct
112 Correct 174 ms 30632 KB Output is correct
113 Correct 151 ms 29600 KB Output is correct
114 Correct 172 ms 31788 KB Output is correct
115 Correct 172 ms 30208 KB Output is correct
116 Correct 168 ms 46132 KB Output is correct
117 Correct 164 ms 28296 KB Output is correct
118 Correct 110 ms 14244 KB Output is correct
119 Correct 53 ms 11384 KB Output is correct
120 Correct 165 ms 30000 KB Output is correct
121 Correct 79 ms 26544 KB Output is correct
122 Correct 81 ms 26320 KB Output is correct
123 Correct 166 ms 30516 KB Output is correct
124 Correct 68 ms 18288 KB Output is correct
125 Correct 85 ms 26036 KB Output is correct
126 Correct 145 ms 29968 KB Output is correct
127 Correct 68 ms 17524 KB Output is correct
128 Correct 76 ms 26768 KB Output is correct
129 Correct 161 ms 32316 KB Output is correct
130 Correct 70 ms 26200 KB Output is correct
131 Correct 76 ms 26152 KB Output is correct
132 Correct 140 ms 27744 KB Output is correct