Submission #625873

#TimeUsernameProblemLanguageResultExecution timeMemory
625873xynexCatfish Farm (IOI22_fish)C++17
100 / 100
145 ms18288 KiB
/** * Author: Tenjin * Created: 11.08.2022 05:09 * Why am I so stupid? :c * Slishkom slab **/ #include <bits/stdc++.h> #include "fish.h" // #pragma GCC optimize("inline") // #pragma GCC optimize("-fgcse,-fgcse-lm") // #pragma GCC optimize("-ftree-pre,-ftree-vrp") // #pragma GCC optimize("-ffast-math") // #pragma GCC optimize("-fipa-sra") // #pragma GCC optimize("-fpeephole2") // #pragma GCC optimize("-fsched-spec") // #pragma GCC optimize("Ofast,no-stack-protector") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") // #pragma GCC optimize("unroll-loops") using namespace std; #define ll long long #define dl double long #define ull unsigned long long #define pr pair #define vt vector #define ff first #define ss second #define mp make_pair #define sz(a) (int)a.size() #define pb push_back #define pf push_front #define popB pop_back #define popF pop_front #define bit_count __builtin_popcount #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sp(x) fixed << setprecision(x) template<typename T> T get_rand(T l, T r) { random_device rd; mt19937 gen(rd()); return uniform_int_distribution<T>(l, r)(gen); } template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); } template<class A> void read(vt<A>& v); template<class A, size_t S> void read(array<A, S>& a); template<class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { string t; read(t); d = stold(t); } template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); } template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); } template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); } string to_string(char c) { return string(1, c); } string to_string(bool b) { return b ? "true" : "false"; } string to_string(const char* s) { return string(s); } string to_string(string s) { return s; } string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; } template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; } template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; } template<class A> void write(A x) { cout << to_string(x); } template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); } void print() { write("\n"); } template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); } void freop(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } const int MOD = 1e9 + 7; const int N = 3e6 + 5; const ll INF = 1e18; const int M = 3e3 + 5; const dl pi = acos(-1); const dl eps = 1e-12; const int sq = 700; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; /* ll vs int*/ ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) { vt<vt<pr<int, ll> >> fishes(n); for(int i = 0; i < m; ++i) { fishes[x[i]].pb({y[i], w[i]}); } vt<ll> pref(n, -INF); vt<ll> last1, last2; for(int x = 0; x < n; ++x) { sort(all(fishes[x])); vt<ll> cur1(sz(fishes[x]), -INF); ll mx1 = -INF, lastmx1 = -INF; if(x > 0) { int pos = sz(fishes[x - 1]) - 1; for(int i = sz(fishes[x]) - 1; i >= 0; --i) { int Y = fishes[x][i].ff; ll W = fishes[x][i].ss; cur1[i] = max(0ll, mx1) + W; if(x > 1) { cur1[i] = max(cur1[i], pref[x - 2] + W); } while(pos >= 0) { if(fishes[x - 1][pos].ff <= Y) break; lastmx1 = max(lastmx1, last1[pos]); pos--; } cur1[i] = max(cur1[i], lastmx1 + W); mx1 = max(mx1, cur1[i]); } } if(!last1.empty()) lastmx1 = *max_element(all(last1)); swap(last1, cur1); vt<ll> cur2(sz(fishes[x]), -INF); ll mx2 = -INF, lastmx2 = -INF; if(x < n - 1) { int pos = 0; for(int i = 0; i < sz(fishes[x]); ++i) { int Y = fishes[x][i].ff; ll W = fishes[x][i].ss; cur2[i] = max(0ll, mx2) + W; cur2[i] = max(cur2[i], lastmx1 + W); if(x > 1) { cur2[i] = max(cur2[i], pref[x - 2] + W); } if(x) { while(pos < sz(fishes[x - 1])) { if(fishes[x - 1][pos].ff >= Y) break; lastmx2 = max(lastmx2, last2[pos]); pos++; } } cur2[i] = max(cur2[i], lastmx2 + W); mx2 = max(mx2, cur2[i]); } } swap(last2, cur2); if(x) pref[x] = max({pref[x - 1], mx1, mx2}); else pref[x] = max({mx1, mx2}); } return pref[n - 1]; }

Compilation message (stderr)

fish.cpp: In function 'void freop(std::string)':
fish.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...