# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
203673 | ics0503 | Naan (JOI19_naan) | C++17 | 72 ms | 9080 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<set>
#include<vector>
using namespace std;
set<long long >people;
struct xy { long long x, y; } need[2121];
long long gcd(long long a, long long b) {
if (b == 0)return a;
return gcd(b, a%b);
}
struct xyz {
long long x, y, z;
void balance() {
long long g = gcd(y, z);
y /= g; z /= g;
}
}L[2121];
bool cmp(xyz a, xyz b) {
if (a.x != b.x) return a.x < b.x;
return a.y * b.z < b.y * a.z;
}
long long v[2121][2121], S[2121][2121];
vector<int>ans;
int main() {
long long n, l, i, j; scanf("%lld%lld", &n, &l);
for (i = 1; i <= n; i++)people.insert(i);
for (i = 1; i <= n; i++) {
for (j = 1; j <= l; j++) {
scanf("%lld", &v[i][j]), S[i][j] = S[i][j - 1] + v[i][j];
need[i].x += v[i][j];
}
need[i].y = n;
long long g = gcd(need[i].x, need[i].y);
need[i].x /= g; need[i].y /= g;
}
long long befa = 1, befx = 0, befy = 1, gj = 1e6;
for (i = 1; i <= n - 1; i++) {
xyz mn = { l + 1,0,1 }; long long mnw = 0;
for (long long who : people) {
if ((befy - befx) * v[who][befa] * need[who].y > need[who].x * befy) {
L[who].x = befa;
L[who].y = need[who].x*befy + befx*need[who].y*v[who][befa];
L[who].z = need[who].y*v[who][befa] * befy;
L[who].balance();
}
else {
while (L[who].x<l&&(befy - befx) * v[who][befa] * need[who].y + (S[who][L[who].x] - S[who][befa]) * befy * need[who].y <= need[who].x * befy) {
L[who].x++;
}
L[who].y = need[who].x*befy
- (befy - befx)*v[who][befa] * need[who].y
- (S[who][L[who].x - 1] - S[who][befa])*befy*need[who].y;
L[who].z = v[who][L[who].x] * need[who].y * befy;
L[who].balance();
}
if (cmp(L[who], mn)) {
mn = L[who];
mnw = who;
}
}
befa = mn.x, befx = mn.y, befy = mn.z;
while (befy > gj) {
befx /= gj, befy /= gj;
befx++;
}
printf("%lld %lld\n", (befa - 1)*befy + befx, befy);
people.erase(mnw);
ans.push_back(mnw);
}
for (int i = 0; i < ans.size(); i++)printf("%d ", ans[i]);
printf("%lld", *people.begin());
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |