#undef KEV
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 2005, inf = 1e9;
using opl = long long;
int n, L;
opl v[MAX_N][MAX_N];
using lll = __int128;
#define ll lll
opl gcd(lll a, lll b) { return gcd(opl(a), opl(b)); }
struct frac {
ll up, dn;
void ref() { ll g = gcd(up, dn); up/=g, dn/=g; }
frac(ll a, ll b) :
up(a), dn(b) {}
frac(ll v) :
up(v), dn(1) {}
void sca(ll v) { up *= v, dn *= v; }
frac& chk() {
if (dn > inf) {
ll num = up / dn, lft = up % dn;
up = (lll)inf * lft / dn + num * inf, dn = inf;
}
return *this;
}
};
frac operator * (frac a, frac b) { a.up *= b.up, a.dn *= b.dn, a.ref(); return a.chk(); }
frac operator * (frac a, ll v) { a.up *= v; return a.chk(); }
frac operator / (frac a, ll v) { a.dn *= v; return a.chk(); }
frac operator + (frac a, frac b) {
ll da = a.dn, db = b.dn, nd = da / gcd(da, db) * db;
a.sca(nd/da), b.sca(nd/db);
a.up += b.up;
return a.chk();
}
frac operator - (frac a, frac b) {
ll da = a.dn, db = b.dn, nd = da / gcd(da, db) * db;
a.sca(nd/da), b.sca(nd/db);
a.up -= b.up;
return a.chk();
}
frac& operator += (frac &a, frac b) { return a = a + b; }
frac& operator -= (frac &a, frac b) { return a = a - b; }
bool operator < (frac a, frac b) { return (lll)a.up * b.dn < (lll)b.up * a.dn; }
bool operator > (frac a, frac b) { return (lll)a.up * b.dn > (lll)b.up * a.dn; }
ostream& operator << (ostream& out, frac a) { return out << (opl)a.up << ' ' << (opl)a.dn; }
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> L;
for (int i = 0;i < n;++i)
for (int j = 0;j < L;++j)
cin >> v[i][j];
vector<int> od(n); iota(AI(od), 0);
vector<int> res;
bool ok = true;
vector<frac> sep{{0, 1}};
debug(AI(od));
for (int pos = 0;pos < n;++pos) {
int id = -1;
frac ned(inf, 1);
for (int x : od) {
auto geted = [&]() {
int sum = 0;
for (int j = 0;j < L;++j)
sum += v[x][j];
auto [up, dn] = sep.back();
int atid = up / dn, lft = dn - up % dn;
DE(x, atid, lft, dn);
frac need{sum, n};
if (frac(lft, dn) * v[x][atid] > need) {
frac len = need / v[x][atid];
return len + sep.back();
}
need -= frac(lft, dn) * v[x][atid];
++atid;
while (atid < L) {
if (need < v[x][atid]) break;
need -= v[x][atid++];
}
if (atid == L && need > frac(0)) {
ok = false;
return frac(inf, 1);
}
frac ed = frac(atid) + need / v[x][atid];
return ed;
};
frac ed = geted();
if (chmin(ned, ed))
id = x;
}
if (id == -1) {
ok = false;
break;
}
res.pb(id);
sep.pb(ned);
od.erase(find(AI(od), id));
}
if (!ok)
return puts("-1"), 0;
for (int i = 1;i < n;++i)
cout << sep[i] << '\n';
for (int i = 0;i < n;++i)
cout << od[i]+1 << " \n"[i+1==n];
return 0;
//cout << -1 << '\n';
}
Compilation message
naan.cpp: In function 'int32_t main()':
naan.cpp:16:20: warning: statement has no effect [-Wunused-value]
16 | #define debug(...) 0
| ^
naan.cpp:85:2: note: in expansion of macro 'debug'
85 | debug(AI(od));
| ^~~~~
naan.cpp: In lambda function:
naan.cpp:15:17: warning: statement has no effect [-Wunused-value]
15 | #define DE(...) 0
| ^
naan.cpp:101:5: note: in expansion of macro 'DE'
101 | DE(x, atid, lft, dn);
| ^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Not a fair distribution. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
P is not a permutation of 1,2,..,N |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Not a fair distribution. |
| 2 |
Halted |
0 ms |
0 KB |
- |
