#961074 (C++17) No.2677 Minmax Independent Set

提出ソース

結果

問題	No.2677 Minmax Independent Set
ユーザー	dyktr_06
提出日時	2024-03-15 23:47:57
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,536 bytes
コンパイル時間	4,009 ms
コンパイル使用メモリ	274,636 KB
実行使用メモリ	95,792 KB
最終ジャッジ日時	2024-09-30 03:21:56
合計ジャッジ時間	128,764 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,809 ms 6,820 KB
testcase_01	AC	1,809 ms 6,820 KB
testcase_02	AC	1,809 ms 6,816 KB
testcase_03	AC	1,810 ms 6,816 KB
testcase_04	AC	1,808 ms 6,816 KB
testcase_05	AC	1,995 ms 73,592 KB
testcase_06	AC	1,984 ms 72,240 KB
testcase_07	AC	1,983 ms 72,292 KB
testcase_08	AC	1,983 ms 71,832 KB
testcase_09	AC	1,984 ms 72,504 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	1,944 ms 93,296 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	1,990 ms 67,920 KB
testcase_17	AC	1,991 ms 68,048 KB
testcase_18	AC	1,912 ms 46,916 KB
testcase_19	AC	1,932 ms 53,412 KB
testcase_20	AC	1,842 ms 20,472 KB
testcase_21	AC	1,953 ms 58,232 KB
testcase_22	AC	1,818 ms 8,704 KB
testcase_23	AC	1,810 ms 6,820 KB
testcase_24	AC	1,809 ms 6,816 KB
testcase_25	AC	1,809 ms 6,816 KB
testcase_26	AC	1,808 ms 6,820 KB
testcase_27	AC	1,809 ms 6,816 KB
testcase_28	WA	-
testcase_29	AC	1,997 ms 95,792 KB
testcase_30	AC	1,811 ms 6,820 KB
testcase_31	AC	1,809 ms 6,816 KB
testcase_32	AC	1,808 ms 6,816 KB
testcase_33	AC	1,809 ms 6,816 KB
testcase_34	AC	1,811 ms 6,816 KB
testcase_35	AC	1,809 ms 6,820 KB
testcase_36	AC	1,810 ms 6,820 KB
testcase_37	AC	1,809 ms 6,816 KB
testcase_38	AC	1,808 ms 6,816 KB
testcase_39	AC	1,811 ms 6,816 KB
testcase_40	AC	1,811 ms 6,816 KB
testcase_41	AC	1,812 ms 6,820 KB
testcase_42	AC	1,818 ms 7,424 KB
testcase_43	AC	1,823 ms 11,460 KB
testcase_44	AC	1,849 ms 19,188 KB
testcase_45	AC	1,881 ms 35,132 KB
testcase_46	TLE	-
testcase_47	TLE	-
testcase_48	TLE	-
testcase_49	TLE	-
testcase_50	WA	-
testcase_51	AC	1,813 ms 6,820 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	1,811 ms 6,816 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	1,879 ms 33,584 KB
testcase_61	AC	1,960 ms 68,172 KB
testcase_62	AC	1,957 ms 71,452 KB
testcase_63	AC	1,950 ms 78,544 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct RandomNumber{
    int64_t seed = chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count();
    uniform_int_distribution<long long> p;
    mt19937_64 rnd;

	RandomNumber(long long l = 0, long long r = 0){
        rnd = mt19937_64(seed);
        p = uniform_int_distribution<long long>(l, r);
    }

	long long get(){
        return p(rnd);
    }
};

ll n;
vector<vll> G;

void input(){
    in(n);
}

ll id(ll prev, ll curr){
    return n * prev + curr;
}

void solve(){
    G.resize(n);
    rep(i, n - 1){
        ll a, b; in(a, b);
        a--, b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    unordered_map<ll, vll> mp;
    auto dfs = [&](auto &self, ll curr, ll prev) -> vll {
        if(mp.count(id(prev, curr))){
            return mp[id(prev, curr)];
        }
        vll dp(2);
        dp[1] = 1;
        for(auto x : G[curr]){
            if(x == prev) continue;
            vll ndp = self(self, x, curr);
            dp[1] += ndp[0];
            dp[0] += max(ndp[0], ndp[1]);
        }
        return mp[id(prev, curr)] = dp;
    };
    ll ans = INF;
    RandomNumber rnd(0, n - 1);
    ll ti = clock();
    while(clock() - ti <= 180 * CLOCKS_PER_SEC / 100){
        vll dp = dfs(dfs, rnd.get(), -1);
        chmin(ans, dp[1]);
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード