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

• 問題: No.90 品物の並び替え
• ユーザー: karinohito
• 提出日時: 2021-04-16 17:15:14
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 91 ms / 5,000 ms
• コード長: 1,778 bytes
• コンパイル時間: 1,373 ms
• コンパイル使用メモリ: 113,412 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-02 17:34:11
• 合計ジャッジ時間: 1,857 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
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
//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll,ll>>>;
#define mp(A,B) make_pair(A,B)
bool OK(ll N) {
    ll k = 0;
    for (ll i = 2; i * i <= N; i++) {
        while(N % i == 0) {
            k++;
            N /= i;
        }
    }
    if (N == 1)k--;
    return (k > 1);
}
set<string> AN;
void dfs(string S, string nowS) {
    ll N = S.size();
    if (N == 1) {
        AN.insert(nowS + S);
        return;
    }
    else{
        dfs(S.substr(0, N - 1), nowS + S[N - 1]);
        dfs(S.substr(1, N - 1), nowS + S[0]);
    }
}
int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i, N) {
        A[i]=i;
    }
    vector<tuple<ll, ll, ll>> S(M);
    rep(i, M) {
        ll Q, W, E;
        cin >> Q >> W >> E;
        
        S[i] = make_tuple(Q, W, E);
    }
    ll an = 0;
    do {
        ll k = 0;
        rep(i, M) {
            if (A[get<0>(S[i])] < A[get<1>(S[i])]) {
                k += get<2>(S[i]);
            }
        }
        an = max(an, k);
    } while (next_permutation(all(A)));
    cout << an << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX