Submission #915583

#	Time	Username	Problem	Language	Result	Execution time	Memory
915583		xynex	Closing Time (IOI23_closing)	C++17	8 / 100	139 ms	32404 KiB

closing

/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.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 ll INF = 1e14;
const int M = 2e5 + 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*/

vt<pr<int, int>> g[M];
ll distX[M], distY[M];
void dfsX(int v, int p = -1, ll cnt = 0) {
  distX[v] = cnt;
  for(auto to : g[v]) {
    if(to.ff == p) continue;
    dfsX(to.ff, v, cnt + to.ss);
  }
}
void dfsY(int v, int p = -1, ll cnt = 0) {
  distY[v] = cnt;
  for(auto to : g[v]) {
    if(to.ff == p) continue;
    dfsY(to.ff, v, cnt + to.ss);
  }
}

int max_score(int N, int X, int Y, ll K, vt<int> U, vt<int> V, vt<int> W) {
  for(int i = 0; i < N; ++i) {
    g[i].clear();
    distX[i] = distY[i] = 0;
  }
  for(int i = 0; i < N - 1; ++i) {
    g[U[i]].pb({V[i], W[i]});
    g[V[i]].pb({U[i], W[i]});
  }
  dfsX(X);
  dfsY(Y);
  int ans = 0;
  vt<ll> ord;
  for(int i = 0; i < N; ++i) {
    ord.pb(distX[i]); ord.pb(distY[i]);
  }
  sort(all(ord));
  ll sum = 0;
  for(int i = 0; i < sz(ord); ++i) {
    sum += ord[i];
    if(sum <= K) ans = i + 1;
  }
  ord.clear();
  sum = 0;
  int cnt = 0;
  vt<pr<ll, ll>> in;
  for(int i = 0; i < N; ++i) {
    ll mn = min(distX[i], distY[i]), mx = max(distX[i], distY[i]);
    if(distX[i] + distY[i] == distX[Y]) {
      cnt++;
      sum += mn;
      ord.pb(mx - mn);
    }
    else if(mn <= (mx - mn)) {
      ord.pb(mn);
      ord.pb(mx - mn);
    }
    else {
      in.pb({mx, mn});
    }
  }
  sort(all(ord));
  sort(all(in));
  for(int i = 1; i < sz(ord); ++i) ord[i] += ord[i - 1];
  vt<ll> pref(sz(in)), suf(sz(in));
  for(int i = 0; i < sz(in); ++i) {
    pref[i] = in[i].ff - in[i].ss;
    if(i) pref[i] = max(pref[i], pref[i - 1]);
  }
  for(int i = sz(in) - 1; i >= 0; --i) {
    suf[i] = in[i].ss;
    if(i < sz(in) - 1) suf[i] = min(suf[i], suf[i + 1]);
  }
  for(int i = 0; i <= sz(in); ++i) {
    if(i) sum += in[i - 1].ff;
    ans = max(ans, cnt + i * 2 + (int)(K - sum < 0 ? -MOD : upper_bound(all(ord), K - sum) - ord.begin()));
    if(i) ans = max(ans, cnt + i * 2 + (int)(K - sum + pref[i - 1] < 0 ? -MOD : upper_bound(all(ord), K - sum + pref[i - 1]) - ord.begin()));
    if(i < sz(in)) ans = max(ans, cnt + i * 2 + (int)(K - sum - suf[i] < 0 ? -MOD : upper_bound(all(ord), K - sum - suf[i]) - ord.begin()));
  }
  return ans;
}

/*
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //freop("");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}*/

Compilation message (stderr)

closing.cpp: In function 'void freop(std::string)':
closing.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
closing.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17