#200857 (C++14) No.90 品物の並び替え

• 問題: No.90 品物の並び替え
• ユーザー: gurualo
• 提出日時: 2017-08-29 16:15:46
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 404 ms / 5,000 ms
• コード長: 2,752 bytes
• コンパイル時間: 1,946 ms
• コンパイル使用メモリ: 208,172 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-06 09:39:53
• 合計ジャッジ時間: 3,125 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 9

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <immintrin.h>
using namespace std;
//inline int popcount64(uint64_t x) {   return _mm_popcnt_u64(x);}
int popcount(int x){return  __builtin_popcount(x);}
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
typedef pair<int,int> P;
map<P,int> score;
int N,M;
int Ns[9]={0,1,2,3,4,5,6,7,8};
int main(){
    cin>>N>>M;
    for(int i=0;i<M;i++){
        int a,b,s;
        cin>>a>>b>>s;
        score[P(a,b)]=s;
    }
    //↑ OK
    long ans=0;long sum=0;
    //全列挙しても最大9! 内側で9^2なので間に合うはず
    //nextpermutationは1234は返してくれない！
    {
        REP(i,N){FOR(j,i,N){ /*if(score[P(Ns[i],Ns[j])]){ cerr<<Ns[i]<<" "<<Ns[j]<<" "<<score[P(Ns[i],Ns[j])]<<endl;}*/ sum+=score[P(Ns[i],Ns[j])]; 
            }}
        ans=max(ans,sum);
    }
    while(next_permutation(Ns,Ns+N)){
        sum=0;
        REP(i,N){FOR(j,i,N){ /*if(score[P(Ns[i],Ns[j])]){ cerr<<Ns[i]<<" "<<Ns[j]<<" "<<score[P(Ns[i],Ns[j])]<<endl;}*/ sum+=score[P(Ns[i],Ns[j])]; 
            }}
        
        ans=max(ans,sum);
    }
    cout<<ans<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX