답안 #254053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254053	2020-07-29T09:29:53 Z	TadijaSebez	Naan (JOI19_naan)	C++11	컴파일 오류	0 ms	0 KB

naan

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2005;
struct frac{
	ll p,q;
	frac():p(0),q(1){}
	frac(ll a,ll b=1):p(a),q(b){}
	frac operator+(frac b){return frac(p*b.q+b.p*q,q*b.q);}
	bool operator<(frac b){return (ldb)p/q<(ldb)b.p/b.q;}
}p[N][N];
int v[N][N],sum[N],ans[N];
bool was[N];
int main(){
	int n,l;
	scanf("%i %i",&n,&l);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=l;j++){
			scanf("%i",&v[i][j]);
			sum[i]+=v[i][j];
			v[i][j]*=n;
		}
		for(int j=1,ptr=1,take=0;j<=n;j++){
			int need=sum[i];
			while(v[i][ptr]-take<need){
				need-=v[i][ptr]-take;
				take=0;
				ptr++;
			}
			p[i][j]=frac(ptr-1)+frac(take+need,v[i][ptr]);
			take+=need;
		}
	}
	for(int i=1;i<=n;i++){
		frac mn=frac(l+1);
		int k;
		for(int j=1;j<=n;j++)if(!was[j]){
			if(p[j][i]<mn){
				mn=p[j][i];
				k=j;
			}
		}
		if(i!=n)printf("%lld %lld\n",mn.p,mn.q);
		ans[i]=k;
		was[k]=1;
	}
	for(int i=1;i<=n;i++)printf("%i ",ans[i]);
	return 0;
}

Compilation message

naan.cpp: In member function 'bool frac::operator<(frac)':
naan.cpp:10:33: error: 'ldb' was not declared in this scope
  bool operator<(frac b){return (ldb)p/q<(ldb)b.p/b.q;}
                                 ^~~
naan.cpp:10:33: note: suggested alternative: 'ldiv'
  bool operator<(frac b){return (ldb)p/q<(ldb)b.p/b.q;}
                                 ^~~
                                 ldiv
naan.cpp:10:37: error: expected ';' before 'p'
  bool operator<(frac b){return (ldb)p/q<(ldb)b.p/b.q;}
                                     ^
naan.cpp: In function 'int main()':
naan.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&l);
  ~~~~~^~~~~~~~~~~~~~~
naan.cpp:19:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%i",&v[i][j]);
    ~~~~~^~~~~~~~~~~~~~~