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;
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define bas(x) #x << ": " << x
#define prarr(x, n) cout << #x << ": "; for (int qsd = 0; qsd < n; qsd++) cout << x[qsd] << " "; cout << endl;
#define prarrv(x) cout << #x << ": "; for (int qsd = 0; qsd < (int)x.size(); qsd++) cout << x[qsd] << " "; cout << endl;
#define inside sl<=l%&&r<=sr
#define outside sr<l||r<sl
typedef long long ll;
int n, m;
int mat[2002][2002];
ll presum[2002][2002];
pair<double, double> sum(pair<double, double> a, pair<double, double> b){
double pay = a.first*b.second + a.second*b.first;
double payda = a.second*b.second;
return mp(pay, payda);
}
pair<double, double> get(int i, double pay, double payda){
/*double ans = presum[i][(int)(pay/payda)-1];
ans += mat[i][(int)(pay/payda)]*((pay/payda) - (int)(pay/payda));
return ans;*/
return sum(mp(presum[i][(int)(pay/payda)-1], 1), mp((double)((int)pay%(int)payda)*mat[i][(int)(pay/payda)], payda));
}
pair<double, double> getmin(int i, pair<double, double> puan){
//cout << "getmin(" << i << ", " << puan << ")" << endl;
if (presum[i][m-1] < puan.first/puan.second) return mp(-1, -1);
int l = 0;
int r = m-1;
while (l < r){
int m = (l+r+1)/2;
if (presum[i][m] > puan.first/puan.second) r = m-1;
else l = m;
}
if (presum[i][l] == puan.first/puan.second) return mp(l+1, 1);
puan = sum(puan, mp(-presum[i][l], 1));
// mat[i][l+1]*oran = puan;
return sum(mp(l+1, 1), mp(puan.first, puan.second*mat[i][l+1]));
}
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; i++){
ll cur = 0;
for (int j = 0; j < m; j++){
cin >> mat[i][j];
cur += mat[i][j];
presum[i][j] = cur;
}
}
/*for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
cout << mat[i][j] << " ";
}
cout << endl;
}
cout << endl;
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
cout << presum[i][j] << " ";
}
cout << endl;
}
cout << endl;*/
vector<pair<ll, ll> > ans;
vector<int> p;
bitset<2002> vis;
vis.reset();
double cpay = 0;
double cpayda = 1;
for (int bol = 0; bol < n; bol++){
//cout << bas(bol) << endl;
double minpay = 10000000;
double minpayda = 1;
int ci = 0;
for (int i = 0; i < n; i++){
if (vis[i]) continue;
//cout << bas(i) << endl;
pair<double, double> suan = get(i, cpay, cpayda);
pair<double, double> minoran = getmin(i, sum(suan, mp(presum[i][m-1], (double)n)));
//cout << bas(minoran.first) << ", " << bas(minoran.second) << endl;
if (minoran.first == -1){
cout << -1 << endl;
exit(0);
}
if (minpay/minpayda > minoran.first/minoran.second){
minpay = minoran.first;
minpayda = minoran.second;
ci = i;
}
}
cpay = minpay;
cpayda = minpayda;
ans.pb(mp(cpay, cpayda));
p.pb(ci+1);
vis[ci] = 1;
//cout << cpay << " " << cpayda << " -> " << ci << endl;
}
for (int i = 0; i < n-1; i++) cout << ans[i].first << " " << ans[i].second << endl;
for (int i = 0; i < n; i++) cout << p[i] << " ";
cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |