#284539 (C++11) No.90 品物の並び替え

• 問題: No.90 品物の並び替え
• ユーザー: xxxasdfghjk
• 提出日時: 2018-09-12 01:35:35
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 260 ms / 5,000 ms
• コード長: 1,600 bytes
• コンパイル時間: 1,121 ms
• コンパイル使用メモリ: 85,600 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-06-24 21:27:53
• 合計ジャッジ時間: 1,627 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
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
#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
#define MAX_N 100001
#define INF 2147483647
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
struct edge{
  int from,to,cost;
};
typedef vector<vector<edge> > AdjList;
AdjList graph;
typedef pair<int , int> P;
int main()
{
  int res=0,N,M,score[100][100],i1,i2,s;
  cin >> N >> M;
  REP(i,100)REP(j,100)score[i][j] = 0;
  REP(i,M){
    cin >> i1 >> i2 >> s;
    score[i1][i2] = s;
  }
  vector<int> v(N);
  set<int> d;
  REP(i,N){
    v[i] = i;
    d.insert(i);
  }
  do{
    int tmp=0;
    set<int> dd = d;
    REP(i,N){
      REP(j,N){
        if(dd.count(j)){
          tmp += score[v[i]][j];
        }
      }
      dd.erase(v[i]);
    }
    res = max(res,tmp);
  }while(next_permutation(v.begin(),v.end()));
  cout << res << endl;
  return 0;
}
int par[MAX_N];
int ranks[MAX_N];
//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }
}
//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}
void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}
bool same(int x, int y){
  return find(x) == find(y);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX