#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool operator < (const array<ll, 2> a, const array<ll, 2> b) {
return a[0]*b[1] < b[0]*a[1];
}
int n, m, c[2020][2020];
bool chk[2020];
array<ll, 2> p[2020][2020];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin >> c[i][j];
for(int i=1;i<=n;i++) {
ll sum = 0;
for(int j=1;j<=m;j++) sum += c[i][j];
ll s = 0;
for(int j=1, k=0;j<n;j++) {
while(k < m && (s + c[i][k+1]) * n < sum * j) s += c[i][++k];
assert(k < m);
ll C = c[i][k+1];
p[i][j] = {sum*j-s*n + k*C*n, C*n};
// assert(j == 1 || p[i][j-1] < p[i][j]);
}
}
vector<int> ans;
for(int i=1;i<n;i++) {
int mn = 1;
while(chk[mn]) mn++;
for(int j=1;j<=n;j++) if(!chk[j] && p[j][i] < p[mn][i]) mn = j;
cout << p[mn][i][0] << " " << p[mn][i][1] << "\n";
chk[mn] = 1, ans.push_back(mn);
}
for(auto x : ans) cout << x << " ";
for(int i=1;i<=n;i++) if(!chk[i]) cout << i;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4596 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 11 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 15 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 16 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 17 |
Correct |
2 ms |
4440 KB |
Output is correct |
| 18 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 19 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 22 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 23 |
Correct |
1 ms |
2608 KB |
Output is correct |
| 24 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 25 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 26 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 27 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 18 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 19 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 20 |
Correct |
1 ms |
4596 KB |
Output is correct |
| 21 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 23 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 24 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 25 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 26 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 27 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 28 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 29 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 30 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 31 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 32 |
Correct |
2 ms |
4440 KB |
Output is correct |
| 33 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 34 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 35 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 36 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 37 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 38 |
Correct |
1 ms |
2608 KB |
Output is correct |
| 39 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 40 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 41 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 42 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 43 |
Correct |
21 ms |
25180 KB |
Output is correct |
| 44 |
Incorrect |
120 ms |
55960 KB |
X_i is not increasing |
| 45 |
Halted |
0 ms |
0 KB |
- |
