oj.uz

답안 #318666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318666 2020-11-02T21:24:03 Z jc713 Tug of War (BOI15_tug) C++17
100 / 100
 1377 ms 13316 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

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

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#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 

// loops
#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; // not too close to LLONG_MAX
const int IINF = 1e9;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
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

tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> 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 = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> 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 = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> 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); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,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
}
tcT> str ts(complex<T> 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; }
tcTU> str ts(pair<T,U> p);
tcT> 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
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#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
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

multiset<pi> adj[60000];

ll comp = 0;
ll comp2 = 0;

void dfs(int curr, int dist){
	auto temp = adj[curr].begin();
	if(temp == adj[curr].end())
		return;
	if(dist % 2 == 0)
		comp += temp->s;
	else
		comp2 += temp->s;
	adj[temp->f].erase(adj[temp->f].find({curr, temp->s}));
	adj[curr].erase(temp);
	dfs(temp->f, dist + 1);
}

int main(){
	setIO();
	int n, k;
	cin >> n >> k;
	ll SUM = 0;
	F0R(a, 2 * n){
		int l, r, s;
		cin >> l >> r >> s;
		SUM += s;
		l--, r--;
		r = n + r;
		adj[l].insert({r, s});
		adj[r].insert({l, s});
	}
	ll L = 0;
	set<pi> s;
	F0R(a, 2 * n)
		s.insert({sz(adj[a]), a});
	while(sz(s) && s.begin()->f < 2){
		auto temp = s.begin();
		if(temp->f == 0){
			cout << "NO" << endl;
			return 0;
		}
		auto t = adj[temp->s].begin();
		if(temp->s < n)
			L += t->s;
		s.insert({sz(adj[t->f]) - 1, t->f});
		s.erase({sz(adj[t->f]), t->f});
		s.erase(temp);
		adj[t->f].erase(adj[t->f].find({temp->s, t->s}));
		adj[temp->s].clear();
	}
	bitset<600001> dp;
	dp[0] = 1;
	vi vals;
	vi com;
	F0R(a, n)
		if(sz(adj[a]) > 1){
			comp = 0;
			comp2 = 0;
			dfs(a, 0);
			vals.pb(comp);
			com.pb(comp2);
		}
	F0R(a, sz(vals))
		dp = (dp << vals[a]) | (dp << com[a]);
	F0R(a, 600001)
		if(dp[a] && abs(SUM - (a + L) - (a + L)) <= k){
			cout << "YES" << endl;
			return 0;
		}
	cout << "NO" << endl;
	// 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
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

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

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Correct 3 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 3 ms 3436 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct
11 Correct 3 ms 3436 KB Output is correct
12 Correct 3 ms 3436 KB Output is correct
13 Correct 3 ms 3436 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 3 ms 3436 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3436 KB Output is correct
20 Correct 3 ms 3436 KB Output is correct
21 Correct 2 ms 3180 KB Output is correct
22 Correct 2 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 3 ms 3436 KB Output is correct
25 Correct 3 ms 3436 KB Output is correct
26 Correct 90 ms 4076 KB Output is correct
27 Correct 17 ms 4076 KB Output is correct
28 Correct 93 ms 4196 KB Output is correct
29 Correct 17 ms 4076 KB Output is correct
30 Correct 91 ms 4076 KB Output is correct
31 Correct 19 ms 4192 KB Output is correct
32 Correct 93 ms 4144 KB Output is correct
33 Correct 17 ms 4096 KB Output is correct
34 Correct 11 ms 4076 KB Output is correct
35 Correct 17 ms 4076 KB Output is correct
36 Correct 91 ms 4076 KB Output is correct
37 Correct 17 ms 4076 KB Output is correct
38 Correct 90 ms 4076 KB Output is correct
39 Correct 17 ms 4076 KB Output is correct
40 Correct 91 ms 4140 KB Output is correct
41 Correct 17 ms 4076 KB Output is correct
42 Correct 91 ms 4076 KB Output is correct
43 Correct 17 ms 4076 KB Output is correct
44 Correct 90 ms 4076 KB Output is correct
45 Correct 17 ms 4108 KB Output is correct
46 Correct 89 ms 4076 KB Output is correct
47 Correct 5 ms 3820 KB Output is correct
48 Correct 50 ms 4076 KB Output is correct
49 Correct 49 ms 4076 KB Output is correct
50 Correct 92 ms 4196 KB Output is correct
51 Correct 94 ms 4076 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 6500 KB Output is correct
2 Correct 16 ms 5996 KB Output is correct
3 Correct 437 ms 6380 KB Output is correct
4 Correct 17 ms 5996 KB Output is correct
5 Correct 451 ms 6500 KB Output is correct
6 Correct 16 ms 5996 KB Output is correct
7 Correct 449 ms 6628 KB Output is correct
8 Correct 16 ms 5996 KB Output is correct
9 Correct 445 ms 6500 KB Output is correct
10 Correct 16 ms 5996 KB Output is correct
11 Correct 450 ms 6500 KB Output is correct
12 Correct 15 ms 5996 KB Output is correct
13 Correct 438 ms 6500 KB Output is correct
14 Correct 443 ms 6628 KB Output is correct
15 Correct 18 ms 5996 KB Output is correct
16 Correct 445 ms 6508 KB Output is correct
17 Correct 16 ms 5996 KB Output is correct
18 Correct 447 ms 6504 KB Output is correct
19 Correct 16 ms 5996 KB Output is correct
20 Correct 447 ms 6500 KB Output is correct
21 Correct 17 ms 5996 KB Output is correct
22 Correct 234 ms 6372 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Correct 3 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 3 ms 3436 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 3 ms 3456 KB Output is correct
11 Correct 3 ms 3436 KB Output is correct
12 Correct 3 ms 3436 KB Output is correct
13 Correct 3 ms 3436 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 3 ms 3436 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3436 KB Output is correct
20 Correct 3 ms 3436 KB Output is correct
21 Correct 2 ms 3180 KB Output is correct
22 Correct 2 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 3 ms 3436 KB Output is correct
25 Correct 3 ms 3436 KB Output is correct
26 Correct 90 ms 4076 KB Output is correct
27 Correct 17 ms 4076 KB Output is correct
28 Correct 93 ms 4196 KB Output is correct
29 Correct 17 ms 4076 KB Output is correct
30 Correct 91 ms 4076 KB Output is correct
31 Correct 19 ms 4192 KB Output is correct
32 Correct 93 ms 4144 KB Output is correct
33 Correct 17 ms 4096 KB Output is correct
34 Correct 11 ms 4076 KB Output is correct
35 Correct 17 ms 4076 KB Output is correct
36 Correct 91 ms 4076 KB Output is correct
37 Correct 17 ms 4076 KB Output is correct
38 Correct 90 ms 4076 KB Output is correct
39 Correct 17 ms 4076 KB Output is correct
40 Correct 91 ms 4140 KB Output is correct
41 Correct 17 ms 4076 KB Output is correct
42 Correct 91 ms 4076 KB Output is correct
43 Correct 17 ms 4076 KB Output is correct
44 Correct 90 ms 4076 KB Output is correct
45 Correct 17 ms 4108 KB Output is correct
46 Correct 89 ms 4076 KB Output is correct
47 Correct 5 ms 3820 KB Output is correct
48 Correct 50 ms 4076 KB Output is correct
49 Correct 49 ms 4076 KB Output is correct
50 Correct 92 ms 4196 KB Output is correct
51 Correct 94 ms 4076 KB Output is correct
52 Correct 447 ms 6500 KB Output is correct
53 Correct 16 ms 5996 KB Output is correct
54 Correct 437 ms 6380 KB Output is correct
55 Correct 17 ms 5996 KB Output is correct
56 Correct 451 ms 6500 KB Output is correct
57 Correct 16 ms 5996 KB Output is correct
58 Correct 449 ms 6628 KB Output is correct
59 Correct 16 ms 5996 KB Output is correct
60 Correct 445 ms 6500 KB Output is correct
61 Correct 16 ms 5996 KB Output is correct
62 Correct 450 ms 6500 KB Output is correct
63 Correct 15 ms 5996 KB Output is correct
64 Correct 438 ms 6500 KB Output is correct
65 Correct 443 ms 6628 KB Output is correct
66 Correct 18 ms 5996 KB Output is correct
67 Correct 445 ms 6508 KB Output is correct
68 Correct 16 ms 5996 KB Output is correct
69 Correct 447 ms 6504 KB Output is correct
70 Correct 16 ms 5996 KB Output is correct
71 Correct 447 ms 6500 KB Output is correct
72 Correct 17 ms 5996 KB Output is correct
73 Correct 234 ms 6372 KB Output is correct
74 Correct 1331 ms 13160 KB Output is correct
75 Correct 116 ms 12772 KB Output is correct
76 Correct 1353 ms 13128 KB Output is correct
77 Correct 116 ms 12772 KB Output is correct
78 Correct 1341 ms 13156 KB Output is correct
79 Correct 1377 ms 13156 KB Output is correct
80 Correct 112 ms 12772 KB Output is correct
81 Correct 118 ms 12772 KB Output is correct
82 Correct 1333 ms 12900 KB Output is correct
83 Correct 1328 ms 13136 KB Output is correct
84 Correct 112 ms 12772 KB Output is correct
85 Correct 1354 ms 13156 KB Output is correct
86 Correct 116 ms 12900 KB Output is correct
87 Correct 1340 ms 13160 KB Output is correct
88 Correct 111 ms 12772 KB Output is correct
89 Correct 1321 ms 13156 KB Output is correct
90 Correct 114 ms 12900 KB Output is correct
91 Correct 1349 ms 13156 KB Output is correct
92 Correct 112 ms 12772 KB Output is correct
93 Correct 1367 ms 13156 KB Output is correct
94 Correct 63 ms 12388 KB Output is correct
95 Correct 744 ms 13096 KB Output is correct
96 Correct 740 ms 13028 KB Output is correct
97 Correct 1345 ms 13028 KB Output is correct
98 Correct 1351 ms 13316 KB Output is correct