oj.uz

답안 #332291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332291 2020-12-02T00:00:58 Z rqi Power Plant (JOI20_power) C++14
100 / 100
 205 ms 31720 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
	// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi);
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi+1);
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
template<class T> void remDup(vector<T>& v) { 
	sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
template<class A, class B> str ts(pair<A,B> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 200005;
int N;
vi adj[mx];
string S;
int ans;
int dp[mx];

void genDP(int node, int prv = -1){
	int maxc = 0;
	int csum = 0;
	for(auto u: adj[node]){
		if(u == prv) continue;
		genDP(u, node);
		ckmax(maxc, dp[u]);
		csum+=dp[u];
	}
	if(S[node] == '0'){
		dp[node] = csum;	
	}
	else{
		ckmax(dp[node], 1);
		ckmax(ans, 1+maxc);
		ckmax(dp[node], -1+csum);
	}
	ckmax(ans, dp[node]);
}

int main() {
	setIO();
	cin >> N;
	for(int i = 1; i <= N-1; i++){
		int a, b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	cin >> S;
	S = "?"+S;
	genDP(1);
	ps(ans);
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

power.cpp: In function 'void setIn(str)':
power.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
power.cpp: In function 'void setOut(str)':
power.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 5 ms 5100 KB Output is correct
25 Correct 4 ms 5100 KB Output is correct
26 Correct 5 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 5 ms 5100 KB Output is correct
29 Correct 5 ms 5228 KB Output is correct
30 Correct 5 ms 5228 KB Output is correct
31 Correct 4 ms 5100 KB Output is correct
32 Correct 5 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 5 ms 5100 KB Output is correct
35 Correct 5 ms 5100 KB Output is correct
36 Correct 5 ms 5100 KB Output is correct
37 Correct 6 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5228 KB Output is correct
40 Correct 5 ms 5228 KB Output is correct
41 Correct 5 ms 5228 KB Output is correct
42 Correct 6 ms 5228 KB Output is correct
43 Correct 5 ms 5100 KB Output is correct
44 Correct 4 ms 5228 KB Output is correct
45 Correct 4 ms 5228 KB Output is correct
46 Correct 4 ms 5100 KB Output is correct
47 Correct 5 ms 5100 KB Output is correct
48 Correct 5 ms 5260 KB Output is correct
49 Correct 4 ms 5228 KB Output is correct
50 Correct 5 ms 5228 KB Output is correct
51 Correct 4 ms 5228 KB Output is correct
52 Correct 4 ms 5100 KB Output is correct
53 Correct 4 ms 5228 KB Output is correct
54 Correct 4 ms 5228 KB Output is correct
55 Correct 4 ms 5100 KB Output is correct
56 Correct 5 ms 5100 KB Output is correct
57 Correct 5 ms 5356 KB Output is correct
58 Correct 5 ms 5116 KB Output is correct
59 Correct 4 ms 5100 KB Output is correct
60 Correct 4 ms 5228 KB Output is correct
61 Correct 5 ms 5100 KB Output is correct
62 Correct 4 ms 5228 KB Output is correct
63 Correct 4 ms 5100 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 5 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 5 ms 5100 KB Output is correct
25 Correct 4 ms 5100 KB Output is correct
26 Correct 5 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 5 ms 5100 KB Output is correct
29 Correct 5 ms 5228 KB Output is correct
30 Correct 5 ms 5228 KB Output is correct
31 Correct 4 ms 5100 KB Output is correct
32 Correct 5 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 5 ms 5100 KB Output is correct
35 Correct 5 ms 5100 KB Output is correct
36 Correct 5 ms 5100 KB Output is correct
37 Correct 6 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5228 KB Output is correct
40 Correct 5 ms 5228 KB Output is correct
41 Correct 5 ms 5228 KB Output is correct
42 Correct 6 ms 5228 KB Output is correct
43 Correct 5 ms 5100 KB Output is correct
44 Correct 4 ms 5228 KB Output is correct
45 Correct 4 ms 5228 KB Output is correct
46 Correct 4 ms 5100 KB Output is correct
47 Correct 5 ms 5100 KB Output is correct
48 Correct 5 ms 5260 KB Output is correct
49 Correct 4 ms 5228 KB Output is correct
50 Correct 5 ms 5228 KB Output is correct
51 Correct 4 ms 5228 KB Output is correct
52 Correct 4 ms 5100 KB Output is correct
53 Correct 4 ms 5228 KB Output is correct
54 Correct 4 ms 5228 KB Output is correct
55 Correct 4 ms 5100 KB Output is correct
56 Correct 5 ms 5100 KB Output is correct
57 Correct 5 ms 5356 KB Output is correct
58 Correct 5 ms 5116 KB Output is correct
59 Correct 4 ms 5100 KB Output is correct
60 Correct 4 ms 5228 KB Output is correct
61 Correct 5 ms 5100 KB Output is correct
62 Correct 4 ms 5228 KB Output is correct
63 Correct 4 ms 5100 KB Output is correct
64 Correct 178 ms 15212 KB Output is correct
65 Correct 164 ms 15336 KB Output is correct
66 Correct 175 ms 15316 KB Output is correct
67 Correct 165 ms 15208 KB Output is correct
68 Correct 170 ms 15316 KB Output is correct
69 Correct 174 ms 15204 KB Output is correct
70 Correct 187 ms 15228 KB Output is correct
71 Correct 175 ms 15220 KB Output is correct
72 Correct 171 ms 15204 KB Output is correct
73 Correct 193 ms 30440 KB Output is correct
74 Correct 198 ms 30312 KB Output is correct
75 Correct 163 ms 15076 KB Output is correct
76 Correct 169 ms 15212 KB Output is correct
77 Correct 179 ms 15076 KB Output is correct
78 Correct 169 ms 15076 KB Output is correct
79 Correct 161 ms 15084 KB Output is correct
80 Correct 161 ms 15076 KB Output is correct
81 Correct 140 ms 15716 KB Output is correct
82 Correct 162 ms 15400 KB Output is correct
83 Correct 188 ms 21420 KB Output is correct
84 Correct 172 ms 23924 KB Output is correct
85 Correct 177 ms 23668 KB Output is correct
86 Correct 179 ms 16872 KB Output is correct
87 Correct 170 ms 16100 KB Output is correct
88 Correct 163 ms 16548 KB Output is correct
89 Correct 151 ms 16628 KB Output is correct
90 Correct 166 ms 16488 KB Output is correct
91 Correct 165 ms 16704 KB Output is correct
92 Correct 152 ms 16980 KB Output is correct
93 Correct 153 ms 20024 KB Output is correct
94 Correct 163 ms 22116 KB Output is correct
95 Correct 141 ms 20512 KB Output is correct
96 Correct 141 ms 18260 KB Output is correct
97 Correct 160 ms 16576 KB Output is correct
98 Correct 153 ms 15768 KB Output is correct
99 Correct 151 ms 15588 KB Output is correct
100 Correct 174 ms 19540 KB Output is correct
101 Correct 153 ms 16996 KB Output is correct
102 Correct 141 ms 16184 KB Output is correct
103 Correct 162 ms 15880 KB Output is correct
104 Correct 94 ms 16096 KB Output is correct
105 Correct 183 ms 26528 KB Output is correct
106 Correct 101 ms 15968 KB Output is correct
107 Correct 107 ms 15968 KB Output is correct
108 Correct 205 ms 31340 KB Output is correct
109 Correct 95 ms 16096 KB Output is correct
110 Correct 195 ms 31720 KB Output is correct
111 Correct 158 ms 15092 KB Output is correct