제출 #202744

#제출 시각아이디문제언어결과실행 시간메모리
202744galen_colin친구 (IOI14_friend)C++14
35 / 100
6 ms632 KiB
#include <bits/stdc++.h> #include <chrono> using namespace std; using namespace std::chrono; // #pragma GCC target ("avx2") // #pragma GCC optimization ("O3") // #pragma GCC optimization ("unroll-loops") // #pragma optimization_level 3 // #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define f0r(a, b) for (long long a = 0; a < (b); a++) #define f1r(a, b, c) for (long long a = (b); a < (c); a++) #define f0rd(a, b) for (long long a = (b); a >= 0; a--) #define f1rd(a, b, c) for (long long a = (b); a >= (c); a--) #define ms(arr, v) memset(arr, v, sizeof(arr)) #define pb push_back #define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);} #define mp make_pair #define f first #define s second #define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];} #define all(v) v.begin(), v.end() #define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());} #define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);} #define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele]; #define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele]; #define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';} #define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';} typedef long long ll; typedef double ld; typedef long double lld; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<pii> vpi; typedef vector<pll> vpl; template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v); template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; } template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) { cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]"; } template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; } // template<typename A, typename B> ll max(A x, B y) { // return x > y ? x : y; // } // template<typename A, typename B> ll min(A x, B y) { // return x < y ? x : y; // } mt19937 rng(steady_clock::now().time_since_epoch().count()); /* usage - just do rng() */ void usaco(string filename) { // #pragma message("be careful, freopen may be wrong") freopen((filename + ".in").c_str(), "r", stdin); freopen((filename + ".out").c_str(), "w", stdout); } const lld pi = 3.14159265358979323846; const ll mod = 1000000007; // const ll mod = 998244353; // namespace interactor { // } // using namespace interactor; // int findSample(int n, int conf[], int host[], int protocol[]); // int main() { // int conf[4] = {1, 3, 2, 4}; // int host[4] = {0, 0, 0, 1}; // int prot[4] = {0, 0, 1, 0}; // cout << findSample(4, conf, host, prot) << endl; // } #include "friend.h" ll n, m, k, q, Q, T, l, r, x, y, z; ll a[1000005]; ll b[1000005]; ll c[1000005]; string s, t; ll ans = 0; vi edges[1005]; ll dp[1005][2]; int col[1005]; bool vis[1005]; pii count(int x) { if (vis[x]) return mp(0, 0); vis[x] = 1; pii r = mp(1, col[x] == 1); for (int y: edges[x]) { if (!vis[y]) { pii z = count(y); r.f += z.f; r.s += z.s; } } return r; } void dfs_col(int x) { if (vis[x]) return; vis[x] = 1; bool ok[2] = {1}; for (int y: edges[x]) { dfs_col(y); ok[col[y] - 1] = 0; } if (ok[0]) col[x] = 1; else col[x] = 2; } void dfs(int x, int p) { ll s1 = 0, s2 = 0; for (int y: edges[x]) { if (y != p) { dfs(y, x); s1 += dp[y][0]; s2 += max(dp[y][0], dp[y][1]); } } dp[x][0] = max(s1, s2); dp[x][1] = a[x] + s1; } void addfriend(int a, int b) { edges[a].pb(b); edges[b].pb(a); } void iam(int h, int b) { addfriend(b, h); } void myfriends(int h, int b) { for (int x: edges[h]) { addfriend(b, x); } } void weare(int h, int b) { myfriends(h, b); iam(h, b); } int findSample(int n, int conf[], int host[], int prot[]) { if (n <= 1) { f1r(i, 1, n) { if (prot[i] == 0) iam(host[i], i); else if (prot[i] == 1) myfriends(host[i], i); else weare(host[i], i); } ll ans = 0; bool on[10] = {0}; f0r(i, (1 << n)) { bool f = 1; ll r = 0; f0r(j, n) if (i & (1 << j)) on[j] = 1; f0r(j, n) if (i & (1 << j)) for (int x: edges[j]) if (on[x]) f = 0; if (f) f0r(j, n) if (i & (1 << j)) r += conf[j]; ans = max(ans, r); ms(on, 0); } return ans; } else { int v = prot[1]; f1r(i, 2, n) if (prot[i] != v) v = -1; if (v == 0) { f0r(i, n) a[i] = conf[i]; f1r(i, 1, n) { edges[host[i]].pb(i); } dfs(0, -1); return max(dp[0][0], dp[0][1]); } else if (v == 1) { ll s = 0; f0r(i, n) s += conf[i]; return s; } else if (v == 2) { int mx = 0; f0r(i, n) mx = max(mx, conf[i]); return mx; } else { f1r(i, 1, n) { if (prot[i] == 0) iam(host[i], i); else if (prot[i] == 1) myfriends(host[i], i); else weare(host[i], i); } ms(col, 0); ms(vis, 0); dfs_col(0); ll ans = 0; ms(vis, 0); f0r(i, n) if (!vis[i]) { pii r = count(i); ans += max(r.s, r.f - r.s); } return ans; } } } // int main() { // io; // // freopen("case", "r", stdin); // // freopen("test.txt", "r", stdin); // // freopen("case", "w", stdout); // // freopen("file.in", "r", stdin); // // usaco("file"); // }

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'void usaco(std::__cxx11::string)':
friend.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
friend.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...