oj.uz

답안 #987875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987875 2024-05-23T17:54:02 Z activedeltorre Shopping Plans (CCO20_day2problem3) C++14
15 / 25
 177 ms 45232 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
//ifstream cin("a.in");
//ofstream cout("a.out");
long long inf=1e9+10;
struct node
{
    long long  layer,sum,bitipref,lst,rghtbord,biti;
    //  node(int a,int b,int c,int d,int e) : layer(a),sum(b),bitipref(c),lst(d),rghtbord(e){}
};
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];
int init[200005];
node skip(node curr)
{
    int g,g2;
    g=ord[curr.layer];
    g2=ord[curr.layer+1];
    curr.sum=curr.sum-adj[g][curr.lst]+adj[g][curr.lst-1];
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum=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];
    curr.layer++;
    curr.biti=x[g2];
    curr.lst=x[g2];
    curr.bitipref=x[g2]-1;
    curr.rghtbord=adj[g2].size()-1;
    curr.sum=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=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=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=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
        {
            if(x[i]==0)
            {
                adj[i].push_back(0);
                x[i]=1;
            }
            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;
            }
            int 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]];
            }
        }
        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];
        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(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;
}
/*
5 2 7
1 5
1 3
2 3
1 6
2 1
2 3
2 2*/

Compilation message

Main.cpp: In function 'node godown(node)':
Main.cpp:50:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   50 |     int g,g2;
      |         ^
Main.cpp: In function 'int main()':
Main.cpp:117:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  117 |             if(adj[i].size()<x[i])
      |                ~~~~~~~~~~~~~^~~~~
Main.cpp:127:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |             for(int j=0; j<adj[i].size(); j++)
      |                          ~^~~~~~~~~~~~~~
Main.cpp:135:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  135 |             if(adj[i].size()==x[i])
      |                ~~~~~~~~~~~~~^~~~~~
Main.cpp:148: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]
  148 |     for(i=0; i<ord.size(); i++)
      |              ~^~~~~~~~~~~
Main.cpp:101:21: warning: unused variable 'minim' [-Wunused-variable]
  101 |     long long imp=0,minim=inf,poz=m;
      |                     ^~~~~
Main.cpp:101:31: warning: unused variable 'poz' [-Wunused-variable]
  101 |     long long imp=0,minim=inf,poz=m;
      |                               ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9520 KB Output is correct
2 Correct 5 ms 9512 KB Output is correct
3 Correct 4 ms 9512 KB Output is correct
4 Correct 4 ms 9504 KB Output is correct
5 Correct 5 ms 9456 KB Output is correct
6 Correct 5 ms 9512 KB Output is correct
7 Correct 4 ms 9500 KB Output is correct
8 Correct 4 ms 9512 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 9568 KB Output is correct
11 Correct 3 ms 8796 KB Output is correct
12 Correct 3 ms 9052 KB Output is correct
13 Correct 4 ms 9308 KB Output is correct
14 Correct 5 ms 9512 KB Output is correct
15 Correct 3 ms 9048 KB Output is correct
16 Correct 4 ms 9308 KB Output is correct
17 Correct 4 ms 9504 KB Output is correct
18 Correct 4 ms 9052 KB Output is correct
19 Correct 4 ms 9308 KB Output is correct
20 Correct 5 ms 9524 KB Output is correct
21 Correct 3 ms 8796 KB Output is correct
22 Correct 3 ms 9304 KB Output is correct
23 Correct 4 ms 9512 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 4 ms 9048 KB Output is correct
26 Correct 4 ms 9512 KB Output is correct
27 Correct 4 ms 9496 KB Output is correct
28 Correct 4 ms 9764 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 35800 KB Output is correct
2 Correct 70 ms 35000 KB Output is correct
3 Correct 83 ms 36532 KB Output is correct
4 Correct 69 ms 36468 KB Output is correct
5 Correct 58 ms 22444 KB Output is correct
6 Correct 60 ms 23492 KB Output is correct
7 Correct 85 ms 34488 KB Output is correct
8 Correct 65 ms 36012 KB Output is correct
9 Correct 13 ms 9560 KB Output is correct
10 Correct 70 ms 36796 KB Output is correct
11 Correct 13 ms 9560 KB Output is correct
12 Correct 27 ms 10712 KB Output is correct
13 Correct 74 ms 36552 KB Output is correct
14 Correct 71 ms 36472 KB Output is correct
15 Correct 12 ms 9564 KB Output is correct
16 Correct 86 ms 36284 KB Output is correct
17 Correct 75 ms 36792 KB Output is correct
18 Correct 20 ms 10208 KB Output is correct
19 Correct 71 ms 36752 KB Output is correct
20 Correct 64 ms 37028 KB Output is correct
21 Correct 15 ms 9564 KB Output is correct
22 Correct 64 ms 23736 KB Output is correct
23 Correct 67 ms 34752 KB Output is correct
24 Correct 14 ms 9564 KB Output is correct
25 Correct 12 ms 9392 KB Output is correct
26 Correct 55 ms 22724 KB Output is correct
27 Correct 55 ms 22980 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9520 KB Output is correct
2 Correct 5 ms 9512 KB Output is correct
3 Correct 4 ms 9512 KB Output is correct
4 Correct 4 ms 9504 KB Output is correct
5 Correct 5 ms 9456 KB Output is correct
6 Correct 5 ms 9512 KB Output is correct
7 Correct 4 ms 9500 KB Output is correct
8 Correct 4 ms 9512 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 9568 KB Output is correct
11 Correct 3 ms 8796 KB Output is correct
12 Correct 3 ms 9052 KB Output is correct
13 Correct 4 ms 9308 KB Output is correct
14 Correct 5 ms 9512 KB Output is correct
15 Correct 3 ms 9048 KB Output is correct
16 Correct 4 ms 9308 KB Output is correct
17 Correct 4 ms 9504 KB Output is correct
18 Correct 4 ms 9052 KB Output is correct
19 Correct 4 ms 9308 KB Output is correct
20 Correct 5 ms 9524 KB Output is correct
21 Correct 3 ms 8796 KB Output is correct
22 Correct 3 ms 9304 KB Output is correct
23 Correct 4 ms 9512 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 4 ms 9048 KB Output is correct
26 Correct 4 ms 9512 KB Output is correct
27 Correct 4 ms 9496 KB Output is correct
28 Correct 4 ms 9764 KB Output is correct
29 Correct 75 ms 35800 KB Output is correct
30 Correct 70 ms 35000 KB Output is correct
31 Correct 83 ms 36532 KB Output is correct
32 Correct 69 ms 36468 KB Output is correct
33 Correct 58 ms 22444 KB Output is correct
34 Correct 60 ms 23492 KB Output is correct
35 Correct 85 ms 34488 KB Output is correct
36 Correct 65 ms 36012 KB Output is correct
37 Correct 13 ms 9560 KB Output is correct
38 Correct 70 ms 36796 KB Output is correct
39 Correct 13 ms 9560 KB Output is correct
40 Correct 27 ms 10712 KB Output is correct
41 Correct 74 ms 36552 KB Output is correct
42 Correct 71 ms 36472 KB Output is correct
43 Correct 12 ms 9564 KB Output is correct
44 Correct 86 ms 36284 KB Output is correct
45 Correct 75 ms 36792 KB Output is correct
46 Correct 20 ms 10208 KB Output is correct
47 Correct 71 ms 36752 KB Output is correct
48 Correct 64 ms 37028 KB Output is correct
49 Correct 15 ms 9564 KB Output is correct
50 Correct 64 ms 23736 KB Output is correct
51 Correct 67 ms 34752 KB Output is correct
52 Correct 14 ms 9564 KB Output is correct
53 Correct 12 ms 9392 KB Output is correct
54 Correct 55 ms 22724 KB Output is correct
55 Correct 55 ms 22980 KB Output is correct
56 Correct 172 ms 44544 KB Output is correct
57 Correct 177 ms 40876 KB Output is correct
58 Correct 147 ms 41448 KB Output is correct
59 Correct 160 ms 40236 KB Output is correct
60 Correct 141 ms 31188 KB Output is correct
61 Correct 141 ms 41504 KB Output is correct
62 Correct 137 ms 38960 KB Output is correct
63 Correct 119 ms 37816 KB Output is correct
64 Correct 56 ms 12488 KB Output is correct
65 Correct 152 ms 40852 KB Output is correct
66 Correct 61 ms 12924 KB Output is correct
67 Correct 54 ms 13840 KB Output is correct
68 Correct 89 ms 35500 KB Output is correct
69 Correct 155 ms 42668 KB Output is correct
70 Correct 16 ms 9760 KB Output is correct
71 Correct 89 ms 36516 KB Output is correct
72 Correct 140 ms 39984 KB Output is correct
73 Correct 12 ms 9564 KB Output is correct
74 Correct 73 ms 23996 KB Output is correct
75 Correct 151 ms 45232 KB Output is correct
76 Correct 12 ms 9308 KB Output is correct
77 Correct 69 ms 22716 KB Output is correct
78 Correct 113 ms 38176 KB Output is correct

Subtask #4
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 16344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9520 KB Output is correct
2 Correct 5 ms 9512 KB Output is correct
3 Correct 4 ms 9512 KB Output is correct
4 Correct 4 ms 9504 KB Output is correct
5 Correct 5 ms 9456 KB Output is correct
6 Correct 5 ms 9512 KB Output is correct
7 Correct 4 ms 9500 KB Output is correct
8 Correct 4 ms 9512 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 9568 KB Output is correct
11 Correct 3 ms 8796 KB Output is correct
12 Correct 3 ms 9052 KB Output is correct
13 Correct 4 ms 9308 KB Output is correct
14 Correct 5 ms 9512 KB Output is correct
15 Correct 3 ms 9048 KB Output is correct
16 Correct 4 ms 9308 KB Output is correct
17 Correct 4 ms 9504 KB Output is correct
18 Correct 4 ms 9052 KB Output is correct
19 Correct 4 ms 9308 KB Output is correct
20 Correct 5 ms 9524 KB Output is correct
21 Correct 3 ms 8796 KB Output is correct
22 Correct 3 ms 9304 KB Output is correct
23 Correct 4 ms 9512 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 4 ms 9048 KB Output is correct
26 Correct 4 ms 9512 KB Output is correct
27 Correct 4 ms 9496 KB Output is correct
28 Correct 4 ms 9764 KB Output is correct
29 Correct 75 ms 35800 KB Output is correct
30 Correct 70 ms 35000 KB Output is correct
31 Correct 83 ms 36532 KB Output is correct
32 Correct 69 ms 36468 KB Output is correct
33 Correct 58 ms 22444 KB Output is correct
34 Correct 60 ms 23492 KB Output is correct
35 Correct 85 ms 34488 KB Output is correct
36 Correct 65 ms 36012 KB Output is correct
37 Correct 13 ms 9560 KB Output is correct
38 Correct 70 ms 36796 KB Output is correct
39 Correct 13 ms 9560 KB Output is correct
40 Correct 27 ms 10712 KB Output is correct
41 Correct 74 ms 36552 KB Output is correct
42 Correct 71 ms 36472 KB Output is correct
43 Correct 12 ms 9564 KB Output is correct
44 Correct 86 ms 36284 KB Output is correct
45 Correct 75 ms 36792 KB Output is correct
46 Correct 20 ms 10208 KB Output is correct
47 Correct 71 ms 36752 KB Output is correct
48 Correct 64 ms 37028 KB Output is correct
49 Correct 15 ms 9564 KB Output is correct
50 Correct 64 ms 23736 KB Output is correct
51 Correct 67 ms 34752 KB Output is correct
52 Correct 14 ms 9564 KB Output is correct
53 Correct 12 ms 9392 KB Output is correct
54 Correct 55 ms 22724 KB Output is correct
55 Correct 55 ms 22980 KB Output is correct
56 Correct 172 ms 44544 KB Output is correct
57 Correct 177 ms 40876 KB Output is correct
58 Correct 147 ms 41448 KB Output is correct
59 Correct 160 ms 40236 KB Output is correct
60 Correct 141 ms 31188 KB Output is correct
61 Correct 141 ms 41504 KB Output is correct
62 Correct 137 ms 38960 KB Output is correct
63 Correct 119 ms 37816 KB Output is correct
64 Correct 56 ms 12488 KB Output is correct
65 Correct 152 ms 40852 KB Output is correct
66 Correct 61 ms 12924 KB Output is correct
67 Correct 54 ms 13840 KB Output is correct
68 Correct 89 ms 35500 KB Output is correct
69 Correct 155 ms 42668 KB Output is correct
70 Correct 16 ms 9760 KB Output is correct
71 Correct 89 ms 36516 KB Output is correct
72 Correct 140 ms 39984 KB Output is correct
73 Correct 12 ms 9564 KB Output is correct
74 Correct 73 ms 23996 KB Output is correct
75 Correct 151 ms 45232 KB Output is correct
76 Correct 12 ms 9308 KB Output is correct
77 Correct 69 ms 22716 KB Output is correct
78 Correct 113 ms 38176 KB Output is correct
79 Incorrect 53 ms 16344 KB Output isn't correct
80 Halted 0 ms 0 KB -