#include <bits/stdc++.h>
using namespace std;
#define ll long long
// returns true if fraction a < fraction b
bool better(pair<ll, ll> a, pair<ll, ll> b) {
return a.first*b.second<a.second*b.first;
}
int main() {
int n, l; cin >> n >> l;
ll V[n][l];
ll sum[n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < l; j++) cin >> V[i][j];
sum[i] = 0; for (int j = 0; j < l; j++) sum[i] += V[i][j];
}
pair<ll, ll> split[n][n];
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j++) {
ll want = sum[i]*j;
int cur = 0;
while (cur < l && V[i][cur]*n <= want) {
want -= V[i][cur]*n;
cur++;
}
split[i][j] = make_pair((ll)cur*V[i][cur]*n+want, V[i][cur]*n);
//cout << "split[" << i << "][" << j << "] = " << split[i][j].first << "/" << split[i][j].second << endl;
}
}
bool taken[n]; for (int i = 0; i < n; i++) taken[i] = false;
vector<int> permutation;
for (int i = 1; i < n; i++) {
int best = -1;
for (int j = 0; j < n; j++) {
if (taken[j]) continue;
if (best == -1) {
best = j;
} else {
if (better(split[j][i], split[best][i])) best = j;
}
}
taken[best] = true;
cout << split[best][i].first << " " << split[best][i].second << endl;
permutation.push_back(best+1);
}
for (int j = 0; j < n; j++) if (!taken[j]) permutation.push_back(j+1);
for (int x : permutation) cout << x << " ";
cout << endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
6 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
384 KB |
Output is correct |
| 4 |
Correct |
6 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
256 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| 12 |
Correct |
6 ms |
384 KB |
Output is correct |
| 13 |
Correct |
6 ms |
384 KB |
Output is correct |
| 14 |
Correct |
6 ms |
384 KB |
Output is correct |
| 15 |
Correct |
6 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
6 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
384 KB |
Output is correct |
| 4 |
Correct |
7 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
7 ms |
384 KB |
Output is correct |
| 10 |
Correct |
7 ms |
384 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| 12 |
Correct |
4 ms |
256 KB |
Output is correct |
| 13 |
Correct |
6 ms |
384 KB |
Output is correct |
| 14 |
Correct |
6 ms |
384 KB |
Output is correct |
| 15 |
Correct |
6 ms |
384 KB |
Output is correct |
| 16 |
Correct |
8 ms |
384 KB |
Output is correct |
| 17 |
Correct |
7 ms |
384 KB |
Output is correct |
| 18 |
Correct |
7 ms |
384 KB |
Output is correct |
| 19 |
Correct |
7 ms |
384 KB |
Output is correct |
| 20 |
Correct |
6 ms |
384 KB |
Output is correct |
| 21 |
Correct |
7 ms |
384 KB |
Output is correct |
| 22 |
Correct |
7 ms |
384 KB |
Output is correct |
| 23 |
Correct |
4 ms |
256 KB |
Output is correct |
| 24 |
Correct |
7 ms |
384 KB |
Output is correct |
| 25 |
Correct |
6 ms |
384 KB |
Output is correct |
| 26 |
Correct |
5 ms |
384 KB |
Output is correct |
| 27 |
Correct |
6 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
6 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
384 KB |
Output is correct |
| 4 |
Correct |
6 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
256 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| 12 |
Correct |
6 ms |
384 KB |
Output is correct |
| 13 |
Correct |
6 ms |
384 KB |
Output is correct |
| 14 |
Correct |
6 ms |
384 KB |
Output is correct |
| 15 |
Correct |
6 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
6 ms |
384 KB |
Output is correct |
| 18 |
Correct |
6 ms |
384 KB |
Output is correct |
| 19 |
Correct |
7 ms |
384 KB |
Output is correct |
| 20 |
Correct |
7 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
384 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
5 ms |
384 KB |
Output is correct |
| 24 |
Correct |
7 ms |
384 KB |
Output is correct |
| 25 |
Correct |
7 ms |
384 KB |
Output is correct |
| 26 |
Correct |
6 ms |
384 KB |
Output is correct |
| 27 |
Correct |
4 ms |
256 KB |
Output is correct |
| 28 |
Correct |
6 ms |
384 KB |
Output is correct |
| 29 |
Correct |
6 ms |
384 KB |
Output is correct |
| 30 |
Correct |
6 ms |
384 KB |
Output is correct |
| 31 |
Correct |
8 ms |
384 KB |
Output is correct |
| 32 |
Correct |
7 ms |
384 KB |
Output is correct |
| 33 |
Correct |
7 ms |
384 KB |
Output is correct |
| 34 |
Correct |
7 ms |
384 KB |
Output is correct |
| 35 |
Correct |
6 ms |
384 KB |
Output is correct |
| 36 |
Correct |
7 ms |
384 KB |
Output is correct |
| 37 |
Correct |
7 ms |
384 KB |
Output is correct |
| 38 |
Correct |
4 ms |
256 KB |
Output is correct |
| 39 |
Correct |
7 ms |
384 KB |
Output is correct |
| 40 |
Correct |
6 ms |
384 KB |
Output is correct |
| 41 |
Correct |
5 ms |
384 KB |
Output is correct |
| 42 |
Correct |
6 ms |
384 KB |
Output is correct |
| 43 |
Correct |
183 ms |
7416 KB |
Output is correct |
| 44 |
Incorrect |
1687 ms |
43128 KB |
X_i is not increasing |
| 45 |
Halted |
0 ms |
0 KB |
- |
