oj.uz

답안 #987900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987900 2024-05-23T18:58:31 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++17
25 / 25
 221 ms 68132 KB 
///OWNERUL LUI CALIN <3
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;
long long inf=1e9+10;
struct node
{
    long long  layer,sum,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<long long >arr;
vector<long long >adj[200005];
long long cost[200005];
vector<long long>ord;
bool cmp2(long long a,long long b)
{
    return cost[a]<cost[b];
}
int y[200005];
int x[200005];
long long init[200005];
node special(node curr)
{
    long long 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)
{
    long long 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()
{
    long long  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);
    }
    long long imp=0,minim=inf,poz=m;
    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(long long 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(long long 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 && imp==0)
        {
            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);
            }
            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);
            }
            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:39:15: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   39 |     long long g,g2;
      |               ^
Main.cpp: In function 'node godown(node)':
Main.cpp:75:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   75 |     int g,g2;
      |         ^
Main.cpp: In function 'int main()':
Main.cpp:141:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:165:37: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |                 for(long long j=0; j<adj[i].size(); j++)
      |                                    ~^~~~~~~~~~~~~~
Main.cpp:173:33: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  173 |                 if(adj[i].size()==x[i])
      |                    ~~~~~~~~~~~~~^~~~~~
Main.cpp:187:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:130:21: warning: unused variable 'minim' [-Wunused-variable]
  130 |     long long imp=0,minim=inf,poz=m;
      |                     ^~~~~
Main.cpp:130:31: warning: unused variable 'poz' [-Wunused-variable]
  130 |     long long imp=0,minim=inf,poz=m;
      |                               ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10292 KB Output is correct
2 Correct 5 ms 10280 KB Output is correct
3 Correct 5 ms 10276 KB Output is correct
4 Correct 5 ms 10268 KB Output is correct
5 Correct 5 ms 10292 KB Output is correct
6 Correct 5 ms 10276 KB Output is correct
7 Correct 5 ms 10268 KB Output is correct
8 Correct 5 ms 10280 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 6 ms 10336 KB Output is correct
11 Correct 3 ms 9564 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 4 ms 10208 KB Output is correct
14 Correct 5 ms 10280 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10272 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10292 KB Output is correct
21 Correct 3 ms 9560 KB Output is correct
22 Correct 4 ms 10072 KB Output is correct
23 Correct 5 ms 10280 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10276 KB Output is correct
27 Correct 5 ms 10264 KB Output is correct
28 Correct 4 ms 10276 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 37408 KB Output is correct
2 Correct 85 ms 36240 KB Output is correct
3 Correct 71 ms 37180 KB Output is correct
4 Correct 82 ms 36660 KB Output is correct
5 Correct 62 ms 23512 KB Output is correct
6 Correct 62 ms 22984 KB Output is correct
7 Correct 69 ms 36108 KB Output is correct
8 Correct 63 ms 35916 KB Output is correct
9 Correct 13 ms 10332 KB Output is correct
10 Correct 70 ms 36792 KB Output is correct
11 Correct 13 ms 10328 KB Output is correct
12 Correct 27 ms 11480 KB Output is correct
13 Correct 87 ms 36780 KB Output is correct
14 Correct 69 ms 37556 KB Output is correct
15 Correct 12 ms 10332 KB Output is correct
16 Correct 72 ms 35616 KB Output is correct
17 Correct 69 ms 36976 KB Output is correct
18 Correct 23 ms 10964 KB Output is correct
19 Correct 74 ms 37032 KB Output is correct
20 Correct 72 ms 37408 KB Output is correct
21 Correct 13 ms 10332 KB Output is correct
22 Correct 65 ms 22716 KB Output is correct
23 Correct 64 ms 36540 KB Output is correct
24 Correct 12 ms 10328 KB Output is correct
25 Correct 13 ms 10328 KB Output is correct
26 Correct 60 ms 24844 KB Output is correct
27 Correct 66 ms 23488 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10292 KB Output is correct
2 Correct 5 ms 10280 KB Output is correct
3 Correct 5 ms 10276 KB Output is correct
4 Correct 5 ms 10268 KB Output is correct
5 Correct 5 ms 10292 KB Output is correct
6 Correct 5 ms 10276 KB Output is correct
7 Correct 5 ms 10268 KB Output is correct
8 Correct 5 ms 10280 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 6 ms 10336 KB Output is correct
11 Correct 3 ms 9564 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 4 ms 10208 KB Output is correct
14 Correct 5 ms 10280 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10272 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10292 KB Output is correct
21 Correct 3 ms 9560 KB Output is correct
22 Correct 4 ms 10072 KB Output is correct
23 Correct 5 ms 10280 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10276 KB Output is correct
27 Correct 5 ms 10264 KB Output is correct
28 Correct 4 ms 10276 KB Output is correct
29 Correct 72 ms 37408 KB Output is correct
30 Correct 85 ms 36240 KB Output is correct
31 Correct 71 ms 37180 KB Output is correct
32 Correct 82 ms 36660 KB Output is correct
33 Correct 62 ms 23512 KB Output is correct
34 Correct 62 ms 22984 KB Output is correct
35 Correct 69 ms 36108 KB Output is correct
36 Correct 63 ms 35916 KB Output is correct
37 Correct 13 ms 10332 KB Output is correct
38 Correct 70 ms 36792 KB Output is correct
39 Correct 13 ms 10328 KB Output is correct
40 Correct 27 ms 11480 KB Output is correct
41 Correct 87 ms 36780 KB Output is correct
42 Correct 69 ms 37556 KB Output is correct
43 Correct 12 ms 10332 KB Output is correct
44 Correct 72 ms 35616 KB Output is correct
45 Correct 69 ms 36976 KB Output is correct
46 Correct 23 ms 10964 KB Output is correct
47 Correct 74 ms 37032 KB Output is correct
48 Correct 72 ms 37408 KB Output is correct
49 Correct 13 ms 10332 KB Output is correct
50 Correct 65 ms 22716 KB Output is correct
51 Correct 64 ms 36540 KB Output is correct
52 Correct 12 ms 10328 KB Output is correct
53 Correct 13 ms 10328 KB Output is correct
54 Correct 60 ms 24844 KB Output is correct
55 Correct 66 ms 23488 KB Output is correct
56 Correct 154 ms 45208 KB Output is correct
57 Correct 147 ms 41388 KB Output is correct
58 Correct 169 ms 42620 KB Output is correct
59 Correct 137 ms 42180 KB Output is correct
60 Correct 188 ms 32028 KB Output is correct
61 Correct 141 ms 43440 KB Output is correct
62 Correct 143 ms 41004 KB Output is correct
63 Correct 121 ms 38636 KB Output is correct
64 Correct 55 ms 13160 KB Output is correct
65 Correct 148 ms 42672 KB Output is correct
66 Correct 49 ms 13648 KB Output is correct
67 Correct 65 ms 14708 KB Output is correct
68 Correct 89 ms 37296 KB Output is correct
69 Correct 152 ms 42024 KB Output is correct
70 Correct 14 ms 10524 KB Output is correct
71 Correct 98 ms 36528 KB Output is correct
72 Correct 138 ms 40756 KB Output is correct
73 Correct 13 ms 10328 KB Output is correct
74 Correct 78 ms 24480 KB Output is correct
75 Correct 158 ms 45192 KB Output is correct
76 Correct 13 ms 10332 KB Output is correct
77 Correct 71 ms 24660 KB Output is correct
78 Correct 113 ms 38284 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 14024 KB Output is correct
2 Correct 38 ms 11480 KB Output is correct
3 Correct 13 ms 10328 KB Output is correct
4 Correct 13 ms 10524 KB Output is correct
5 Correct 168 ms 43564 KB Output is correct
6 Correct 208 ms 42164 KB Output is correct
7 Correct 159 ms 43696 KB Output is correct
8 Correct 165 ms 41764 KB Output is correct
9 Correct 165 ms 43512 KB Output is correct
10 Correct 162 ms 42132 KB Output is correct
11 Correct 161 ms 42404 KB Output is correct
12 Correct 130 ms 40544 KB Output is correct
13 Correct 100 ms 16528 KB Output is correct
14 Correct 169 ms 43492 KB Output is correct
15 Correct 188 ms 42284 KB Output is correct
16 Correct 76 ms 24500 KB Output is correct
17 Correct 88 ms 36528 KB Output is correct
18 Correct 170 ms 42892 KB Output is correct
19 Correct 94 ms 36732 KB Output is correct
20 Correct 89 ms 37512 KB Output is correct
21 Correct 169 ms 42380 KB Output is correct
22 Correct 73 ms 23476 KB Output is correct
23 Correct 87 ms 37300 KB Output is correct
24 Correct 196 ms 44524 KB Output is correct
25 Correct 70 ms 36792 KB Output is correct
26 Correct 75 ms 37112 KB Output is correct
27 Correct 154 ms 41168 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10292 KB Output is correct
2 Correct 5 ms 10280 KB Output is correct
3 Correct 5 ms 10276 KB Output is correct
4 Correct 5 ms 10268 KB Output is correct
5 Correct 5 ms 10292 KB Output is correct
6 Correct 5 ms 10276 KB Output is correct
7 Correct 5 ms 10268 KB Output is correct
8 Correct 5 ms 10280 KB Output is correct
9 Correct 4 ms 9564 KB Output is correct
10 Correct 6 ms 10336 KB Output is correct
11 Correct 3 ms 9564 KB Output is correct
12 Correct 4 ms 9820 KB Output is correct
13 Correct 4 ms 10208 KB Output is correct
14 Correct 5 ms 10280 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 10076 KB Output is correct
17 Correct 5 ms 10272 KB Output is correct
18 Correct 4 ms 9820 KB Output is correct
19 Correct 4 ms 10076 KB Output is correct
20 Correct 5 ms 10292 KB Output is correct
21 Correct 3 ms 9560 KB Output is correct
22 Correct 4 ms 10072 KB Output is correct
23 Correct 5 ms 10280 KB Output is correct
24 Correct 5 ms 9820 KB Output is correct
25 Correct 4 ms 9820 KB Output is correct
26 Correct 5 ms 10276 KB Output is correct
27 Correct 5 ms 10264 KB Output is correct
28 Correct 4 ms 10276 KB Output is correct
29 Correct 72 ms 37408 KB Output is correct
30 Correct 85 ms 36240 KB Output is correct
31 Correct 71 ms 37180 KB Output is correct
32 Correct 82 ms 36660 KB Output is correct
33 Correct 62 ms 23512 KB Output is correct
34 Correct 62 ms 22984 KB Output is correct
35 Correct 69 ms 36108 KB Output is correct
36 Correct 63 ms 35916 KB Output is correct
37 Correct 13 ms 10332 KB Output is correct
38 Correct 70 ms 36792 KB Output is correct
39 Correct 13 ms 10328 KB Output is correct
40 Correct 27 ms 11480 KB Output is correct
41 Correct 87 ms 36780 KB Output is correct
42 Correct 69 ms 37556 KB Output is correct
43 Correct 12 ms 10332 KB Output is correct
44 Correct 72 ms 35616 KB Output is correct
45 Correct 69 ms 36976 KB Output is correct
46 Correct 23 ms 10964 KB Output is correct
47 Correct 74 ms 37032 KB Output is correct
48 Correct 72 ms 37408 KB Output is correct
49 Correct 13 ms 10332 KB Output is correct
50 Correct 65 ms 22716 KB Output is correct
51 Correct 64 ms 36540 KB Output is correct
52 Correct 12 ms 10328 KB Output is correct
53 Correct 13 ms 10328 KB Output is correct
54 Correct 60 ms 24844 KB Output is correct
55 Correct 66 ms 23488 KB Output is correct
56 Correct 154 ms 45208 KB Output is correct
57 Correct 147 ms 41388 KB Output is correct
58 Correct 169 ms 42620 KB Output is correct
59 Correct 137 ms 42180 KB Output is correct
60 Correct 188 ms 32028 KB Output is correct
61 Correct 141 ms 43440 KB Output is correct
62 Correct 143 ms 41004 KB Output is correct
63 Correct 121 ms 38636 KB Output is correct
64 Correct 55 ms 13160 KB Output is correct
65 Correct 148 ms 42672 KB Output is correct
66 Correct 49 ms 13648 KB Output is correct
67 Correct 65 ms 14708 KB Output is correct
68 Correct 89 ms 37296 KB Output is correct
69 Correct 152 ms 42024 KB Output is correct
70 Correct 14 ms 10524 KB Output is correct
71 Correct 98 ms 36528 KB Output is correct
72 Correct 138 ms 40756 KB Output is correct
73 Correct 13 ms 10328 KB Output is correct
74 Correct 78 ms 24480 KB Output is correct
75 Correct 158 ms 45192 KB Output is correct
76 Correct 13 ms 10332 KB Output is correct
77 Correct 71 ms 24660 KB Output is correct
78 Correct 113 ms 38284 KB Output is correct
79 Correct 44 ms 14024 KB Output is correct
80 Correct 38 ms 11480 KB Output is correct
81 Correct 13 ms 10328 KB Output is correct
82 Correct 13 ms 10524 KB Output is correct
83 Correct 168 ms 43564 KB Output is correct
84 Correct 208 ms 42164 KB Output is correct
85 Correct 159 ms 43696 KB Output is correct
86 Correct 165 ms 41764 KB Output is correct
87 Correct 165 ms 43512 KB Output is correct
88 Correct 162 ms 42132 KB Output is correct
89 Correct 161 ms 42404 KB Output is correct
90 Correct 130 ms 40544 KB Output is correct
91 Correct 100 ms 16528 KB Output is correct
92 Correct 169 ms 43492 KB Output is correct
93 Correct 188 ms 42284 KB Output is correct
94 Correct 76 ms 24500 KB Output is correct
95 Correct 88 ms 36528 KB Output is correct
96 Correct 170 ms 42892 KB Output is correct
97 Correct 94 ms 36732 KB Output is correct
98 Correct 89 ms 37512 KB Output is correct
99 Correct 169 ms 42380 KB Output is correct
100 Correct 73 ms 23476 KB Output is correct
101 Correct 87 ms 37300 KB Output is correct
102 Correct 196 ms 44524 KB Output is correct
103 Correct 70 ms 36792 KB Output is correct
104 Correct 75 ms 37112 KB Output is correct
105 Correct 154 ms 41168 KB Output is correct
106 Correct 35 ms 11092 KB Output is correct
107 Correct 53 ms 13508 KB Output is correct
108 Correct 45 ms 11888 KB Output is correct
109 Correct 46 ms 14548 KB Output is correct
110 Correct 192 ms 44460 KB Output is correct
111 Correct 188 ms 44432 KB Output is correct
112 Correct 208 ms 43196 KB Output is correct
113 Correct 178 ms 42804 KB Output is correct
114 Correct 210 ms 45184 KB Output is correct
115 Correct 205 ms 44460 KB Output is correct
116 Correct 201 ms 68132 KB Output is correct
117 Correct 171 ms 41460 KB Output is correct
118 Correct 116 ms 19856 KB Output is correct
119 Correct 70 ms 13668 KB Output is correct
120 Correct 221 ms 43704 KB Output is correct
121 Correct 81 ms 36556 KB Output is correct
122 Correct 129 ms 37036 KB Output is correct
123 Correct 201 ms 44952 KB Output is correct
124 Correct 75 ms 24256 KB Output is correct
125 Correct 129 ms 36092 KB Output is correct
126 Correct 173 ms 43176 KB Output is correct
127 Correct 69 ms 23992 KB Output is correct
128 Correct 85 ms 36792 KB Output is correct
129 Correct 186 ms 44720 KB Output is correct
130 Correct 96 ms 36780 KB Output is correct
131 Correct 121 ms 37316 KB Output is correct
132 Correct 159 ms 43064 KB Output is correct