oj.uz

답안 #907940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
907940 2024-01-16T06:24:44 Z xynex 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 134 ms 26904 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 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;
  }
  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(i == X || i == Y) continue;
    if(distX[i] + distY[i] == distX[Y]) {
      //write(i, ' ');
    }
  }
  set<pr<ll, int> > F = {{0, X}}, S = {{0, Y}};
  set<int> usd = {}, usd1 = {};
  int ans = 0;
  for(int i = 1; i <= 7; ++i) {
    while(!F.empty() && usd.count((*F.begin()).ss)) F.erase(F.begin());
    while(!S.empty() && usd1.count((*S.begin()).ss)) S.erase(S.begin());
    if(F.empty()) {
      auto cur1 = *S.begin();
      if(cur1.ff > K) break;
      K -= cur1.ff;
      t[cur1.ss] += cur1.ff;
      usd1.insert(cur1.ss);
      ans++;
      for(auto to : g[cur1.ss]) {
        if(!usd1.count(to.ff)) {
          S.insert({distY[to.ff] - t[to.ff], to.ff});
        }
      }
      continue;
    }
    if(S.empty()) {
      auto cur = *F.begin();
      if(cur.ff > K) break;
      K -= cur.ff;
      t[cur.ss] += cur.ff;
      usd.insert(cur.ss);
      ans++;
      for(auto to : g[cur.ss]) {
        if(!usd.count(to.ff)) {
          F.insert({distX[to.ff] - t[to.ff], to.ff});
        }
      }
      continue;
    }
    auto cur = *F.begin(), cur1 = *S.begin();
    //print(cur.ff, cur.ss, cur1.ff, cur1.ss);
    if(cur.ff > cur1.ff) {
      //print("S", cur1.ss);
      S.erase(S.begin());
      auto fn = F.lower_bound({distX[cur1.ss], cur1.ss});
      if(fn != F.end() && (*fn).ss == cur1.ss) {
        F.erase(fn);
        F.insert({(*fn).ff - cur1.ff, cur1.ss});
      }
      if(cur1.ff > K) break;
      K -= cur1.ff;
      t[cur1.ss] += cur1.ff;
      usd1.insert(cur1.ss);
      ans++;
      for(auto to : g[cur1.ss]) {
        if(!usd1.count(to.ff)) {
          S.insert({distY[to.ff] - t[to.ff], to.ff});
        }
      }
    }
    else if(cur.ff < cur1.ff) {
     // print("F", cur.ss);
      F.erase(F.begin());
      auto fn = S.lower_bound({distY[cur.ss], cur.ss});
      if(fn != S.end() && (*fn).ss == cur.ss) {
        S.erase(fn);
        S.insert({(*fn).ff - cur.ff, cur.ss});
      }
      if(cur.ff > K) break;
      K -= cur.ff;
      t[cur.ss] += cur.ff;
      usd.insert(cur.ss);
      ans++;
      for(auto to : g[cur.ss]) {
        if(!usd.count(to.ff)) {
          F.insert({distX[to.ff] - t[to.ff], to.ff});
        }
      }
    }
    else if(cur.ff == cur1.ff) {
      if(distX[cur.ff] + distY[cur.ff] == distX[Y]) {
       // print("F1", cur.ss);
        F.erase(F.begin());
        auto fn = S.lower_bound({distY[cur.ss], cur.ss});
        if(fn != S.end() && (*fn).ss == cur.ss) {
          S.erase(fn);
          S.insert({(*fn).ff - cur.ff, cur.ss});
        }
        if(cur.ff > K) break;
        K -= cur.ff;
        t[cur.ss] += cur.ff;
        usd.insert(cur.ss);
        ans++;
        for(auto to : g[cur.ss]) {
          if(!usd.count(to.ff)) {
            F.insert({distX[to.ff] - t[to.ff], to.ff});
          }
        }
      }
      else {
       // print("S1", cur1.ss);
        S.erase(S.begin());
        auto fn = F.lower_bound({distX[cur1.ss], cur1.ss});
        if(fn != F.end() && (*fn).ss == cur1.ss) {
          F.erase(fn);
          F.insert({(*fn).ff - cur1.ff, cur1.ss});
        }
        if(cur1.ff > K) break;
        K -= cur1.ff;
        t[cur1.ss] += cur1.ff;
        usd1.insert(cur1.ss);
        ans++;
        for(auto to : g[cur1.ss]) {
          if(!usd1.count(to.ff)) {
            S.insert({distY[to.ff] - t[to.ff], to.ff});
          }
        }
      }
    }
  }
  //print("");
  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

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 Correct 3 ms 8888 KB Output is correct

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 26904 KB 1st lines differ - on the 1st token, expected: '451', found: '7'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8888 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8888 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
4 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8888 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8888 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
4 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8888 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Incorrect 3 ms 8796 KB 1st lines differ - on the 1st token, expected: '30', found: '7'
4 Halted 0 ms 0 KB -