#923979 (C++23) No.2523 Trick Flower

提出ソース

結果

問題	No.2523 Trick Flower
ユーザー	noya2
提出日時	2023-10-28 02:27:24
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,522 bytes
コンパイル時間	3,696 ms
コンパイル使用メモリ	265,260 KB
実行使用メモリ	12,168 KB
最終ジャッジ日時	2024-09-25 15:58:20
合計ジャッジ時間	5,726 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	71 ms 6,948 KB
testcase_16	AC	70 ms 6,944 KB
testcase_17	WA	-
testcase_18	AC	177 ms 12,168 KB
testcase_19	AC	72 ms 7,096 KB
testcase_20	AC	75 ms 6,972 KB
testcase_21	AC	74 ms 6,964 KB
testcase_22	AC	69 ms 7,092 KB
testcase_23	AC	74 ms 6,964 KB
testcase_24	AC	39 ms 6,944 KB
testcase_25	AC	63 ms 6,940 KB
testcase_26	AC	58 ms 6,940 KB
testcase_27	AC	69 ms 6,940 KB
testcase_28	AC	56 ms 6,940 KB
testcase_29	AC	13 ms 6,940 KB
testcase_30	AC	48 ms 6,940 KB
testcase_31	AC	5 ms 6,944 KB
testcase_32	AC	26 ms 6,940 KB
testcase_33	AC	72 ms 7,056 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n; in(n);
    vector<ll> a(n), b(n); in(a,b);
    vector<int> c(n); in(c);
    vector<int> deg(n,0);
    rep(i,n) deg[--c[i]]++;
    queue<int> que;
    rep(i,n) if (deg[i] == 0) que.push(i);
    vector<int> ids;
    while (!que.empty()){
        int p = que.front(); que.pop();
        ids.emplace_back(p);
        if (--deg[c[p]] == 0){
            que.push(c[p]);
        }
    }
    vector<vector<int>> loops;
    rep(i,n){
        if (deg[i] != 1) continue;
        vector<int> loop;
        int cur = i;
        while (deg[cur] == 1){
            loop.emplace_back(cur);
            deg[cur] = 0;
            cur = c[cur];
        }
        loops.emplace_back(loop);
    }
    using bll = __int128_t;
    bll le = 0, ri = 1e15;
    while (ri  - le > 1){
        bll md = (le + ri) / 2;
        auto cur = a;
        for (int i : ids){
            if (b[i] * md > cur[i]) cur[c[i]] -= b[i]*md - cur[i];
        }
        bool ok = true;
        for (auto loop : loops){
            bll sum = 0;
            for (int i : loop){
                sum += cur[i] - b[i] * md;
            }
            if (sum < 0) ok = false;
        }
        if (ok) le = md;
        else ri = md;
    }
    out((ll)(le));
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード