Contest Duration: ~ (local time) (120 minutes)

Submission #1986920

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)

ll n;
vll x, a;
vvll g;
vll cost;
bitset<20> ok[1<<20];
return -1;
}
ll ret = 0;
repi(i, 1, n) {
}
return ret;
}
bool check(ll v) {
vector<bool> memo(1<<n);
vll q;
q.pb(0);
while (q.size()) {
vll q_next;
for (auto mask : q) {
if (mask == (1ll << n) - 1) return /*cout<<"YES"<<endl,*/true;
rep(i, n) if (!(mask & (1ll << i))) {
/*
// iに到達するのに必要なjが全て1か？
ll faf = 1;
repi(j, 1, n) if (a[j-1] == i) {
faf &= !!(mask & (1ll << j)); // &&=の方が良いね
}
*/
//                cout << mask << " #OK" << endl;
if (cost[mask] + x[i] <= v) {
}
}
}
swap(q, q_next);
}
return /*cout<<"NO"<<endl,*/ false;
}
int main(void) {
cin >> n;
g.resize(n);
x.resize(n); cin >> x;
a.resize(n-1); cin >> a;
rep(i, n-1) a[i]--;
rep(i, n-1) {
g[a[i]].pb(i);
}
cost.resize(1<<n);
rep(i, 1<<n) {
cost[i] = calccost(i);
}
rep(m, 1<<n) {
ok[m] = (1<<20)-1;
repi(i, 1, n) if ((m & (1ll << i)) == 0) {
ok[m][a[i-1]] = 0;
//            cout << a[i-1] << " ";
}
//        cout << endl;
//        cout << bitset<20>(m)<< " " << ok[m] << endl;
}
/*
cout << a << endl;
cout << cost(30) << endl;
*/
// [0, INF)
ll ng = -1, ok = INF;
while (ok - ng > 1) {
//        cout << "######################"<< endl;
ll mid = (ok + ng) / 2;
//        cout << mid << endl;
(check(mid) ? ok : ng) = mid;
}
cout << ok << endl;

return 0;
}
```

#### Submission Info

Submission Time 2018-01-17 13:22:12+0900 D - ディスクの節約 hamko C++14 (GCC 5.4.1) 0 7612 Byte TLE 2657 ms 47844 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()); }
...```

#### Judge Result

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 4 ms 512 KB
00_sample02 1 ms 256 KB
00_sample03 1 ms 256 KB
02_tayama_killer00 1 ms 256 KB
10_complete00 137 ms 16892 KB
10_complete01 1 ms 256 KB
10_complete02 1 ms 256 KB
10_complete03 2 ms 380 KB
20_urchin-small00 2 ms 256 KB
20_urchin-small01 2 ms 256 KB
20_urchin-small02 2 ms 256 KB
20_urchin-small03 2 ms 256 KB
20_urchin-small04 2 ms 256 KB
21_urchin-large00 2657 ms 47016 KB
21_urchin-large01 2657 ms 46404 KB
21_urchin-large02 2657 ms 47020 KB
21_urchin-large03 2657 ms 47844 KB
21_urchin-large04 2657 ms 46740 KB
30_random-small00 1 ms 256 KB
30_random-small01 1 ms 256 KB
30_random-small02 1 ms 256 KB
30_random-small03 1 ms 256 KB
30_random-small04 1 ms 256 KB
30_random-small05 1 ms 256 KB
30_random-small06 1 ms 256 KB
30_random-small07 1 ms 256 KB
30_random-small08 1 ms 256 KB
30_random-small09 1 ms 256 KB
30_random-small10 1 ms 256 KB
30_random-small11 1 ms 256 KB
30_random-small12 1 ms 256 KB
30_random-small13 1 ms 256 KB
30_random-small14 1 ms 256 KB
30_random-small15 1 ms 256 KB
30_random-small16 1 ms 256 KB
30_random-small17 1 ms 256 KB
30_random-small18 1 ms 256 KB
30_random-small19 1 ms 256 KB
30_random-small20 1 ms 256 KB
30_random-small21 1 ms 256 KB
30_random-small22 1 ms 256 KB
30_random-small23 1 ms 256 KB
30_random-small24 1 ms 256 KB
30_random-small25 1 ms 256 KB
30_random-small26 1 ms 256 KB
30_random-small27 1 ms 256 KB
30_random-small28 1 ms 256 KB
30_random-small29 1 ms 256 KB
31_random-large00 129 ms 16892 KB
31_random-large01 191 ms 17264 KB
31_random-large02 178 ms 17080 KB
31_random-large03 181 ms 17228 KB
31_random-large04 136 ms 16892 KB
40_boundary00 1 ms 256 KB
40_boundary01 2657 ms 46628 KB