Submission #710520

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
710520	2023-03-15T10:09:46 Z	groshi	Hotel (CEOI11_hot)	C++17	100 / 100	1572 ms	113204 KB

#include<bits/stdc++.h>
#define int long long
using namespace std;
int t[600000][2];
int mam[600000][2];
priority_queue<int> spojne[600000];
set<pair<int,pair<int,int> > > secik;
priority_queue<pair<int,int> > kolejka;
void mergee(int gdzie)
{
    auto it=secik.find({t[gdzie][1],{t[gdzie][0],gdzie}});
    it++;
    if(it==secik.end())
    {
        secik.erase({t[gdzie][1],{t[gdzie][0],gdzie}});
        return;
    }
    int kto=(*it).second.second;
    if(spojne[gdzie].size()<spojne[kto].size())
    {
        while(!spojne[gdzie].empty())
        {
            int x=spojne[gdzie].top();
            spojne[gdzie].pop();
            spojne[kto].push(x);
        }
        if(spojne[kto].size())
            kolejka.push({spojne[kto].top()-t[kto][0],kto});
    }
    else{
        while(!spojne[kto].empty())
        {
            int x=spojne[kto].top();
            spojne[kto].pop();
            spojne[gdzie].push(x);
        }
        swap(spojne[kto],spojne[gdzie]);
        if(spojne[kto].size())
            kolejka.push({spojne[kto].top()-t[kto][0],kto});
    }
    secik.erase({t[gdzie][1],{t[gdzie][0],gdzie}});
}
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    //freopen("test.txt", "r", stdin);
    int n,m,o,x,y,z;
    cin>>n>>m>>o;
    vector<pair<int,pair<int,int> > > Q2;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        t[i][0]=x;
        t[i][1]=y;
        Q2.push_back({y,{x,i}});
        secik.insert({y,{x,i}});
    }
    vector<pair<int,int> > Q;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        mam[i][0]=x;
        mam[i][1]=y;
        Q.push_back({y,x});
    }
    sort(Q.begin(),Q.end());
    sort(Q2.begin(),Q2.end());
    int patrze=0;
    for(int i=0;i<Q.size();i++)
    {
        while(patrze<Q2.size() && Q2[patrze].first<Q[i].first)
            patrze++;
        if(patrze==Q2.size())
            break;
        spojne[Q2[patrze].second.second].push(Q[i].second);
    }
    for(int i=1;i<=n;i++)
    {
        if(spojne[i].size()==0)
            continue;
        kolejka.push({spojne[i].top()-t[i][0],i});
    }
    int wynik=0;
    for(int i=1;i<=o;i++)
    {
        auto para=kolejka.top();
        kolejka.pop();
        while(spojne[para.second].size()==0 || para.first!=spojne[para.second].top()-t[para.second][0])
        {
            para=kolejka.top();
            kolejka.pop();
        }
        if(para.first<0)
            break;
        wynik+=para.first;
        int gdzie=para.second;
        spojne[gdzie].pop();
        mergee(gdzie);
    }
    cout<<wynik;
    return 0;
}

Compilation message

hot.cpp: In function 'int32_t main()':
hot.cpp:71:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for(int i=0;i<Q.size();i++)
      |                 ~^~~~~~~~~
hot.cpp:73:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         while(patrze<Q2.size() && Q2[patrze].first<Q[i].first)
      |               ~~~~~~^~~~~~~~~~
hot.cpp:75:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         if(patrze==Q2.size())
      |            ~~~~~~^~~~~~~~~~~
hot.cpp:49:19: warning: unused variable 'z' [-Wunused-variable]
   49 |     int n,m,o,x,y,z;
      |                   ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	19028 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	19040 KB	Output is correct
2	Correct	11 ms	19116 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	19028 KB	Output is correct
2	Correct	10 ms	19144 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	19028 KB	Output is correct
2	Correct	10 ms	19028 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	20684 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	57 ms	26172 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	110 ms	31212 KB	Output is correct
2	Correct	83 ms	30200 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	399 ms	50508 KB	Output is correct
2	Correct	160 ms	40988 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	665 ms	81116 KB	Output is correct
2	Correct	598 ms	102580 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	801 ms	94388 KB	Output is correct
2	Correct	1161 ms	113204 KB	Output is correct
3	Correct	1572 ms	110832 KB	Output is correct