oj.uz

Submission #1041008

# Submission time Handle Problem Language Result Execution time Memory
1041008 2024-08-01T13:51:35 Z alexdd Road Construction (JOI21_road_construction) C++17
0 / 100
 10000 ms 4672 KB 
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n,cate,k;
pair<int,int> p[250005];
vector<int> sol;
int afis(int lim, bool bl)
{
    sol.clear();
    int poz=1,cnt=0;
    set<pair<int,int>> s;
    for(int i=1;i<=n;i++)
    {
        while(p[i].first-p[poz].first>lim)
        {
            s.erase({p[poz].second,p[poz].first});
            poz++;
        }
        auto it = s.lower_bound({p[i].second-lim,-1});
        while(it!=s.end())
        {

            if((*it).first > p[i].second+lim)
                break;
            if(bl) sol.push_back(max(abs(p[i].first-(*it).second),abs(p[i].second-(*it).first)));
            cnt++;
            if(cnt > k)
                return k+1;
            it++;
        }
        s.insert({p[i].second,p[i].first});
    }
    return cnt;
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].first>>p[i].second;
        p[i] = {p[i].first+p[i].second, p[i].first-p[i].second};
    }
    sort(p+1,p+1+n);
    int st=0,dr=INF,ans=0;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(afis(mij,0)<=k)
        {
            ans=mij;
            st=mij+1;
        }
        else
            dr=mij-1;
    }
    afis(ans,1);
    sort(sol.begin(),sol.end());
    for(auto x:sol)
        cout<<x<<"\n";
    for(int i=1;i<=k-afis(ans,0);i++)
        cout<<ans+1<<"\n";
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10041 ms 2764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 322 ms 4672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 2348 KB Output is correct
2 Correct 191 ms 2396 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 2348 KB Output is correct
2 Correct 191 ms 2396 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10041 ms 2764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10041 ms 2764 KB Time limit exceeded
2 Halted 0 ms 0 KB -