oj.uz

Submission #423563

# Submission time Handle Problem Language Result Execution time Memory
423563 2021-06-11T09:28:11 Z JvThunder Autobahn (COI21_autobahn) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;

using namespace std;

int n,k,z;
multiset<pair<pair<int,int>,int>> s;
vector<pair<pair<int,int>,int>> val;
int add[1005] = {0};
void solve()
{
    cin >> n >> k >> z;
    set<int> all;
    for(int i=0;i<n;i++)
    {
        int l,t,r;
        cin >> l >> t >> r;
        s.insert({{l,l+t-1},0});
        s.insert({{l+t,r},1});
        all.insert(l);
        all.insert(l+t);
        all.insert(r+1);
    }

    priority_queue<pair<int,int>> pq;
    int cnt = 0;
    auto itr = s.begin();
    int prv = (*itr).fir.fir;
    for(auto x:all)
    {
        if(pq.size()>=k) val.pb({{prv,x-1},cnt});
        prv = x;
        
        while(!pq.empty() && -pq.top().fir<x)
        {
            if(pq.top().sec==1) cnt--;
            pq.pop();
        }

        while(itr!=s.end() && (*itr).fir.fir<=x)
        {
            if((*itr).sec==1) cnt++;
            pq.push({-(*itr).fir.sec,(*itr).sec});
            itr++;
        }
    }

    for(auto x:val)
    {
        for(int i=x.fir.fir;i<=x.fir.sec;i++) add[i] = x.sec;
    }

    int sum = 0; int mxsum = 0;
    for(int i=1;i<=z;i++) sum += add[i], mxsum = max(mxsum,sum);
    for(int i=z+1;i<=1000;i++) sum -= add[i-z], sum += add[i], mxsum = max(mxsum,sum);;
    cout << mxsum << endl;
    return;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int tc=1;
	//cin>>tc;
	for(int i=1;i<=tc;i++) solve();
 	return 0;
}

Compilation message

autobahn.cpp: In function 'void solve()':
autobahn.cpp:35:21: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |         if(pq.size()>=k) val.pb({{prv,x-1},cnt});
      |            ~~~~~~~~~^~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 320 KB Output isn't correct
4 Halted 0 ms 0 KB -