oj.uz

답안 #988035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988035 2024-05-23T20:48:13 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 188 ms 49948 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 5724 KB Output is correct
3 Correct 5 ms 5756 KB Output is correct
4 Correct 5 ms 5720 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 5 ms 5688 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5556 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 5768 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5508 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5208 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 23220 KB Output is correct
2 Correct 63 ms 22960 KB Output is correct
3 Correct 65 ms 22952 KB Output is correct
4 Correct 62 ms 23224 KB Output is correct
5 Correct 54 ms 14772 KB Output is correct
6 Correct 55 ms 14528 KB Output is correct
7 Correct 63 ms 22704 KB Output is correct
8 Correct 58 ms 22480 KB Output is correct
9 Correct 13 ms 5720 KB Output is correct
10 Correct 61 ms 22964 KB Output is correct
11 Correct 13 ms 5796 KB Output is correct
12 Correct 27 ms 6604 KB Output is correct
13 Correct 64 ms 22704 KB Output is correct
14 Correct 61 ms 22920 KB Output is correct
15 Correct 13 ms 5832 KB Output is correct
16 Correct 62 ms 22652 KB Output is correct
17 Correct 62 ms 22964 KB Output is correct
18 Correct 20 ms 6312 KB Output is correct
19 Correct 61 ms 22924 KB Output is correct
20 Correct 60 ms 23212 KB Output is correct
21 Correct 13 ms 5720 KB Output is correct
22 Correct 58 ms 14016 KB Output is correct
23 Correct 58 ms 22304 KB Output is correct
24 Correct 13 ms 5720 KB Output is correct
25 Correct 14 ms 5724 KB Output is correct
26 Correct 49 ms 14524 KB Output is correct
27 Correct 49 ms 14528 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 5724 KB Output is correct
3 Correct 5 ms 5756 KB Output is correct
4 Correct 5 ms 5720 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 5 ms 5688 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5556 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 5768 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5508 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5208 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 59 ms 23220 KB Output is correct
30 Correct 63 ms 22960 KB Output is correct
31 Correct 65 ms 22952 KB Output is correct
32 Correct 62 ms 23224 KB Output is correct
33 Correct 54 ms 14772 KB Output is correct
34 Correct 55 ms 14528 KB Output is correct
35 Correct 63 ms 22704 KB Output is correct
36 Correct 58 ms 22480 KB Output is correct
37 Correct 13 ms 5720 KB Output is correct
38 Correct 61 ms 22964 KB Output is correct
39 Correct 13 ms 5796 KB Output is correct
40 Correct 27 ms 6604 KB Output is correct
41 Correct 64 ms 22704 KB Output is correct
42 Correct 61 ms 22920 KB Output is correct
43 Correct 13 ms 5832 KB Output is correct
44 Correct 62 ms 22652 KB Output is correct
45 Correct 62 ms 22964 KB Output is correct
46 Correct 20 ms 6312 KB Output is correct
47 Correct 61 ms 22924 KB Output is correct
48 Correct 60 ms 23212 KB Output is correct
49 Correct 13 ms 5720 KB Output is correct
50 Correct 58 ms 14016 KB Output is correct
51 Correct 58 ms 22304 KB Output is correct
52 Correct 13 ms 5720 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 49 ms 14524 KB Output is correct
55 Correct 49 ms 14528 KB Output is correct
56 Correct 147 ms 34480 KB Output is correct
57 Correct 147 ms 31532 KB Output is correct
58 Correct 134 ms 32684 KB Output is correct
59 Correct 127 ms 30128 KB Output is correct
60 Correct 148 ms 26872 KB Output is correct
61 Correct 133 ms 32436 KB Output is correct
62 Correct 119 ms 28384 KB Output is correct
63 Correct 105 ms 25884 KB Output is correct
64 Correct 55 ms 10196 KB Output is correct
65 Correct 136 ms 31560 KB Output is correct
66 Correct 53 ms 11728 KB Output is correct
67 Correct 52 ms 9160 KB Output is correct
68 Correct 75 ms 23472 KB Output is correct
69 Correct 142 ms 32432 KB Output is correct
70 Correct 14 ms 5976 KB Output is correct
71 Correct 74 ms 23476 KB Output is correct
72 Correct 127 ms 29928 KB Output is correct
73 Correct 13 ms 5720 KB Output is correct
74 Correct 66 ms 15796 KB Output is correct
75 Correct 136 ms 34968 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 60 ms 14536 KB Output is correct
78 Correct 109 ms 26328 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7636 KB Output is correct
2 Correct 36 ms 6616 KB Output is correct
3 Correct 14 ms 5864 KB Output is correct
4 Correct 13 ms 5980 KB Output is correct
5 Correct 157 ms 34236 KB Output is correct
6 Correct 146 ms 33116 KB Output is correct
7 Correct 152 ms 33708 KB Output is correct
8 Correct 144 ms 32680 KB Output is correct
9 Correct 151 ms 34436 KB Output is correct
10 Correct 146 ms 32804 KB Output is correct
11 Correct 143 ms 31536 KB Output is correct
12 Correct 122 ms 30644 KB Output is correct
13 Correct 103 ms 15312 KB Output is correct
14 Correct 153 ms 32940 KB Output is correct
15 Correct 146 ms 32956 KB Output is correct
16 Correct 70 ms 15028 KB Output is correct
17 Correct 73 ms 22960 KB Output is correct
18 Correct 151 ms 33444 KB Output is correct
19 Correct 69 ms 23372 KB Output is correct
20 Correct 73 ms 22972 KB Output is correct
21 Correct 166 ms 32592 KB Output is correct
22 Correct 60 ms 14776 KB Output is correct
23 Correct 73 ms 23224 KB Output is correct
24 Correct 179 ms 34436 KB Output is correct
25 Correct 62 ms 23496 KB Output is correct
26 Correct 60 ms 23472 KB Output is correct
27 Correct 139 ms 30340 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 5724 KB Output is correct
3 Correct 5 ms 5756 KB Output is correct
4 Correct 5 ms 5720 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5592 KB Output is correct
8 Correct 5 ms 5592 KB Output is correct
9 Correct 5 ms 5468 KB Output is correct
10 Correct 6 ms 5724 KB Output is correct
11 Correct 4 ms 5212 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 5 ms 5688 KB Output is correct
15 Correct 4 ms 5212 KB Output is correct
16 Correct 4 ms 5556 KB Output is correct
17 Correct 7 ms 5724 KB Output is correct
18 Correct 4 ms 5212 KB Output is correct
19 Correct 4 ms 5464 KB Output is correct
20 Correct 6 ms 5768 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5508 KB Output is correct
23 Correct 5 ms 5592 KB Output is correct
24 Correct 4 ms 5208 KB Output is correct
25 Correct 4 ms 5212 KB Output is correct
26 Correct 5 ms 5724 KB Output is correct
27 Correct 5 ms 5588 KB Output is correct
28 Correct 5 ms 5468 KB Output is correct
29 Correct 59 ms 23220 KB Output is correct
30 Correct 63 ms 22960 KB Output is correct
31 Correct 65 ms 22952 KB Output is correct
32 Correct 62 ms 23224 KB Output is correct
33 Correct 54 ms 14772 KB Output is correct
34 Correct 55 ms 14528 KB Output is correct
35 Correct 63 ms 22704 KB Output is correct
36 Correct 58 ms 22480 KB Output is correct
37 Correct 13 ms 5720 KB Output is correct
38 Correct 61 ms 22964 KB Output is correct
39 Correct 13 ms 5796 KB Output is correct
40 Correct 27 ms 6604 KB Output is correct
41 Correct 64 ms 22704 KB Output is correct
42 Correct 61 ms 22920 KB Output is correct
43 Correct 13 ms 5832 KB Output is correct
44 Correct 62 ms 22652 KB Output is correct
45 Correct 62 ms 22964 KB Output is correct
46 Correct 20 ms 6312 KB Output is correct
47 Correct 61 ms 22924 KB Output is correct
48 Correct 60 ms 23212 KB Output is correct
49 Correct 13 ms 5720 KB Output is correct
50 Correct 58 ms 14016 KB Output is correct
51 Correct 58 ms 22304 KB Output is correct
52 Correct 13 ms 5720 KB Output is correct
53 Correct 14 ms 5724 KB Output is correct
54 Correct 49 ms 14524 KB Output is correct
55 Correct 49 ms 14528 KB Output is correct
56 Correct 147 ms 34480 KB Output is correct
57 Correct 147 ms 31532 KB Output is correct
58 Correct 134 ms 32684 KB Output is correct
59 Correct 127 ms 30128 KB Output is correct
60 Correct 148 ms 26872 KB Output is correct
61 Correct 133 ms 32436 KB Output is correct
62 Correct 119 ms 28384 KB Output is correct
63 Correct 105 ms 25884 KB Output is correct
64 Correct 55 ms 10196 KB Output is correct
65 Correct 136 ms 31560 KB Output is correct
66 Correct 53 ms 11728 KB Output is correct
67 Correct 52 ms 9160 KB Output is correct
68 Correct 75 ms 23472 KB Output is correct
69 Correct 142 ms 32432 KB Output is correct
70 Correct 14 ms 5976 KB Output is correct
71 Correct 74 ms 23476 KB Output is correct
72 Correct 127 ms 29928 KB Output is correct
73 Correct 13 ms 5720 KB Output is correct
74 Correct 66 ms 15796 KB Output is correct
75 Correct 136 ms 34968 KB Output is correct
76 Correct 13 ms 5720 KB Output is correct
77 Correct 60 ms 14536 KB Output is correct
78 Correct 109 ms 26328 KB Output is correct
79 Correct 40 ms 7636 KB Output is correct
80 Correct 36 ms 6616 KB Output is correct
81 Correct 14 ms 5864 KB Output is correct
82 Correct 13 ms 5980 KB Output is correct
83 Correct 157 ms 34236 KB Output is correct
84 Correct 146 ms 33116 KB Output is correct
85 Correct 152 ms 33708 KB Output is correct
86 Correct 144 ms 32680 KB Output is correct
87 Correct 151 ms 34436 KB Output is correct
88 Correct 146 ms 32804 KB Output is correct
89 Correct 143 ms 31536 KB Output is correct
90 Correct 122 ms 30644 KB Output is correct
91 Correct 103 ms 15312 KB Output is correct
92 Correct 153 ms 32940 KB Output is correct
93 Correct 146 ms 32956 KB Output is correct
94 Correct 70 ms 15028 KB Output is correct
95 Correct 73 ms 22960 KB Output is correct
96 Correct 151 ms 33444 KB Output is correct
97 Correct 69 ms 23372 KB Output is correct
98 Correct 73 ms 22972 KB Output is correct
99 Correct 166 ms 32592 KB Output is correct
100 Correct 60 ms 14776 KB Output is correct
101 Correct 73 ms 23224 KB Output is correct
102 Correct 179 ms 34436 KB Output is correct
103 Correct 62 ms 23496 KB Output is correct
104 Correct 60 ms 23472 KB Output is correct
105 Correct 139 ms 30340 KB Output is correct
106 Correct 36 ms 6360 KB Output is correct
107 Correct 42 ms 7880 KB Output is correct
108 Correct 38 ms 6856 KB Output is correct
109 Correct 41 ms 7876 KB Output is correct
110 Correct 184 ms 35440 KB Output is correct
111 Correct 188 ms 34504 KB Output is correct
112 Correct 158 ms 34176 KB Output is correct
113 Correct 154 ms 33200 KB Output is correct
114 Correct 162 ms 35500 KB Output is correct
115 Correct 179 ms 33980 KB Output is correct
116 Correct 170 ms 49948 KB Output is correct
117 Correct 137 ms 31364 KB Output is correct
118 Correct 117 ms 17476 KB Output is correct
119 Correct 52 ms 11860 KB Output is correct
120 Correct 160 ms 33696 KB Output is correct
121 Correct 69 ms 23388 KB Output is correct
122 Correct 80 ms 23476 KB Output is correct
123 Correct 161 ms 34496 KB Output is correct
124 Correct 67 ms 15536 KB Output is correct
125 Correct 88 ms 23244 KB Output is correct
126 Correct 151 ms 33956 KB Output is correct
127 Correct 61 ms 14532 KB Output is correct
128 Correct 80 ms 23764 KB Output is correct
129 Correct 158 ms 36192 KB Output is correct
130 Correct 67 ms 23400 KB Output is correct
131 Correct 77 ms 23248 KB Output is correct
132 Correct 139 ms 31896 KB Output is correct