oj.uz

답안 #532053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532053 2022-03-02T04:30:40 Z fhvirus Naan (JOI19_naan) C++17
0 / 100
 4000 ms 460 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

struct Frac {
	ll a, b;
	Frac (ll _a, ll _b): a(_a), b(_b) {}
};

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 = 14400 * 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 535 ms 356 KB Output is correct
3 Correct 315 ms 356 KB Output is correct
4 Correct 344 ms 360 KB Output is correct
5 Correct 376 ms 344 KB Output is correct
6 Correct 64 ms 332 KB Output is correct
7 Correct 262 ms 332 KB Output is correct
8 Correct 192 ms 352 KB Output is correct
9 Correct 52 ms 332 KB Output is correct
10 Correct 283 ms 360 KB Output is correct
11 Incorrect 656 ms 360 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

# 결과 실행 시간 메모리 Grader output
1 Correct 424 ms 332 KB Output is correct
2 Correct 429 ms 392 KB Output is correct
3 Correct 569 ms 432 KB Output is correct
4 Correct 810 ms 460 KB Output is correct
5 Correct 1930 ms 440 KB Output is correct
6 Correct 820 ms 388 KB Output is correct
7 Correct 441 ms 348 KB Output is correct
8 Correct 235 ms 332 KB Output is correct
9 Execution timed out 4075 ms 460 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 535 ms 356 KB Output is correct
3 Correct 315 ms 356 KB Output is correct
4 Correct 344 ms 360 KB Output is correct
5 Correct 376 ms 344 KB Output is correct
6 Correct 64 ms 332 KB Output is correct
7 Correct 262 ms 332 KB Output is correct
8 Correct 192 ms 352 KB Output is correct
9 Correct 52 ms 332 KB Output is correct
10 Correct 283 ms 360 KB Output is correct
11 Incorrect 656 ms 360 KB Integer parameter [name=A_i] equals to -1, violates the range [1, 2000000000000]
12 Halted 0 ms 0 KB -