oj.uz

답안 #253346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253346 2020-07-27T18:38:33 Z Benq Džumbus (COCI19_dzumbus) C++14
110 / 110
 83 ms 15480 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<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 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) {
	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
	#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
	#define dbg(...) 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() { ios_base::sync_with_stdio(0); cin.tie(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
}

int N,M,D[1001];
vi adj[1001];
vl dp[1001][3];
bool vis[1001];

vl ad(const vl& a, const vl& b) {
	vl c(sz(a)+sz(b)-1,INF);
	F0R(i,sz(a)) F0R(j,sz(b)) ckmin(c[i+j],a[i]+b[j]);
	return c;
}

vl mn(vl a, const vl& b) {
	while (sz(a) < sz(b)) a.pb(INF);
	F0R(i,sz(b)) ckmin(a[i],b[i]);
	return a;
}

void dfs(int x, int p) {
	dbg(x,p);
	assert(!vis[x]); vis[x] = 1;
	dp[x][0] = {0}; dp[x][1] = {INF,D[x]};
	trav(t,adj[x]) if (t != p) {
		dfs(t,x);
		dp[x][0] = ad(dp[x][0],mn(dp[t][0],dp[t][2]));
		dp[x][2] = mn(ad(dp[x][2],mn(mn(dp[t][0],dp[t][1]),dp[t][2])),ad(dp[x][1],mn(dp[t][1],dp[t][2])));
		dp[x][1] = ad(dp[x][1],dp[t][0]);
	}
	//dbg("DONE",x);
}

int main() {
	setIO(); re(N,M);
	FOR(i,1,N+1) re(D[i]);
	F0R(i,M) {
		int a,b; re(a,b);
		adj[a].pb(b), adj[b].pb(a);
	}
	vl res = {0};
	FOR(i,1,N+1) if (!vis[i]) {
		dfs(i,0);
		res = ad(res,mn(dp[i][0],dp[i][2]));
	}
	R0F(i,sz(res)-1) ckmin(res[i],res[i+1]);
	//dbg("OK");
	//dbg(res);
	//exit(0);
	int Q; re(Q);
	F0R(i,Q) {
		int S; re(S);
		int ind = lstTrue(0,sz(res)-1,[&](int x) {
			return res[x] <= S;
		});
		ps(ind);
	}
	// 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

dzumbus.cpp: In function 'void dfs(int, int)':
dzumbus.cpp:191:10: warning: statement has no effect [-Wunused-value]
  dbg(x,p);
          ^
dzumbus.cpp: In function 'void setIn(str)':
dzumbus.cpp:162:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(str s) { freopen(s.c_str(),"r",stdin); }
                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
dzumbus.cpp: In function 'void setOut(str)':
dzumbus.cpp:163:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(str s) { freopen(s.c_str(),"w",stdout); }
                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9600 KB Output is correct
2 Correct 18 ms 13432 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9600 KB Output is correct
2 Correct 18 ms 13432 KB Output is correct
3 Correct 83 ms 15480 KB Output is correct
4 Correct 82 ms 13304 KB Output is correct
5 Correct 78 ms 11896 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 2552 KB Output is correct
2 Correct 64 ms 2296 KB Output is correct
3 Correct 65 ms 2808 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9600 KB Output is correct
2 Correct 18 ms 13432 KB Output is correct
3 Correct 83 ms 15480 KB Output is correct
4 Correct 82 ms 13304 KB Output is correct
5 Correct 78 ms 11896 KB Output is correct
6 Correct 64 ms 2552 KB Output is correct
7 Correct 64 ms 2296 KB Output is correct
8 Correct 65 ms 2808 KB Output is correct
9 Correct 74 ms 3064 KB Output is correct
10 Correct 74 ms 3448 KB Output is correct
11 Correct 71 ms 3064 KB Output is correct