fork download
  1. #include<bits/stdc++.h>
  2. #define oo (long long)(1e18)
  3. using namespace std;
  4.  
  5. long long n, a[21][21], F[1<<21];
  6. int main()
  7. {
  8. ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  9.  
  10. cin>>n;
  11. for(long long i=0; i<n; i++)
  12. for(long long j=0; j<n; j++) cin>>a[i][j];
  13.  
  14.  
  15.  
  16. for(long long X=0; X<(1<<n); X++)
  17. for(long long i=0; i<n; i++)
  18. {
  19. long long cnt = __builtin_popcount(X);
  20. if( ( (X>>i) & 1) == 0 )
  21. {
  22. long long Y = X | (1<<i);
  23. F[Y] = max( F[Y] , F[X] + a[i][cnt] );
  24. }
  25. }
  26.  
  27. long long res = -oo;
  28. for(long long i=0; i<(1<<n); i++) res = max( res , F[i] );
  29. cout << res;
  30. return 0;
  31. }
  32. /*
  33.   Solve by: Truong Tuan Kiet - Informatics K36. Solve in 10h00 - 25/6/2025
  34. */
  35.  
  36.  
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty