#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=2020;
int n,m,a[N][N],sum[N],mark[N];
vector<int> p;
vector<pair<int,int> > ans;
vector<pair<int,pair<int,int> > > v[N];
bool cmp(pair<int,pair<int,int> > i,pair<int,pair<int,int> > j){
pair<__int128,__int128> u=i.S,v=i.S;
return u.F*v.S<u.S*v.F;
}
void solve(int x){
int p=1;
f(i,1,n+1){
while(a[x][p]<i*sum[x]){
p++;
}
//cout<<p<<" "<<a[x][p]<<" "<<sum[i]<<endl;
pair<int,int> e;
e.S=a[x][p]-a[x][p-1];
e.F=e.S*(p-1)+(i*sum[x])-a[x][p-1];
v[i].pb(mp(x,e));
//cout<<x<<" "<<i<<" -> "<<e.F<<" "<<e.S<<endl;
}
}
main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
cin>>n>>m;
f(i,1,n+1){
f(j,1,m+1){
cin>>a[i][j];
sum[i]+=a[i][j];
a[i][j]*=n;
a[i][j]+=a[i][j-1];
}
}
f(i,1,n+1){
solve(i);
}
f(i,1,n+1){
sort(all(v[i]),cmp);
for(auto x : v[i]){
if(!mark[x.F]){
mark[x.F]=1;
p.pb(x.F);
ans.pb(x.S);
break;
}
}
}
f(i,0,ans.size()-1){
cout<<ans[i].F<<" "<<ans[i].S<<'\n';
}
f(i,0,p.size()) cout<<p[i]<<" ";
}
Compilation message
naan.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
49 | main(){
| ^~~~
naan.cpp: In function 'int main()':
naan.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
74 | f(i,0,ans.size()-1){
| ~~~~~~~~~~~~~~~~
naan.cpp:74:2: note: in expansion of macro 'f'
74 | f(i,0,ans.size()-1){
| ^
naan.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
77 | f(i,0,p.size()) cout<<p[i]<<" ";
| ~~~~~~~~~~~~
naan.cpp:77:2: note: in expansion of macro 'f'
77 | f(i,0,p.size()) cout<<p[i]<<" ";
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Not a fair distribution. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
0 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
332 KB |
Output is correct |
| 17 |
Correct |
1 ms |
332 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Incorrect |
0 ms |
332 KB |
Not a fair distribution. |
| 24 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Not a fair distribution. |
| 2 |
Halted |
0 ms |
0 KB |
- |
