Submission #1189671

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189671		mertbbm	Escape Route 2 (JOI24_escape2)	C++20	6 / 100	3094 ms	6636 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

int two[22][100005];
int dp[22][100005];
int offset[100005];
vector<pii>adj[100005];
const int blk=-1;

void solve(){
	int n,k;
	cin >> n >> k;
	
	pii arr[n+5];
	for(int x=1;x<n;x++){
		cin >> arr[x].first >> arr[x].first >> arr[x].second;
	}
	
	int q;
	cin >> q;
	int l,r;
	for(int x=0;x<q;x++){
		cin >> l >> r;
		int counter=arr[l].second-arr[l].first;
		int cur=arr[l].second;
		for(int y=l+1;y<r;y++){
			if(arr[y].first<cur){
				counter+=k;
				counter+=(arr[y].second-cur);
			}
			else counter+=(arr[y].second-cur);
			cur=arr[y].second;
		}
		cout << counter << "\n";
	}
}	
																   
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 17
• Subtask 4: 0 / 23
• Subtask 5: 0 / 36
• Subtask 6: 0 / 10