oj.uz

Submission #407246

# Submission time Handle Problem Language Result Execution time Memory
407246 2021-05-18T16:30:54 Z arwaeystoamneg Semiexpress (JOI17_semiexpress) C++17
100 / 100
 16 ms 11464 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 3005;
int k, n, m, A, C, B, a[MAX],c[MAX][MAX];
ll T;

int main()
{
	setIO("test1");
	cin >> k >> n >> m >> A >> C >> B >> T;
	m -= n;
	F0R(i, n)cin >> a[i], a[i]--;
	F0R(i, n)fill(c[i], c[i] + m + 1, -inf);
	F0R(i, n - 1)
	{
		ll t = T - (ll)C * a[i];
		fill(c[i], c[i] + m + 1, -inf);
		if (t < 0)continue;
		int last = 0;
		int l = 0;
		F0R(j, m + 1)
		{
			l = last;
			c[i][j] = last + t / A + 1;
			last = c[i][j] - 1;
			if (t < 0)
			{
				c[i][j] = -inf;
			}
			else
			{
				t -= (ll)B * (last + 1 - l);
				if (t >= 0)last++;
				c[i][j] = min(c[i][j], a[i + 1] - a[i]);
			}
		}
	}
	if (T >= (ll)C * a[n - 1])
		fill(c[n - 1], c[n - 1] + m + 1, 1);
	else
		fill(c[n - 1], c[n - 1] + m + 1, -inf);
	ll ans = 0;
	F0R(i, n)if (c[i][0] >= 1)ans += c[i][0];
	priority_queue<pair<int, pii>>todo;
	F0R(i,n)
	{
		if (c[i][0] >= 1)
		{
			todo.push({ c[i][1] - c[i][0],{i,0} });
		}
	}
	while (sz(todo) && m)
	{
		m--;
		int t = todo.top().f, i = todo.top().s.f, j = todo.top().s.s;
		if (t < 0)break;
		todo.pop();
		ans += t;
		todo.push({ c[i][j + 2] - c[i][j + 1],{i,j + 1} });
	}
	cout << ans - 1 << endl;
}

Subtask #1
18.0 / 18.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 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #2
30.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 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 460 KB Output is correct

Subtask #3
52.0 / 52.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 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 6 ms 8780 KB Output is correct
20 Correct 8 ms 11464 KB Output is correct
21 Correct 3 ms 5452 KB Output is correct
22 Correct 4 ms 7372 KB Output is correct
23 Correct 16 ms 11340 KB Output is correct
24 Correct 3 ms 5324 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 4 ms 8288 KB Output is correct
27 Correct 3 ms 6348 KB Output is correct
28 Correct 3 ms 6604 KB Output is correct
29 Correct 5 ms 3404 KB Output is correct
30 Correct 3 ms 1356 KB Output is correct