oj.uz

답안 #988003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988003 2024-05-23T20:17:47 Z Popi_Este_Un_Clovn Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 178 ms 46244 KB 
///OWNERUL LUI ADI <3
#include <bits/stdc++.h>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
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;
}
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.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:126:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  126 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:146:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |                 for(j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:152:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  152 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:162:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:170:15: warning: unused variable 'curr2' [-Wunused-variable]
  170 |     node curr,curr2;
      |               ^~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 26036 KB Output is correct
2 Correct 64 ms 25792 KB Output is correct
3 Correct 69 ms 25860 KB Output is correct
4 Correct 63 ms 25748 KB Output is correct
5 Correct 56 ms 14712 KB Output is correct
6 Correct 56 ms 17300 KB Output is correct
7 Correct 64 ms 25644 KB Output is correct
8 Correct 57 ms 25516 KB Output is correct
9 Correct 12 ms 8540 KB Output is correct
10 Correct 64 ms 25808 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 27 ms 9688 KB Output is correct
13 Correct 64 ms 25648 KB Output is correct
14 Correct 62 ms 25780 KB Output is correct
15 Correct 12 ms 8792 KB Output is correct
16 Correct 63 ms 23476 KB Output is correct
17 Correct 72 ms 25772 KB Output is correct
18 Correct 19 ms 9180 KB Output is correct
19 Correct 67 ms 25864 KB Output is correct
20 Correct 61 ms 26280 KB Output is correct
21 Correct 12 ms 8792 KB Output is correct
22 Correct 59 ms 13968 KB Output is correct
23 Correct 61 ms 22196 KB Output is correct
24 Correct 13 ms 5724 KB Output is correct
25 Correct 13 ms 5724 KB Output is correct
26 Correct 50 ms 17400 KB Output is correct
27 Correct 50 ms 17340 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5588 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8584 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8088 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 4 ms 5592 KB Output is correct
15 Correct 4 ms 5464 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 6 ms 8540 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 61 ms 26036 KB Output is correct
30 Correct 64 ms 25792 KB Output is correct
31 Correct 69 ms 25860 KB Output is correct
32 Correct 63 ms 25748 KB Output is correct
33 Correct 56 ms 14712 KB Output is correct
34 Correct 56 ms 17300 KB Output is correct
35 Correct 64 ms 25644 KB Output is correct
36 Correct 57 ms 25516 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 64 ms 25808 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 9688 KB Output is correct
41 Correct 64 ms 25648 KB Output is correct
42 Correct 62 ms 25780 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 63 ms 23476 KB Output is correct
45 Correct 72 ms 25772 KB Output is correct
46 Correct 19 ms 9180 KB Output is correct
47 Correct 67 ms 25864 KB Output is correct
48 Correct 61 ms 26280 KB Output is correct
49 Correct 12 ms 8792 KB Output is correct
50 Correct 59 ms 13968 KB Output is correct
51 Correct 61 ms 22196 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 50 ms 17400 KB Output is correct
55 Correct 50 ms 17340 KB Output is correct
56 Correct 169 ms 32048 KB Output is correct
57 Correct 135 ms 30020 KB Output is correct
58 Correct 133 ms 30780 KB Output is correct
59 Correct 134 ms 29480 KB Output is correct
60 Correct 169 ms 24088 KB Output is correct
61 Correct 129 ms 30816 KB Output is correct
62 Correct 134 ms 28076 KB Output is correct
63 Correct 107 ms 26640 KB Output is correct
64 Correct 66 ms 10960 KB Output is correct
65 Correct 130 ms 30016 KB Output is correct
66 Correct 49 ms 11240 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 94 ms 26308 KB Output is correct
69 Correct 135 ms 30508 KB Output is correct
70 Correct 14 ms 9024 KB Output is correct
71 Correct 74 ms 23480 KB Output is correct
72 Correct 135 ms 29200 KB Output is correct
73 Correct 14 ms 8796 KB Output is correct
74 Correct 67 ms 18616 KB Output is correct
75 Correct 143 ms 32312 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 62 ms 14540 KB Output is correct
78 Correct 105 ms 26792 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 10700 KB Output is correct
2 Correct 39 ms 9824 KB Output is correct
3 Correct 13 ms 5656 KB Output is correct
4 Correct 13 ms 6132 KB Output is correct
5 Correct 157 ms 30548 KB Output is correct
6 Correct 142 ms 29244 KB Output is correct
7 Correct 146 ms 29752 KB Output is correct
8 Correct 139 ms 28820 KB Output is correct
9 Correct 160 ms 30836 KB Output is correct
10 Correct 145 ms 29240 KB Output is correct
11 Correct 138 ms 27788 KB Output is correct
12 Correct 122 ms 28656 KB Output is correct
13 Correct 98 ms 12116 KB Output is correct
14 Correct 147 ms 29228 KB Output is correct
15 Correct 151 ms 29228 KB Output is correct
16 Correct 61 ms 17848 KB Output is correct
17 Correct 78 ms 26032 KB Output is correct
18 Correct 149 ms 29500 KB Output is correct
19 Correct 74 ms 26216 KB Output is correct
20 Correct 74 ms 23052 KB Output is correct
21 Correct 134 ms 28724 KB Output is correct
22 Correct 68 ms 17852 KB Output is correct
23 Correct 81 ms 26100 KB Output is correct
24 Correct 173 ms 30636 KB Output is correct
25 Correct 64 ms 26316 KB Output is correct
26 Correct 69 ms 26316 KB Output is correct
27 Correct 124 ms 28044 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 5 ms 5592 KB Output is correct
3 Correct 5 ms 5588 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 5 ms 8540 KB Output is correct
6 Correct 5 ms 8584 KB Output is correct
7 Correct 4 ms 8536 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 3 ms 8088 KB Output is correct
10 Correct 5 ms 8536 KB Output is correct
11 Correct 3 ms 8028 KB Output is correct
12 Correct 4 ms 5212 KB Output is correct
13 Correct 4 ms 5468 KB Output is correct
14 Correct 4 ms 5592 KB Output is correct
15 Correct 4 ms 5464 KB Output is correct
16 Correct 4 ms 5468 KB Output is correct
17 Correct 6 ms 8540 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 4 ms 5468 KB Output is correct
20 Correct 5 ms 8536 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 4 ms 5468 KB Output is correct
23 Correct 4 ms 5468 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 5208 KB Output is correct
26 Correct 5 ms 5592 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 5468 KB Output is correct
29 Correct 61 ms 26036 KB Output is correct
30 Correct 64 ms 25792 KB Output is correct
31 Correct 69 ms 25860 KB Output is correct
32 Correct 63 ms 25748 KB Output is correct
33 Correct 56 ms 14712 KB Output is correct
34 Correct 56 ms 17300 KB Output is correct
35 Correct 64 ms 25644 KB Output is correct
36 Correct 57 ms 25516 KB Output is correct
37 Correct 12 ms 8540 KB Output is correct
38 Correct 64 ms 25808 KB Output is correct
39 Correct 12 ms 8540 KB Output is correct
40 Correct 27 ms 9688 KB Output is correct
41 Correct 64 ms 25648 KB Output is correct
42 Correct 62 ms 25780 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 63 ms 23476 KB Output is correct
45 Correct 72 ms 25772 KB Output is correct
46 Correct 19 ms 9180 KB Output is correct
47 Correct 67 ms 25864 KB Output is correct
48 Correct 61 ms 26280 KB Output is correct
49 Correct 12 ms 8792 KB Output is correct
50 Correct 59 ms 13968 KB Output is correct
51 Correct 61 ms 22196 KB Output is correct
52 Correct 13 ms 5724 KB Output is correct
53 Correct 13 ms 5724 KB Output is correct
54 Correct 50 ms 17400 KB Output is correct
55 Correct 50 ms 17340 KB Output is correct
56 Correct 169 ms 32048 KB Output is correct
57 Correct 135 ms 30020 KB Output is correct
58 Correct 133 ms 30780 KB Output is correct
59 Correct 134 ms 29480 KB Output is correct
60 Correct 169 ms 24088 KB Output is correct
61 Correct 129 ms 30816 KB Output is correct
62 Correct 134 ms 28076 KB Output is correct
63 Correct 107 ms 26640 KB Output is correct
64 Correct 66 ms 10960 KB Output is correct
65 Correct 130 ms 30016 KB Output is correct
66 Correct 49 ms 11240 KB Output is correct
67 Correct 49 ms 12232 KB Output is correct
68 Correct 94 ms 26308 KB Output is correct
69 Correct 135 ms 30508 KB Output is correct
70 Correct 14 ms 9024 KB Output is correct
71 Correct 74 ms 23480 KB Output is correct
72 Correct 135 ms 29200 KB Output is correct
73 Correct 14 ms 8796 KB Output is correct
74 Correct 67 ms 18616 KB Output is correct
75 Correct 143 ms 32312 KB Output is correct
76 Correct 14 ms 8540 KB Output is correct
77 Correct 62 ms 14540 KB Output is correct
78 Correct 105 ms 26792 KB Output is correct
79 Correct 40 ms 10700 KB Output is correct
80 Correct 39 ms 9824 KB Output is correct
81 Correct 13 ms 5656 KB Output is correct
82 Correct 13 ms 6132 KB Output is correct
83 Correct 157 ms 30548 KB Output is correct
84 Correct 142 ms 29244 KB Output is correct
85 Correct 146 ms 29752 KB Output is correct
86 Correct 139 ms 28820 KB Output is correct
87 Correct 160 ms 30836 KB Output is correct
88 Correct 145 ms 29240 KB Output is correct
89 Correct 138 ms 27788 KB Output is correct
90 Correct 122 ms 28656 KB Output is correct
91 Correct 98 ms 12116 KB Output is correct
92 Correct 147 ms 29228 KB Output is correct
93 Correct 151 ms 29228 KB Output is correct
94 Correct 61 ms 17848 KB Output is correct
95 Correct 78 ms 26032 KB Output is correct
96 Correct 149 ms 29500 KB Output is correct
97 Correct 74 ms 26216 KB Output is correct
98 Correct 74 ms 23052 KB Output is correct
99 Correct 134 ms 28724 KB Output is correct
100 Correct 68 ms 17852 KB Output is correct
101 Correct 81 ms 26100 KB Output is correct
102 Correct 173 ms 30636 KB Output is correct
103 Correct 64 ms 26316 KB Output is correct
104 Correct 69 ms 26316 KB Output is correct
105 Correct 124 ms 28044 KB Output is correct
106 Correct 35 ms 9184 KB Output is correct
107 Correct 41 ms 11024 KB Output is correct
108 Correct 37 ms 9680 KB Output is correct
109 Correct 41 ms 10572 KB Output is correct
110 Correct 156 ms 31488 KB Output is correct
111 Correct 163 ms 30760 KB Output is correct
112 Correct 157 ms 30516 KB Output is correct
113 Correct 151 ms 29572 KB Output is correct
114 Correct 155 ms 31908 KB Output is correct
115 Correct 157 ms 30200 KB Output is correct
116 Correct 165 ms 46244 KB Output is correct
117 Correct 136 ms 28192 KB Output is correct
118 Correct 116 ms 14308 KB Output is correct
119 Correct 50 ms 11348 KB Output is correct
120 Correct 178 ms 29992 KB Output is correct
121 Correct 83 ms 26320 KB Output is correct
122 Correct 77 ms 26452 KB Output is correct
123 Correct 165 ms 30648 KB Output is correct
124 Correct 64 ms 18368 KB Output is correct
125 Correct 83 ms 25976 KB Output is correct
126 Correct 142 ms 29992 KB Output is correct
127 Correct 60 ms 17652 KB Output is correct
128 Correct 74 ms 26544 KB Output is correct
129 Correct 152 ms 32304 KB Output is correct
130 Correct 70 ms 26236 KB Output is correct
131 Correct 79 ms 26288 KB Output is correct
132 Correct 135 ms 28328 KB Output is correct