제출 #383191

#제출 시각아이디문제언어결과실행 시간메모리
383191ogibogi2004Naan (JOI19_naan)C++14
0 / 100
4 ms624 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long ll n,l; ll v[2048][2048]; pair<ll,ll> p[2048][2048]; bool cmp(pair<ll,ll> p1,pair<ll,ll> p2) { return p1.first*p2.second<p1.second*p2.first; } bool used[2048]; int main() { cin>>n>>l; for(int i=1;i<=n;i++) { for(int j=1;j<=l;j++) { cin>>v[i][j]; } } for(int i=1;i<=n;i++) { ll sum=0; for(ll j=1;j<=l;j++) { sum+=v[i][j]; } ll sumv=0,needed; ll r=1; for(ll j=1;j<n;j++) { needed=sum*j; while(sumv+v[i][r]*n<=needed) { sumv+=v[i][r]*n; r++; } p[i][j]={(r-1)*v[i][r]*n+needed-sumv,n*v[i][r]}; } } vector<int>ans; for(int i=1;i<n;i++) { bool found=0; pair<ll,ll> best; ll idx; for(int j=1;j<=n;j++) { if(used[j])continue; if(!found||cmp(p[i][j],best)) { best=p[i][j];found=1; idx=j; } } cout<<p[i][idx].first<<" "<<p[i][idx].second<<endl; used[idx]=1; ans.push_back(idx); } for(int i=1;i<=n;i++)if(!used[i])ans.push_back(i); for(auto xd:ans) { cout<<xd<<" "; } cout<<endl; return 0; }

컴파일 시 표준 에러 (stderr) 메시지

naan.cpp: In function 'int main()':
naan.cpp:59:16: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   59 |   ans.push_back(idx);
      |   ~~~~~~~~~~~~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...