oj.uz

답안 #854627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854627 2023-09-28T08:43:58 Z AaW Semiexpress (JOI17_semiexpress) C++14
0 / 100
 0 ms 352 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define AI(x) begin(x),end(x)
#define endl '\n'
#ifdef DEBUG 
#define debug(args...) LKJ("\033[1;32m[ "+string(#args)+" ]\033[0m", args)
template<class I> void LKJ(I&&x){ cerr << x << '\n'; }
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr << x << ", ", LKJ(t...); }
template<class I> void OI(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a; }
#else
#define debug(...) 0
#define OI(...) 0
#endif
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define pb push_back

signed main() {_
	ll n, m, k; 
	cin >> n >> m >> k;
	ll a, b, c;
	cin >> a >> b >> c;
	vector<ll> fast;

	ll t; 
	cin >> t;

	for (ll i = 0; i < m; ++i) {
		ll s; cin >> s;
		fast.pb(s);
	}

	priority_queue<ll> pq;
	ll used = 0;
	ll bptr = 0;
	ll ccur = 1;
	ll cnt = -1;

	while (used < k+5 && ccur <= n) {
		if(bptr > m) break;
		int tleft = t - (b*(fast[bptr]-1) + c*(ccur-fast[bptr]));
		if (ccur == n) {
			if (tleft >= 0) cnt++;
			break;
		}
		debug("TT", ccur, tleft);
		if(tleft < 0) {
			if(ccur == fast[bptr]) break;
			ccur = fast[bptr+1];
			bptr++;
			continue;
		}
		if (fast[bptr] == ccur) {
			int far = ccur + (tleft / a);
			if (far >= fast[bptr+1]) {
				cnt += fast[bptr+1] - fast[bptr];
				debug(fast[bptr], fast[bptr+1]-1);
				ccur = fast[bptr+1];
				used++;
				bptr++;
			} else {
				cnt += far - ccur + 1;
				debug(ccur, far);
				ccur = far+1;
				used++;
				if (ccur == fast[bptr+1]) bptr++;
			}
		} else {
			int far = ccur + (tleft / a);
			if (far >= fast[bptr+1]) {
				pq.push(fast[bptr+1] - ccur);
				debug(ccur, fast[bptr+1]-1 , "PQ", tleft);
				ccur = fast[bptr+1];
				bptr++;
			} else {
				pq.push(far - ccur + 1);
				debug(ccur, far, "PQ", tleft);
				ccur = far+1;
				if (ccur == fast[bptr+1]) bptr++;
				used++;
			}
		}
	}
	for (int i = 0; i < k - m; ++i) {
		if (pq.empty()) break;
		cnt += pq.top();
		pq.pop();
	}
	cout << cnt << endl;
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
semiexpress.cpp:48:3: note: in expansion of macro 'debug'
   48 |   debug("TT", ccur, tleft);
      |   ^~~~~
semiexpress.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
semiexpress.cpp:59:5: note: in expansion of macro 'debug'
   59 |     debug(fast[bptr], fast[bptr+1]-1);
      |     ^~~~~
semiexpress.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
semiexpress.cpp:65:5: note: in expansion of macro 'debug'
   65 |     debug(ccur, far);
      |     ^~~~~
semiexpress.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
semiexpress.cpp:74:5: note: in expansion of macro 'debug'
   74 |     debug(ccur, fast[bptr+1]-1 , "PQ", tleft);
      |     ^~~~~
semiexpress.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
semiexpress.cpp:79:5: note: in expansion of macro 'debug'
   79 |     debug(ccur, far, "PQ", tleft);
      |     ^~~~~

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -