# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292527 | arnold518 | Naan (JOI19_naan) | C++14 | 1805 ms | 103544 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2000;
int N, L;
ll A[MAXN+10][MAXN+10];
struct Frac
{
ll x, y;
Frac() {}
Frac(ll _x, ll _y)
{
x=_x; y=_y;
norm();
}
void norm()
{
ll g=__gcd(x, y);
x/=g; y/=g;
}
};
bool operator >= (Frac p, Frac q) { p.norm(); q.norm(); return (__int128)p.y*q.x>=(__int128)q.y*p.x; }
Frac B[MAXN+10][MAXN+10];
bool vis[MAXN+10];
int ans[MAXN+10];
int main()
{
scanf("%d%d", &N, &L);
for(int i=1; i<=N; i++)
{
for(int j=1; j<=L; j++) scanf("%lld", &A[i][j]), A[i][j]+=A[i][j-1];
for(int j=1, p=1; j<=N; j++)
{
for(; p<L && A[i][p]*N<=j*A[i][L]; p++);
ll t=j*A[i][L]-N*A[i][p-1];
B[i][j]=Frac(N*(A[i][p]-A[i][p-1]), (p-1)*N*(A[i][p]-A[i][p-1])+t);
B[i][j].norm();
//printf("(%lld %lld !%d) ", B[i][j].x, B[i][j].y, p);
}
//printf("\n");
}
for(int i=1; i<=N; i++)
{
Frac t; int val=-1;
for(int j=1; j<=N; j++)
{
if(vis[j]) continue;
if(val==-1 || t>=B[j][i]) val=j, t=B[j][i];
}
if(i<N) printf("%lld %lld\n", t.y, t.x);
ans[i]=val;
vis[val]=true;
}
for(int i=1; i<=N; i++) printf("%d ", ans[i]); printf("\n");
}
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... |