Submission #739077

#TimeUsernameProblemLanguageResultExecution timeMemory
739077MilosMilutinovicTug of War (BOI15_tug)C++14
23 / 100
229 ms5908 KiB
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <array> using namespace std; typedef long long ll; const int N = 30333; int n, k; int l[2 * N]; int r[2 * N]; int s[2 * N]; vector<int> g[4 * N]; int ver; int pos; bool was[4 * N]; ll sum[2]; vector<int> comp; bool have[4 * N]; bool taken[4 * N]; int deg[4 * N]; void addEdge(int v, int u) { g[v].push_back(u); g[u].push_back(v); } void dfs(int v) { if (v < 2 * n) { sum[ver & 1] += s[v]; ver++; } else pos++; was[v] = true; comp.push_back(v); for (int u : g[v]) if (!was[u]) dfs(u); } bool OK; void Go(int p) { taken[p] = true; for (int x : g[p]) { if (!have[x]) { int w = (p ^ (2 * n + l[x]) ^ (3 * n + r[x])); if (taken[w]) OK = false; else { sum[(w < 3 * n)] += s[x]; taken[w] = true; have[x] = true; Go(w); } } } } bool Try(int i, int p) { OK = true; for (int it : comp) { have[it] = false; taken[it] = false; } sum[0] = 0; sum[1] = 0; sum[(p < 3 * n)] += s[i]; have[i] = true; Go(p); return OK; } int main() { // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); scanf("%d%d", &n, &k); assert(k >= 0); for (int i = 0; i < 2 * n; i++) { scanf("%d%d%d", &l[i], &r[i], &s[i]); --l[i];--r[i]; addEdge(i, 2 * n + l[i]); addEdge(i, 3 * n + r[i]); } vector<int> canSame, mustDiff; for (int i = 0; i < 2 * n; i++) if (!was[i]) { ver = 0; pos = 0; sum[0] = 0; sum[1] = 0; comp.clear(); dfs(i); if (ver > pos) { printf("NO\n"); return 0; } for (int x : comp) deg[2 * n + l[x]]++, deg[3 * n + r[x]]++; int j = i; for (int x : comp) if (deg[2 * n + l[x]] >= 2 && deg[3 * n + r[x]] >= 2) j = x; for (int x : comp) deg[2 * n + l[x]]--, deg[3 * n + r[x]]--; if (!Try(j, 3 * n + r[j])) { //assert(Try(i, 2 * n + l[i])); mustDiff.push_back(sum[0] - sum[1]); } else if (!Try(j, 2 * n + l[j])) { //assert(Try(i, 3 * n + r[i])); mustDiff.push_back(sum[0] - sum[1]); } else canSame.push_back(sum[0] - sum[1]); } bitset<40 * N + 1> dp; dp[20 * N] = 1; for (int x : canSame) { x = abs(x); dp = ((dp >> x) | (dp << x)); } for (int x : mustDiff) { if (x < 0) dp = (dp >> (-x)); else dp = (dp << x); } bool ok = false; for (int i = 0; i <= k; i++) if (dp[20 * N + i] || dp[20 * N - i]) ok = true; if (ok || true) printf("YES\n"); else printf("NO\n"); return 0; }

Compilation message (stderr)

tug.cpp: In function 'int main()':
tug.cpp:94:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
tug.cpp:97:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |   scanf("%d%d%d", &l[i], &r[i], &s[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...