oj.uz

답안 #987908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987908 2024-05-23T19:02:38 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 169 ms 46260 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;
long long 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];
node special(node curr)
{
    int g,g2;
    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)
{
    int g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    if(x[g]==0)
    {
       curr.sum=curr.sum-adj[g][curr.lst];
    }
    else
        curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-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 godown(node curr)
{
    int g,g2;
    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)
{
    int g;
    g=ord[curr.layer];
    curr.lst++;
    curr.sum+=adj[g][curr.lst]-adj[g][curr.lst-1];
    return curr;
}
node fixborderandshift(node curr)
{
    int g;
    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)
{
    int g;
    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 g=ord[0];
        if(x[g]==0)
        {
            curr.layer=0;
            curr.sum=adj[g][0];
            curr.bitipref=0;
            curr.lst=0;
            curr.biti=1;
            curr.rghtbord=adj[g].size()-1;
            pq.push(curr);
        }
        else
        {
            curr.layer=0;
            curr.sum=adj[g][x[g]]-adj[g][x[g]-1];
            curr.bitipref=x[g]-1;
            curr.lst=x[g];
            curr.rghtbord=adj[g].size()-1;
            curr.biti=x[g];
            pq.push(curr);
        }
        while(pq.size() && k)
        {
            curr=pq.top();
            pq.pop();
            k--;
            cout<<curr.sum+sum<<'\n';
            g=ord[curr.layer];
            if(x[g]==0 && curr.biti==1 && curr.layer+1<=m && curr.lst==0)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            else if(curr.lst==x[g] && curr.bitipref==x[g]-1 && curr.biti==x[g] && curr.layer+1<=m)
            {
                curr2=skip(curr);
                pq.push(curr2);
            }
            if(curr.lst+1<=curr.rghtbord)
            {
                curr2=shift(curr);
                pq.push(curr2);
            }
            if(curr.bitipref>=1 && curr.lst>=curr.bitipref+1)
            {
                curr2=fixborderandshift(curr);
                pq.push(curr2);
            }
            else if(curr.bitipref==0 && curr.lst>=1 && curr.biti+1<=y[g])
            {
                curr2=fixborderandcreate(curr);
                pq.push(curr2);
            }
            if(curr.layer+1<=m)
            {
                curr2=godown(curr);
                pq.push(curr2);
            }
        }
    }
    while(k)
    {
        k--;
        cout<<-1<<'\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'node special(node)':
Main.cpp:36:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   36 |     int g,g2;
      |         ^
Main.cpp: In function 'node godown(node)':
Main.cpp:72:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   72 |     int g,g2;
      |         ^
Main.cpp: In function 'int main()':
Main.cpp:137:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:161:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |                 for(int j=0; j<adj[i].size(); j++)
      |                              ~^~~~~~~~~~~~~~
Main.cpp:169:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  169 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:183:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  183 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 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 4 ms 8536 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8668 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8112 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 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 8384 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 4 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 57 ms 25900 KB Output is correct
2 Correct 75 ms 25780 KB Output is correct
3 Correct 61 ms 27476 KB Output is correct
4 Correct 59 ms 26604 KB Output is correct
5 Correct 52 ms 17580 KB Output is correct
6 Correct 59 ms 18104 KB Output is correct
7 Correct 62 ms 25516 KB Output is correct
8 Correct 55 ms 25528 KB Output is correct
9 Correct 13 ms 8540 KB Output is correct
10 Correct 60 ms 26040 KB Output is correct
11 Correct 12 ms 8536 KB Output is correct
12 Correct 27 ms 9680 KB Output is correct
13 Correct 62 ms 27576 KB Output is correct
14 Correct 59 ms 25840 KB Output is correct
15 Correct 13 ms 8796 KB Output is correct
16 Correct 67 ms 26364 KB Output is correct
17 Correct 60 ms 25784 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 60 ms 25788 KB Output is correct
20 Correct 59 ms 26284 KB Output is correct
21 Correct 12 ms 8796 KB Output is correct
22 Correct 68 ms 17816 KB Output is correct
23 Correct 57 ms 25264 KB Output is correct
24 Correct 12 ms 8540 KB Output is correct
25 Correct 15 ms 8568 KB Output is correct
26 Correct 47 ms 18368 KB Output is correct
27 Correct 46 ms 18360 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 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 4 ms 8536 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8668 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8112 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 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 8384 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 57 ms 25900 KB Output is correct
30 Correct 75 ms 25780 KB Output is correct
31 Correct 61 ms 27476 KB Output is correct
32 Correct 59 ms 26604 KB Output is correct
33 Correct 52 ms 17580 KB Output is correct
34 Correct 59 ms 18104 KB Output is correct
35 Correct 62 ms 25516 KB Output is correct
36 Correct 55 ms 25528 KB Output is correct
37 Correct 13 ms 8540 KB Output is correct
38 Correct 60 ms 26040 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 27 ms 9680 KB Output is correct
41 Correct 62 ms 27576 KB Output is correct
42 Correct 59 ms 25840 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 67 ms 26364 KB Output is correct
45 Correct 60 ms 25784 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 60 ms 25788 KB Output is correct
48 Correct 59 ms 26284 KB Output is correct
49 Correct 12 ms 8796 KB Output is correct
50 Correct 68 ms 17816 KB Output is correct
51 Correct 57 ms 25264 KB Output is correct
52 Correct 12 ms 8540 KB Output is correct
53 Correct 15 ms 8568 KB Output is correct
54 Correct 47 ms 18368 KB Output is correct
55 Correct 46 ms 18360 KB Output is correct
56 Correct 134 ms 33592 KB Output is correct
57 Correct 127 ms 30524 KB Output is correct
58 Correct 130 ms 31796 KB Output is correct
59 Correct 117 ms 29972 KB Output is correct
60 Correct 134 ms 24236 KB Output is correct
61 Correct 129 ms 32380 KB Output is correct
62 Correct 113 ms 28876 KB Output is correct
63 Correct 102 ms 28136 KB Output is correct
64 Correct 55 ms 10940 KB Output is correct
65 Correct 123 ms 30520 KB Output is correct
66 Correct 46 ms 11344 KB Output is correct
67 Correct 49 ms 12236 KB Output is correct
68 Correct 73 ms 26800 KB Output is correct
69 Correct 133 ms 30772 KB Output is correct
70 Correct 15 ms 9048 KB Output is correct
71 Correct 69 ms 26812 KB Output is correct
72 Correct 133 ms 30796 KB Output is correct
73 Correct 15 ms 9048 KB Output is correct
74 Correct 68 ms 18972 KB Output is correct
75 Correct 137 ms 33076 KB Output is correct
76 Correct 13 ms 9052 KB Output is correct
77 Correct 59 ms 18644 KB Output is correct
78 Correct 101 ms 27312 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 10712 KB Output is correct
2 Correct 37 ms 9552 KB Output is correct
3 Correct 13 ms 8796 KB Output is correct
4 Correct 14 ms 8796 KB Output is correct
5 Correct 141 ms 30516 KB Output is correct
6 Correct 151 ms 30008 KB Output is correct
7 Correct 141 ms 29748 KB Output is correct
8 Correct 137 ms 28948 KB Output is correct
9 Correct 152 ms 31800 KB Output is correct
10 Correct 157 ms 31008 KB Output is correct
11 Correct 128 ms 28220 KB Output is correct
12 Correct 138 ms 29872 KB Output is correct
13 Correct 100 ms 12108 KB Output is correct
14 Correct 144 ms 29496 KB Output is correct
15 Correct 148 ms 29368 KB Output is correct
16 Correct 77 ms 19136 KB Output is correct
17 Correct 70 ms 26036 KB Output is correct
18 Correct 142 ms 29488 KB Output is correct
19 Correct 68 ms 26548 KB Output is correct
20 Correct 74 ms 25804 KB Output is correct
21 Correct 135 ms 30012 KB Output is correct
22 Correct 58 ms 19140 KB Output is correct
23 Correct 94 ms 27488 KB Output is correct
24 Correct 145 ms 32052 KB Output is correct
25 Correct 63 ms 27436 KB Output is correct
26 Correct 58 ms 26560 KB Output is correct
27 Correct 123 ms 28292 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8536 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 5 ms 8536 KB Output is correct
7 Correct 4 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 4 ms 8536 KB Output is correct
11 Correct 3 ms 8024 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 5 ms 8668 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8284 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 5 ms 8540 KB Output is correct
18 Correct 3 ms 8112 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 5 ms 8540 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 8384 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8280 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 57 ms 25900 KB Output is correct
30 Correct 75 ms 25780 KB Output is correct
31 Correct 61 ms 27476 KB Output is correct
32 Correct 59 ms 26604 KB Output is correct
33 Correct 52 ms 17580 KB Output is correct
34 Correct 59 ms 18104 KB Output is correct
35 Correct 62 ms 25516 KB Output is correct
36 Correct 55 ms 25528 KB Output is correct
37 Correct 13 ms 8540 KB Output is correct
38 Correct 60 ms 26040 KB Output is correct
39 Correct 12 ms 8536 KB Output is correct
40 Correct 27 ms 9680 KB Output is correct
41 Correct 62 ms 27576 KB Output is correct
42 Correct 59 ms 25840 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 67 ms 26364 KB Output is correct
45 Correct 60 ms 25784 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 60 ms 25788 KB Output is correct
48 Correct 59 ms 26284 KB Output is correct
49 Correct 12 ms 8796 KB Output is correct
50 Correct 68 ms 17816 KB Output is correct
51 Correct 57 ms 25264 KB Output is correct
52 Correct 12 ms 8540 KB Output is correct
53 Correct 15 ms 8568 KB Output is correct
54 Correct 47 ms 18368 KB Output is correct
55 Correct 46 ms 18360 KB Output is correct
56 Correct 134 ms 33592 KB Output is correct
57 Correct 127 ms 30524 KB Output is correct
58 Correct 130 ms 31796 KB Output is correct
59 Correct 117 ms 29972 KB Output is correct
60 Correct 134 ms 24236 KB Output is correct
61 Correct 129 ms 32380 KB Output is correct
62 Correct 113 ms 28876 KB Output is correct
63 Correct 102 ms 28136 KB Output is correct
64 Correct 55 ms 10940 KB Output is correct
65 Correct 123 ms 30520 KB Output is correct
66 Correct 46 ms 11344 KB Output is correct
67 Correct 49 ms 12236 KB Output is correct
68 Correct 73 ms 26800 KB Output is correct
69 Correct 133 ms 30772 KB Output is correct
70 Correct 15 ms 9048 KB Output is correct
71 Correct 69 ms 26812 KB Output is correct
72 Correct 133 ms 30796 KB Output is correct
73 Correct 15 ms 9048 KB Output is correct
74 Correct 68 ms 18972 KB Output is correct
75 Correct 137 ms 33076 KB Output is correct
76 Correct 13 ms 9052 KB Output is correct
77 Correct 59 ms 18644 KB Output is correct
78 Correct 101 ms 27312 KB Output is correct
79 Correct 41 ms 10712 KB Output is correct
80 Correct 37 ms 9552 KB Output is correct
81 Correct 13 ms 8796 KB Output is correct
82 Correct 14 ms 8796 KB Output is correct
83 Correct 141 ms 30516 KB Output is correct
84 Correct 151 ms 30008 KB Output is correct
85 Correct 141 ms 29748 KB Output is correct
86 Correct 137 ms 28948 KB Output is correct
87 Correct 152 ms 31800 KB Output is correct
88 Correct 157 ms 31008 KB Output is correct
89 Correct 128 ms 28220 KB Output is correct
90 Correct 138 ms 29872 KB Output is correct
91 Correct 100 ms 12108 KB Output is correct
92 Correct 144 ms 29496 KB Output is correct
93 Correct 148 ms 29368 KB Output is correct
94 Correct 77 ms 19136 KB Output is correct
95 Correct 70 ms 26036 KB Output is correct
96 Correct 142 ms 29488 KB Output is correct
97 Correct 68 ms 26548 KB Output is correct
98 Correct 74 ms 25804 KB Output is correct
99 Correct 135 ms 30012 KB Output is correct
100 Correct 58 ms 19140 KB Output is correct
101 Correct 94 ms 27488 KB Output is correct
102 Correct 145 ms 32052 KB Output is correct
103 Correct 63 ms 27436 KB Output is correct
104 Correct 58 ms 26560 KB Output is correct
105 Correct 123 ms 28292 KB Output is correct
106 Correct 37 ms 9248 KB Output is correct
107 Correct 41 ms 10952 KB Output is correct
108 Correct 38 ms 9840 KB Output is correct
109 Correct 40 ms 10692 KB Output is correct
110 Correct 151 ms 32316 KB Output is correct
111 Correct 154 ms 30764 KB Output is correct
112 Correct 154 ms 31800 KB Output is correct
113 Correct 153 ms 31536 KB Output is correct
114 Correct 166 ms 32824 KB Output is correct
115 Correct 160 ms 30620 KB Output is correct
116 Correct 169 ms 46260 KB Output is correct
117 Correct 155 ms 29596 KB Output is correct
118 Correct 109 ms 14152 KB Output is correct
119 Correct 52 ms 11376 KB Output is correct
120 Correct 161 ms 30208 KB Output is correct
121 Correct 73 ms 27340 KB Output is correct
122 Correct 76 ms 27116 KB Output is correct
123 Correct 154 ms 31352 KB Output is correct
124 Correct 64 ms 18364 KB Output is correct
125 Correct 76 ms 27056 KB Output is correct
126 Correct 139 ms 31792 KB Output is correct
127 Correct 60 ms 17604 KB Output is correct
128 Correct 71 ms 27320 KB Output is correct
129 Correct 160 ms 32312 KB Output is correct
130 Correct 83 ms 26572 KB Output is correct
131 Correct 79 ms 27644 KB Output is correct
132 Correct 135 ms 30056 KB Output is correct