oj.uz

Submission #1038219

# Submission time Handle Problem Language Result Execution time Memory
1038219 2024-07-29T14:29:49 Z Unforgettablepl Tower (JOI24_tower) C++17
0 / 100
 16 ms 868 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int INF = 1e18+1;

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n,q,d,A,B;
	cin >> n >> q >> d >> A >> B;
	vector<pair<int,int>> ranges;
	for(int i=1;i<=n;i++){
		int l,r;cin>>l>>r;
		ranges.emplace_back(l,r);
	}
	ranges.emplace_back(1e12+1,1e12+1);
	set<pair<int,int>> accessible;
	accessible.insert({0,ranges[0].first-1});
	int last = d;
	for(int i=0;i<n;i++){
		last = max(last,ranges[i].second+1);
		if(ranges[i].second-ranges[i].first+1>=d)break;
		if(last>=ranges[i+1].first)continue;
		accessible.insert({last,ranges[i+1].first-1});
		last+=d;
	}
	accessible.insert({1e12+1,-1});
	for(int i=1;i<=q;i++){
		int x;cin>>x;
		if(accessible.lower_bound({x,-1})->second>=x)cout<<x<<'\n';
		else cout << "-1\n";
	}
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 38.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 32.0

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