#292194 (C++14) No.472 平均順位

• 問題: No.472 平均順位
• ユーザー: daleksprinter
• 提出日時: 2018-10-18 11:48:59
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: MLE
• 実行時間: -
• コード長: 2,567 bytes
• コンパイル時間: 1,690 ms
• コンパイル使用メモリ: 172,716 KB
• 実行使用メモリ: 589,996 KB
• 最終ジャッジ日時: 2024-10-15 13:18:53
• 合計ジャッジ時間: 15,116 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	MLE	-
testcase_01	MLE	-
testcase_02	MLE	-
testcase_03	MLE	-
testcase_04	MLE	-
testcase_05	MLE	-
testcase_06	MLE	-
testcase_07	MLE	-
testcase_08	MLE	-
testcase_09	MLE	-
testcase_10	MLE	-
testcase_11	MLE	-
testcase_12	MLE	-
testcase_13	TLE	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-

コンパイルメッセージ

main.cpp:21:17: warning: overflow in conversion from 'long int' to 'int' changes value from '100100100100100100' to '-1133342716' [-Woverflow]
   21 | const int inf = 100100100100100100;
      |                 ^~~~~~~~~~~~~~~~~~

ソースコード

#include <bits/stdc++.h>
using namespace std;


/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
//#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))


/* alias */
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
const int inf = 100100100100100100;
const int mod = 1e9;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};


/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
vector<int> cs(vector<int> arr){vector<int> tmp;if(arr.size() == 0) return tmp;tmp.push_back(arr[0]);rep(i,1,arr.size()){tmp.push_back(tmp.back() + arr[i]);}return tmp;}



/* main */
int n, p; 
vector<vi> arr(5000,vi());
double dp[5000][15000];

double dfs(int i, int solved, int point){

    if(dp[i][solved] > -1) return dp[i][solved];

    if(i == n){
        if(solved == p){
            return point / (n * 1.0);
        }else{
            return 200000.0;
        }
    }

    double ans = 200000.0;

    rep(j,0,3){
        chmin(ans, dfs(i + 1, solved + j, point + arr[i][j]));
    }

    chmin(ans, dfs(i + 1, solved + 3, point + 1));

    return dp[i][solved] = ans;

}


signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);


    
    cin >> n >> p;

    

    rep(i,0,n){
        rep(j,0,3){
            arr[i].push_back(input());
        }
    }



    memset(dp, -1, sizeof(dp));

    printf("%5f\n", dfs(0,0,0));















}