Submission #1970076


Source Code Expand

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

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }

inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して!!
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40) 

#define EPS (double)1e-14
#define INF (ll)1e18
#define mo  (ll)(1e9+7)
vvll g;
bool visit(int v, vector<int> &order, vector<int> &color) {
    color[v] = 1;
    for (auto e : g[v]) {
        if (color[e] == 2) continue;
        if (color[e] == 1) return false;
        if (!visit(e, order, color)) return false;
    }
    order.push_back(v); color[v] = 2;
    return true;
}

P dp[1ll<<20];
int main(void) {
    ll n; cin >> n;
    vll a(n); cin >> a;
    g.resize(n);


    repi(i, 1, n) {
        ll tmp; cin >> tmp; tmp--;
        g[tmp].pb(i);
    }

    vector<int> color(n);
    vector<int> order;
        visit(0, order, color);
//    cout << order << endl;
    vector<int> order_inv(order.size());
    rep(i, n) {
        order_inv[order[i]] = i;
    }


    rep(i, 1<<20) {
        dp[i] = P(INF, INF);
    }
    dp[0] = P(0, 0);
    rep(maski, 1ll<<n) if (dp[maski].fi != INF) {
        bitset<20> mask(maski);
        // iは塗れる?
        rep(i, n) if (mask[i] == 0) {
            // iに依存するモノ全てがぬられてる
            ll faf = 1;
            for (auto x : g[order[i]]) {
                faf &= mask[order_inv[x]]; 
            }
            // 塗れる
            if (faf) {
                ll v = dp[maski].se + a[order[i]];
//                cout  << bitset<20>(maski | (1ll << i)) << " " << v << endl;
                ll u = v;
                for (auto x : g[order[i]]) {
                    u -= a[x];
                }
                chmin(dp[maski | (1ll << i)], P(max(dp[maski].fi, v), u));
            }
        }
    }
    /*
    rep(maski, 1ll<<n) if (dp[maski].fi != INF) {
        bitset<20> mask(maski);
        cout << mask << " " << dp[maski]<<endl;
    }
    */
    ll ret = 0;
    rep(i, 1ll<<n) if (dp[i].fi != INF) {
        chmax(ret, dp[i].fi);
    }
    cout << ret << endl;

    return 0;
}

Submission Info

Submission Time
Task D - ディスクの節約
User hamko
Language C++14 (GCC 5.4.1)
Score 0
Code Size 7285 Byte
Status
Exec Time 71 ms
Memory 16764 KB

Compile Error

./Main.cpp: In function ‘void vizGraph(vvll&, int, std::string)’:
./Main.cpp:41:478: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
 void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
                                                                                                                                                                                                                                                                                                                                              ...

Test Cases

Set Name Score / Max Score Test Cases
All 0 / 600 00_sample01, 00_sample02, 00_sample03, 01_handmade00, 01_handmade01, 02_tayama_killer00, 10_complete00, 10_complete01, 10_complete02, 10_complete03, 20_urchin-small00, 20_urchin-small01, 20_urchin-small02, 20_urchin-small03, 20_urchin-small04, 21_urchin-large00, 21_urchin-large01, 21_urchin-large02, 21_urchin-large03, 21_urchin-large04, 30_random-small00, 30_random-small01, 30_random-small02, 30_random-small03, 30_random-small04, 30_random-small05, 30_random-small06, 30_random-small07, 30_random-small08, 30_random-small09, 30_random-small10, 30_random-small11, 30_random-small12, 30_random-small13, 30_random-small14, 30_random-small15, 30_random-small16, 30_random-small17, 30_random-small18, 30_random-small19, 30_random-small20, 30_random-small21, 30_random-small22, 30_random-small23, 30_random-small24, 30_random-small25, 30_random-small26, 30_random-small27, 30_random-small28, 30_random-small29, 31_random-large00, 31_random-large01, 31_random-large02, 31_random-large03, 31_random-large04, 40_boundary00, 40_boundary01
Case Name Status Exec Time Memory
00_sample01 6 ms 16764 KB
00_sample02 6 ms 16636 KB
00_sample03 6 ms 16636 KB
01_handmade00 6 ms 16636 KB
01_handmade01 6 ms 16636 KB
02_tayama_killer00 6 ms 16636 KB
10_complete00 10 ms 16636 KB
10_complete01 6 ms 16636 KB
10_complete02 6 ms 16636 KB
10_complete03 6 ms 16636 KB
20_urchin-small00 6 ms 16636 KB
20_urchin-small01 6 ms 16636 KB
20_urchin-small02 6 ms 16636 KB
20_urchin-small03 6 ms 16636 KB
20_urchin-small04 6 ms 16636 KB
21_urchin-large00 71 ms 16636 KB
21_urchin-large01 70 ms 16636 KB
21_urchin-large02 70 ms 16636 KB
21_urchin-large03 70 ms 16636 KB
21_urchin-large04 71 ms 16636 KB
30_random-small00 6 ms 16636 KB
30_random-small01 6 ms 16636 KB
30_random-small02 6 ms 16636 KB
30_random-small03 6 ms 16636 KB
30_random-small04 6 ms 16636 KB
30_random-small05 6 ms 16636 KB
30_random-small06 6 ms 16636 KB
30_random-small07 6 ms 16636 KB
30_random-small08 6 ms 16636 KB
30_random-small09 6 ms 16636 KB
30_random-small10 6 ms 16636 KB
30_random-small11 6 ms 16636 KB
30_random-small12 6 ms 16636 KB
30_random-small13 6 ms 16636 KB
30_random-small14 6 ms 16636 KB
30_random-small15 6 ms 16636 KB
30_random-small16 6 ms 16636 KB
30_random-small17 6 ms 16636 KB
30_random-small18 6 ms 16636 KB
30_random-small19 6 ms 16636 KB
30_random-small20 6 ms 16636 KB
30_random-small21 6 ms 16636 KB
30_random-small22 6 ms 16636 KB
30_random-small23 6 ms 16636 KB
30_random-small24 6 ms 16636 KB
30_random-small25 6 ms 16636 KB
30_random-small26 6 ms 16636 KB
30_random-small27 6 ms 16636 KB
30_random-small28 6 ms 16636 KB
30_random-small29 6 ms 16636 KB
31_random-large00 9 ms 16636 KB
31_random-large01 10 ms 16636 KB
31_random-large02 10 ms 16636 KB
31_random-large03 10 ms 16636 KB
31_random-large04 9 ms 16636 KB
40_boundary00 5 ms 16636 KB
40_boundary01 69 ms 16636 KB