oj.uz

답안 #987988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987988 2024-05-23T20:08:24 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
25 / 25
 264 ms 46256 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 8536 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 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 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 3 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 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 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 5180 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8268 KB Output is correct
26 Correct 4 ms 6492 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 26036 KB Output is correct
2 Correct 64 ms 25780 KB Output is correct
3 Correct 64 ms 25696 KB Output is correct
4 Correct 63 ms 25860 KB Output is correct
5 Correct 57 ms 17868 KB Output is correct
6 Correct 54 ms 17352 KB Output is correct
7 Correct 74 ms 25524 KB Output is correct
8 Correct 61 ms 25376 KB Output is correct
9 Correct 12 ms 8536 KB Output is correct
10 Correct 62 ms 25784 KB Output is correct
11 Correct 12 ms 8600 KB Output is correct
12 Correct 28 ms 9676 KB Output is correct
13 Correct 70 ms 25528 KB Output is correct
14 Correct 65 ms 25780 KB Output is correct
15 Correct 12 ms 8792 KB Output is correct
16 Correct 71 ms 25752 KB Output is correct
17 Correct 64 ms 25784 KB Output is correct
18 Correct 20 ms 9180 KB Output is correct
19 Correct 64 ms 25952 KB Output is correct
20 Correct 62 ms 26284 KB Output is correct
21 Correct 13 ms 8792 KB Output is correct
22 Correct 58 ms 13876 KB Output is correct
23 Correct 58 ms 25260 KB Output is correct
24 Correct 12 ms 8540 KB Output is correct
25 Correct 12 ms 8540 KB Output is correct
26 Correct 52 ms 17344 KB Output is correct
27 Correct 61 ms 17592 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 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 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 3 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 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 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 5180 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8268 KB Output is correct
26 Correct 4 ms 6492 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 26036 KB Output is correct
30 Correct 64 ms 25780 KB Output is correct
31 Correct 64 ms 25696 KB Output is correct
32 Correct 63 ms 25860 KB Output is correct
33 Correct 57 ms 17868 KB Output is correct
34 Correct 54 ms 17352 KB Output is correct
35 Correct 74 ms 25524 KB Output is correct
36 Correct 61 ms 25376 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 62 ms 25784 KB Output is correct
39 Correct 12 ms 8600 KB Output is correct
40 Correct 28 ms 9676 KB Output is correct
41 Correct 70 ms 25528 KB Output is correct
42 Correct 65 ms 25780 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 71 ms 25752 KB Output is correct
45 Correct 64 ms 25784 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 64 ms 25952 KB Output is correct
48 Correct 62 ms 26284 KB Output is correct
49 Correct 13 ms 8792 KB Output is correct
50 Correct 58 ms 13876 KB Output is correct
51 Correct 58 ms 25260 KB Output is correct
52 Correct 12 ms 8540 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 52 ms 17344 KB Output is correct
55 Correct 61 ms 17592 KB Output is correct
56 Correct 138 ms 32048 KB Output is correct
57 Correct 138 ms 30020 KB Output is correct
58 Correct 155 ms 30692 KB Output is correct
59 Correct 126 ms 29108 KB Output is correct
60 Correct 129 ms 24092 KB Output is correct
61 Correct 136 ms 30644 KB Output is correct
62 Correct 119 ms 28124 KB Output is correct
63 Correct 105 ms 26556 KB Output is correct
64 Correct 54 ms 10964 KB Output is correct
65 Correct 130 ms 30028 KB Output is correct
66 Correct 48 ms 11344 KB Output is correct
67 Correct 50 ms 12232 KB Output is correct
68 Correct 79 ms 26512 KB Output is correct
69 Correct 148 ms 30520 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 75 ms 26596 KB Output is correct
72 Correct 131 ms 29052 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 68 ms 18600 KB Output is correct
75 Correct 143 ms 32420 KB Output is correct
76 Correct 16 ms 8536 KB Output is correct
77 Correct 60 ms 17352 KB Output is correct
78 Correct 106 ms 26796 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 10704 KB Output is correct
2 Correct 34 ms 9432 KB Output is correct
3 Correct 13 ms 8792 KB Output is correct
4 Correct 13 ms 8792 KB Output is correct
5 Correct 180 ms 30692 KB Output is correct
6 Correct 168 ms 29248 KB Output is correct
7 Correct 140 ms 29740 KB Output is correct
8 Correct 142 ms 28720 KB Output is correct
9 Correct 148 ms 30792 KB Output is correct
10 Correct 169 ms 29312 KB Output is correct
11 Correct 162 ms 27684 KB Output is correct
12 Correct 125 ms 27832 KB Output is correct
13 Correct 101 ms 11508 KB Output is correct
14 Correct 160 ms 29232 KB Output is correct
15 Correct 146 ms 29380 KB Output is correct
16 Correct 63 ms 17748 KB Output is correct
17 Correct 81 ms 23988 KB Output is correct
18 Correct 192 ms 29552 KB Output is correct
19 Correct 79 ms 23240 KB Output is correct
20 Correct 95 ms 24096 KB Output is correct
21 Correct 161 ms 28680 KB Output is correct
22 Correct 71 ms 16068 KB Output is correct
23 Correct 78 ms 24000 KB Output is correct
24 Correct 178 ms 30616 KB Output is correct
25 Correct 70 ms 24388 KB Output is correct
26 Correct 91 ms 24192 KB Output is correct
27 Correct 137 ms 27528 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8536 KB Output is correct
2 Correct 4 ms 8536 KB Output is correct
3 Correct 5 ms 8536 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 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 3 ms 8028 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 4 ms 8028 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 8540 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 3 ms 5180 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 3 ms 8024 KB Output is correct
22 Correct 4 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8280 KB Output is correct
25 Correct 4 ms 8268 KB Output is correct
26 Correct 4 ms 6492 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 26036 KB Output is correct
30 Correct 64 ms 25780 KB Output is correct
31 Correct 64 ms 25696 KB Output is correct
32 Correct 63 ms 25860 KB Output is correct
33 Correct 57 ms 17868 KB Output is correct
34 Correct 54 ms 17352 KB Output is correct
35 Correct 74 ms 25524 KB Output is correct
36 Correct 61 ms 25376 KB Output is correct
37 Correct 12 ms 8536 KB Output is correct
38 Correct 62 ms 25784 KB Output is correct
39 Correct 12 ms 8600 KB Output is correct
40 Correct 28 ms 9676 KB Output is correct
41 Correct 70 ms 25528 KB Output is correct
42 Correct 65 ms 25780 KB Output is correct
43 Correct 12 ms 8792 KB Output is correct
44 Correct 71 ms 25752 KB Output is correct
45 Correct 64 ms 25784 KB Output is correct
46 Correct 20 ms 9180 KB Output is correct
47 Correct 64 ms 25952 KB Output is correct
48 Correct 62 ms 26284 KB Output is correct
49 Correct 13 ms 8792 KB Output is correct
50 Correct 58 ms 13876 KB Output is correct
51 Correct 58 ms 25260 KB Output is correct
52 Correct 12 ms 8540 KB Output is correct
53 Correct 12 ms 8540 KB Output is correct
54 Correct 52 ms 17344 KB Output is correct
55 Correct 61 ms 17592 KB Output is correct
56 Correct 138 ms 32048 KB Output is correct
57 Correct 138 ms 30020 KB Output is correct
58 Correct 155 ms 30692 KB Output is correct
59 Correct 126 ms 29108 KB Output is correct
60 Correct 129 ms 24092 KB Output is correct
61 Correct 136 ms 30644 KB Output is correct
62 Correct 119 ms 28124 KB Output is correct
63 Correct 105 ms 26556 KB Output is correct
64 Correct 54 ms 10964 KB Output is correct
65 Correct 130 ms 30028 KB Output is correct
66 Correct 48 ms 11344 KB Output is correct
67 Correct 50 ms 12232 KB Output is correct
68 Correct 79 ms 26512 KB Output is correct
69 Correct 148 ms 30520 KB Output is correct
70 Correct 14 ms 9048 KB Output is correct
71 Correct 75 ms 26596 KB Output is correct
72 Correct 131 ms 29052 KB Output is correct
73 Correct 12 ms 8792 KB Output is correct
74 Correct 68 ms 18600 KB Output is correct
75 Correct 143 ms 32420 KB Output is correct
76 Correct 16 ms 8536 KB Output is correct
77 Correct 60 ms 17352 KB Output is correct
78 Correct 106 ms 26796 KB Output is correct
79 Correct 40 ms 10704 KB Output is correct
80 Correct 34 ms 9432 KB Output is correct
81 Correct 13 ms 8792 KB Output is correct
82 Correct 13 ms 8792 KB Output is correct
83 Correct 180 ms 30692 KB Output is correct
84 Correct 168 ms 29248 KB Output is correct
85 Correct 140 ms 29740 KB Output is correct
86 Correct 142 ms 28720 KB Output is correct
87 Correct 148 ms 30792 KB Output is correct
88 Correct 169 ms 29312 KB Output is correct
89 Correct 162 ms 27684 KB Output is correct
90 Correct 125 ms 27832 KB Output is correct
91 Correct 101 ms 11508 KB Output is correct
92 Correct 160 ms 29232 KB Output is correct
93 Correct 146 ms 29380 KB Output is correct
94 Correct 63 ms 17748 KB Output is correct
95 Correct 81 ms 23988 KB Output is correct
96 Correct 192 ms 29552 KB Output is correct
97 Correct 79 ms 23240 KB Output is correct
98 Correct 95 ms 24096 KB Output is correct
99 Correct 161 ms 28680 KB Output is correct
100 Correct 71 ms 16068 KB Output is correct
101 Correct 78 ms 24000 KB Output is correct
102 Correct 178 ms 30616 KB Output is correct
103 Correct 70 ms 24388 KB Output is correct
104 Correct 91 ms 24192 KB Output is correct
105 Correct 137 ms 27528 KB Output is correct
106 Correct 50 ms 7188 KB Output is correct
107 Correct 46 ms 7892 KB Output is correct
108 Correct 39 ms 7884 KB Output is correct
109 Correct 44 ms 8608 KB Output is correct
110 Correct 212 ms 31648 KB Output is correct
111 Correct 208 ms 30696 KB Output is correct
112 Correct 174 ms 30520 KB Output is correct
113 Correct 190 ms 30172 KB Output is correct
114 Correct 264 ms 31756 KB Output is correct
115 Correct 210 ms 30364 KB Output is correct
116 Correct 233 ms 46256 KB Output is correct
117 Correct 156 ms 28152 KB Output is correct
118 Correct 115 ms 14084 KB Output is correct
119 Correct 56 ms 9420 KB Output is correct
120 Correct 218 ms 29996 KB Output is correct
121 Correct 93 ms 25948 KB Output is correct
122 Correct 91 ms 23440 KB Output is correct
123 Correct 240 ms 30568 KB Output is correct
124 Correct 71 ms 15544 KB Output is correct
125 Correct 111 ms 23728 KB Output is correct
126 Correct 177 ms 31560 KB Output is correct
127 Correct 68 ms 15540 KB Output is correct
128 Correct 108 ms 25248 KB Output is correct
129 Correct 207 ms 32256 KB Output is correct
130 Correct 71 ms 24344 KB Output is correct
131 Correct 90 ms 24016 KB Output is correct
132 Correct 160 ms 27796 KB Output is correct