oj.uz

Submission #532039

# Submission time Handle Problem Language Result Execution time Memory
532039 2022-03-02T04:18:21 Z fhvirus Naan (JOI19_naan) C++17
0 / 100
 1967 ms 472 KB 
// Knapsack DP is harder than FFT.
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll; typedef pair<int, int> pii;
#define pb emplace_back
#define AI(x) begin(x),end(x)
#define ff first
#define ss second
#ifdef OWO
#define debug(args...) LKJ("\033[1;32m[ " + string(#args) + " ]\033[0m", args)
template <class I> void LKJ(I&&x) { cerr << x << endl; }
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"[(a = next(a)) == b]; }
#else
#define debug(...) 0
#define OI(...) 0
#endif

const int kN = 2002;
int N, L, V[kN][kN];
ll dupl, pre[kN][kN], ori[kN];

ll f(int i, ll j) {
	int k = j / dupl;
	return pre[i][k] * dupl + V[i][k + 1] * (j - k * dupl);
}

bool solve(const vector<int>& perm) {
	vector<ll> x(1, 0);
	for (const int& i: perm) {
		int j = x.back();
		while (j <= dupl * L and (f(i, j) - f(i, x.back())) * N < ori[i] * dupl)
			++j;
		if (j > dupl * L) return false;
		x.pb(j);
	}

	x.back() = dupl * L;
	for (int i = 1; i < N; ++i)
		cout << x[i] << ' ' << dupl << '\n';
	for (const int& i: perm)
		cout << i << " \n"[i == perm.back()];
	return true;
}

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin >> N >> L;
	for (int i = 1; i <= N; ++i)
		for (int j = 1; j <= L; ++j) {
			cin >> V[i][j];
			pre[i][j] = pre[i][j - 1] + V[i][j];
			ori[i] += V[i][j];
			dupl = max(dupl, (ll) V[i][j]);
		}

	dupl = max(dupl, (ll) N);


	vector<int> perm(N);
	iota(AI(perm), 1);

	do if (solve(perm)) exit(0);
	while (next_permutation(AI(perm)));

	cout << -1 << '\n';
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1967 ms 376 KB Output is correct
3 Correct 1073 ms 372 KB Output is correct
4 Correct 1237 ms 388 KB Output is correct
5 Correct 1311 ms 356 KB Output is correct
6 Correct 222 ms 332 KB Output is correct
7 Correct 945 ms 372 KB Output is correct
8 Correct 449 ms 388 KB Output is correct
9 Correct 145 ms 336 KB Output is correct
10 Correct 294 ms 372 KB Output is correct
11 Incorrect 886 ms 384 KB Integer parameter [name=A_i] equals to -1, violates the range [1, 2000000000000]
12 Halted 0 ms 0 KB -

Subtask #2
0 / 24.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 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 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 3 ms 472 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Incorrect 96 ms 460 KB Integer parameter [name=A_i] equals to -1, violates the range [1, 2000000000000]
19 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1967 ms 376 KB Output is correct
3 Correct 1073 ms 372 KB Output is correct
4 Correct 1237 ms 388 KB Output is correct
5 Correct 1311 ms 356 KB Output is correct
6 Correct 222 ms 332 KB Output is correct
7 Correct 945 ms 372 KB Output is correct
8 Correct 449 ms 388 KB Output is correct
9 Correct 145 ms 336 KB Output is correct
10 Correct 294 ms 372 KB Output is correct
11 Incorrect 886 ms 384 KB Integer parameter [name=A_i] equals to -1, violates the range [1, 2000000000000]
12 Halted 0 ms 0 KB -