oj.uz

Submission #563790

# Submission time Handle Problem Language Result Execution time Memory
563790 2022-05-18T06:29:34 Z amunduzbaev Long Distance Coach (JOI17_coach) C++17
0 / 100
 1 ms 340 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long

const int inf = 1e18;
const int N = 2e5 + 5;
int s[N], d[N], c[N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int x, n, m, w, t; cin>>x>>n>>m>>w>>t;
	for(int i=0;i<n;i++) cin>>s[i];
	vector<int> p(m), d_(m), mn(m, x + 1);
	int tot = 0, res;
	for(int i=0;i<m;i++){
		cin>>d[i]>>c[i];
		p[i] = i;
		tot += (x / t + (d[i] < x % t)) * w;
	}
	
	tot += (x / t + 1) * w;
	res = tot;
	
	sort(p.begin(), p.end(), [&](int i, int j){
		return d[i] < d[j];
	});
	for(int i=0;i<m;i++) d_[i] = d[p[i]];
	s[n] = x;
	for(int i=0;i<=n;i++){
		int j = upper_bound(d_.begin(), d_.end(), s[i] % t) - d_.begin();
		if(j){ --j;
			assert(d_[j] != s[i] % t);
			mn[j] = min(mn[j], s[i]);
		}
	}
	
	for(int i=0;i<m;i++){
		if(mn[i] > x) continue;
		int M = inf, cur = 0;
		for(int j=i;~j;j--){
			M = min(M, mn[j]);
			cur = cur - (x / t + (d_[j] < x % t) - M / t) * w + c[p[j]];
			res = min(res, tot + cur);
		}
	}
	
	cout<<res<<"\n";
}

/*

166833333456456789
333333209997456789

*/

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -