oj.uz

답안 #915552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915552 2024-01-24T06:58:52 Z xynex 봉쇄 시간 (IOI23_closing) C++17
17 / 100
 108 ms 30056 KB 
/**
  * 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 t[M];
int ok[M];
void dfs1(int v, int p = -1) {
  ok[v] = 1;
  for(auto to : g[v]) {
    if(to.ff == p || ok[to.ff]) continue;
    dfs1(to.ff, v);
  }
}
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;
    t[i] = 0;
    ok[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);
  for(int i = 0; i < N; ++i) {
    if(distX[i] + distY[i] == distX[Y]) {
      ok[i] = 1;
      //write(i, ' ');
    }
  }
  for(int i = 0; i < N; ++i) {
    if(i == X || i == Y || !ok[i]) continue;
    dfs1(i);
  }
  vt<pr<ll, int> > ord;
  vt<ll> ord1;
  for(int i = 0; i < N; ++i) {
    if(!ok[i]) {
      if(distX[i] > distY[i]) {
        ord.pb({distY[i], 1});
      }
      else {
        ord.pb({distX[i], 0});
      }
    }
  }
  //for(auto cur : ord) print(cur.ff, cur.ss);
  if(!ord.empty()) {
    sort(all(ord));
    ord1.resize(sz(ord));
    ord1[0] = ord[0].ff;
    for(int i = 1; i < sz(ord); ++i) {
      ord1[i] = ord1[i - 1] + ord[i].ff;
    }
   // print(ord1);
  }
  set<pr<pr<ll, ll>, int> > F = {{{0, MOD}, X}}, S = {{{0, MOD}, Y}};
  vt<int> usd(N), usd1(N);
  bool Num1 = 0, Num2 = 0;
  int ans = 0, res = 0;
  while(!F.empty() || !S.empty()) {
   /* while(!F.empty() && usd[(*F.begin()).ss] == 2) F.erase(F.begin());
    while(!S.empty() && usd1[(*S.begin()).ss] == 2) S.erase(S.begin());*/
    ll lastK = K;
    if(F.empty()) {
      auto cur1 = *S.begin();
      S.erase(S.begin());
      if(cur1.ff.ff <= K) {
      K -= cur1.ff.ff;
      t[cur1.ss] += cur1.ff.ff;
      usd1[cur1.ss] = 2;
      if(cur1.ss == X) Num2 = 1;
      ans++;
      for(auto to : g[cur1.ss]) {
        if(!usd1[to.ff]) {
          if(!ok[to.ff]) continue;
          usd1[to.ff] = 1;
          if(usd[to.ff] == 1) {
            auto fn = F.lower_bound({{distX[to.ff], MOD}, to.ff});
            if(fn != F.end() && (*fn).ss == to.ff) {
              F.erase(fn);
              F.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
            }
            S.insert({{distY[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
          }
          else {
            S.insert({{distY[to.ff] - t[to.ff], MOD}, to.ff});
          }
        }
      }
    }
    }
    else if(S.empty()) {
      auto cur = *F.begin();
      F.erase(F.begin());
      if(cur.ff.ff <= K) {
      K -= cur.ff.ff;
      t[cur.ss] += cur.ff.ff;
      usd[cur.ss] = 2;
      if(cur.ss == Y) Num1 = 1;
      ans++;
      for(auto to : g[cur.ss]) {
        if(!usd[to.ff]) {
          if(!ok[to.ff]) continue;
          usd[to.ff] = 1;
          if(usd1[to.ff] == 1) {
              auto fn = S.lower_bound({{distY[to.ff], MOD}, to.ff});
              if(fn != S.end() && (*fn).ss == to.ff) {
                  S.erase(fn);
                  S.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
              }
              F.insert({{distX[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
          }
          else {
              F.insert({{distX[to.ff] - t[to.ff], MOD}, to.ff});
          }
        }
      }
    }
    }
    else {
    auto cur = *F.begin(), cur1 = *S.begin();
  /*  print("F", cur.ff.ff, cur.ff.ss, cur.ss, "S", cur1.ff.ff, cur1.ff.ss, cur1.ss, "K", K);
    for(auto curr : F) print(curr.ff.ff, curr.ff.ss, curr.ss);
    print("===");
    for(auto curr : S) print(curr.ff.ff, curr.ff.ss, curr.ss);*/
    if(cur.ff.ff > cur1.ff.ff) {
      //print("S", cur1.ss);
      S.erase(S.begin());
      if(usd[cur1.ss] == 1) {
        auto fn = F.lower_bound({{distX[cur1.ss], abs(distX[cur1.ss] - distY[cur1.ss])}, cur1.ss});
        if(fn != F.end() && (*fn).ss == cur1.ss) {
          F.erase(fn);
          F.insert({{(*fn).ff.ff - cur1.ff.ff, MOD}, cur1.ss});
        }
      }
      if(cur1.ff.ff <= K) {
      K -= cur1.ff.ff;
      t[cur1.ss] += cur1.ff.ff;
      usd1[cur1.ss] = 2;
      if(cur1.ss == X) Num2 = 1;
      ans++;
      for(auto to : g[cur1.ss]) {
        if(!usd1[to.ff]) {
          if(!ok[to.ff]) continue;
          usd1[to.ff] = 1;
          if(usd[to.ff] == 1) {
            auto fn = F.lower_bound({{distX[to.ff], MOD}, to.ff});
            if(fn != F.end() && (*fn).ss == to.ff) {
              F.erase(fn);
              F.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
            }
            S.insert({{distY[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
          }
          else {
            S.insert({{distY[to.ff] - t[to.ff], MOD}, to.ff});
          }
        }
      }
    }
    }
    else if(cur.ff.ff < cur1.ff.ff) {
      //print("XXXXXXXXXXXXx");
     // print("F", cur.ss);
      F.erase(F.begin());
      if(usd1[cur.ss] == 1) {
        auto fn = S.lower_bound({{distY[cur.ss], abs(distX[cur.ss] - distY[cur.ss])}, cur.ss});
        if(fn != S.end() && (*fn).ss == cur.ss) {
          S.erase(fn);
          S.insert({{(*fn).ff.ff - cur.ff.ff, MOD}, cur.ss});
        }
      }
      if(cur.ff.ff <= K) {
      K -= cur.ff.ff;
      t[cur.ss] += cur.ff.ff;
      usd[cur.ss] = 2;
      if(cur.ss == Y) Num1 = 1;
      ans++;
      for(auto to : g[cur.ss]) {
        if(!usd[to.ff]) {
          if(!ok[to.ff]) continue;
          usd[to.ff] = 1;
          if(usd1[to.ff] == 1) {
              auto fn = S.lower_bound({{distY[to.ff], MOD}, to.ff});
              if(fn != S.end() && (*fn).ss == to.ff) {
                  S.erase(fn);
                  S.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
              }
              F.insert({{distX[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
          }
          else {
              F.insert({{distX[to.ff] - t[to.ff], MOD}, to.ff});
          }
        }
      }
    }
    }
    else if(cur.ff.ff == cur1.ff.ff) {
      if(cur.ff.ss > cur1.ff.ss) {
      //  print("F1", cur.ss);
        S.erase(S.begin());
        if(usd[cur1.ss] == 1) {
          auto fn = F.lower_bound({{distX[cur1.ss], abs(distX[cur1.ss] - distY[cur1.ss])}, cur1.ss});
          if(fn != F.end() && (*fn).ss == cur1.ss) {
            F.erase(fn);
            F.insert({{(*fn).ff.ff - cur1.ff.ff, MOD}, cur1.ss});
          }
        }
        if(cur1.ff.ff <= K) {
        K -= cur1.ff.ff;
        t[cur1.ss] += cur1.ff.ff;
        usd1[cur1.ss] = 2;
        if(cur1.ss == X) Num2 = 1;
        ans++;
        for(auto to : g[cur1.ss]) {
          if(!usd1[to.ff]) {
          if(!ok[to.ff]) continue;
            usd1[to.ff] = 1;
            if(usd[to.ff] == 1) {
              auto fn = F.lower_bound({{distX[to.ff], MOD}, to.ff});
              if(fn != F.end() && (*fn).ss == to.ff) {
                F.erase(fn);
                F.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
              }
              S.insert({{distY[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
            }
            else {
              S.insert({{distY[to.ff] - t[to.ff], MOD}, to.ff});
            }
          }
        }
      }
      }
      else {
       // print("S1", cur1.ss);
        F.erase(F.begin());
        if(usd1[cur.ss] == 1) {
          auto fn = S.lower_bound({{distY[cur.ss], abs(distX[cur.ss] - distY[cur.ss])}, cur.ss});
          if(fn != S.end() && (*fn).ss == cur.ss) {
            S.erase(fn);
            S.insert({{(*fn).ff.ff - cur.ff.ff, MOD}, cur.ss});
          }
        }
        if(cur.ff.ff <= K){
        K -= cur.ff.ff;
        t[cur.ss] += cur.ff.ff;
        usd[cur.ss] = 2;
        if(cur.ss == Y) Num1 = 1;
        ans++;
        for(auto to : g[cur.ss]) {
          if(!usd[to.ff]) {
            if(!ok[to.ff]) continue;
            usd[to.ff] = 1;
            if(usd1[to.ff]) {
                auto fn = S.lower_bound({{distY[to.ff], MOD}, to.ff});
                if(fn != S.end() && (*fn).ss == to.ff) {
                    S.erase(fn);
                    S.insert({{(*fn).ff.ff, abs(distX[to.ff] - distY[to.ff])}, to.ff});
                }
                F.insert({{distX[to.ff], abs(distX[to.ff] - distY[to.ff])}, to.ff});
            }
            else {
                F.insert({{distX[to.ff] - t[to.ff], MOD}, to.ff});
            }
          }
        }
      }
      }
    }
    }
    lastK -= K;
    //print(K);
    res = max(res, ans);
    int FF = 0, SS = 0;
    for(int i = 0; i < sz(ord); ++i) {
      if(K < ord1[i]) break;
      if(ord[i].ss == 1) FF++;
      else SS++;
      //print(i + 1 + ans, (K - ord1[i]) / distX[Y]);
      int XX = i + 1 + ans;
      int YY = 0;
      if(Num1) YY += FF;
      if(Num2) YY += SS;
//      print(XX, YY, i + 1);
      res = max(res, XX + min(YY, (int)(K - ord1[i]) / (int)distX[Y]));
    }
    //print(res);
  }
  //print("");
  return res;
}

/*
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

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 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 28080 KB Output is correct
2 Correct 108 ms 30056 KB Output is correct
3 Correct 60 ms 13908 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9560 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 2 ms 9564 KB Output is correct
8 Correct 2 ms 9680 KB Output is correct
9 Correct 3 ms 9560 KB Output is correct
10 Correct 2 ms 9760 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9560 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 2 ms 9564 KB Output is correct
8 Correct 2 ms 9680 KB Output is correct
9 Correct 3 ms 9560 KB Output is correct
10 Correct 2 ms 9760 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct
12 Correct 2 ms 9560 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9564 KB Output is correct
15 Correct 3 ms 9564 KB Output is correct
16 Correct 2 ms 9692 KB Output is correct
17 Correct 2 ms 9564 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 3 ms 9564 KB Output is correct
20 Correct 3 ms 9564 KB Output is correct
21 Incorrect 3 ms 9564 KB 1st lines differ - on the 1st token, expected: '884', found: '799'
22 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9560 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 9564 KB Output is correct
5 Correct 2 ms 9564 KB Output is correct
6 Correct 2 ms 9564 KB Output is correct
7 Correct 2 ms 9564 KB Output is correct
8 Correct 2 ms 9680 KB Output is correct
9 Correct 3 ms 9560 KB Output is correct
10 Correct 2 ms 9760 KB Output is correct
11 Correct 2 ms 9564 KB Output is correct
12 Correct 2 ms 9560 KB Output is correct
13 Correct 2 ms 9816 KB Output is correct
14 Correct 2 ms 9564 KB Output is correct
15 Correct 3 ms 9564 KB Output is correct
16 Correct 2 ms 9692 KB Output is correct
17 Correct 2 ms 9564 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 3 ms 9564 KB Output is correct
20 Correct 3 ms 9564 KB Output is correct
21 Incorrect 3 ms 9564 KB 1st lines differ - on the 1st token, expected: '884', found: '799'
22 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9564 KB 2nd lines differ - on the 1st token, expected: '3', found: '5'
2 Halted 0 ms 0 KB -