제출 #532152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532152		fhvirus	Naan (JOI19_naan)	C++17	29 / 100	65 ms	10408 KiB

naan

#include <bits/stdc++.h>
using namespace std;

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

	int N, L; cin >> N >> L;
	vector<int> V(L + 1);
	vector<vector<pair<int64_t, int64_t>>> cut(N + 1, vector<pair<int64_t, int64_t>>(L + 1));

	for (int i = 1; i <= N; ++i) {
		for (int j = 1; j <= L; ++j)
			cin >> V[j];

		int64_t tot = 0, sum = 0;
		for (int j = 1; j <= L; ++j) tot += V[j];
		for (int j = 1, k = 1; j <= N; ++j) {
			while (k < L and (sum + V[k]) * N < tot * j) sum += V[k++];
			int64_t a = 1ll * N * V[k] * (k - 1) + tot * j - sum * N;
			int64_t b = 1ll * N * V[k];
			int64_t g = gcd(a, b);
			cut[i][j] = make_pair(a / g, b / g);
		}
	}

	auto cmp = [&](int i, int j, int k) -> bool {
		return (__int128) cut[j][i].first * cut[k][i].second
		< (__int128) cut[k][i].first * cut[j][i].second;
	};

	vector<bool> vis(N + 1, false);
	vector<pair<int64_t, int64_t>> X(N + 1);
	vector<int> P(N + 1);
	for (int i = 1; i <= N; ++i) {
		int u = -1;
		for (int j = 1; j <= N; ++j)
			if (!vis[j] and (u == -1 or cmp(i, j, u)))
				u = j;
		vis[u] = true;
		X[i] = cut[u][i];
		P[i] = u;
	}

	for (int i = 1; i < N; ++i)
		cout << X[i].first << ' ' << X[i].second << '\n';
	for (int i = 1; i <= N; ++i)
		cout << P[i] << " \n"[i == N];

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 24 / 24
• Subtask 3: 0 / 71