oj.uz

답안 #889134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889134 2023-12-19T02:08:12 Z Yang8on Two Currencies (JOI23_currencies) C++14
10 / 100
 5000 ms 31476 KB 
#include <bits/stdc++.h>

#define Yang8on Nguyen_Dinh_Son
#define sonphamay Nguyen_Dinh_Son

#define aothtday "Two Currencies"
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define ll long long
#define endl '\n'
#define pii pair<int, ll>
#define vi vector<int>
#define pb push_back
#define all(v) v.begin(), v.end()
#define f first
#define s second
#define maxn 100005
#define maxm
#define maxx
#define mod 1000000007
#define base 311
#define ModHas 1000000003ll
#define gb(i, j) ((i >> j) & 1)

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll GetRandom(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, m, Q;
int h[maxn], cha[maxn][20];
pair<int, int> edge[maxn];
vector<int> o[maxn];
vector<ll> store[maxn];

void dfs(int u, int par)
{
    for(int v : o[u])
    {
        if(v == par) continue;

        h[v] = h[u] + 1;
        cha[v][0] = u;

        fi(j, 1, 17)
        {
            cha[v][j] = cha[ cha[v][j - 1] ][j - 1];
        }

        dfs(v, u);
    }
}

int lca(int u, int v)
{
    if(h[u] < h[v]) swap(u, v);
    int kc = h[u] - h[v];

    fi(i, 0, 17) if( gb(kc, i) ) u = cha[u][i];

    if(u == v) return u;

    fid(i, 17, 0)
    {
        if(cha[u][i] != cha[v][i])
        {
            u = cha[u][i];
            v = cha[v][i];
        }
    }

    return cha[u][0];
}

void solve()
{
    cin >> n >> m >> Q;
    fi(i, 1, n - 1)
    {
        cin >> edge[i].f >> edge[i].s ;
        int u = edge[i].f, v = edge[i].s;
        o[u].pb(v);
        o[v].pb(u);
    }

    dfs(1, -1);

    fi(i, 1, m)
    {
        int id;
        ll val;
        cin >> id >> val;

        int u = edge[id].f, v = edge[id].s;
        if(h[v] < h[u]) swap(u, v);

        store[v].pb(val);
    }

    fi(i, 1, Q)
    {
        int u, v;
        ll Gold, Silver;
        ll G = Gold, S = Silver;

        cin >> u >> v >> G >> S;

        int par = lca(u, v);
        priority_queue<ll> q;

        while(u != par)
        {
            for(ll x : store[u])
            {
                q.push(-x);
            }

            u = cha[u][0];
        }

        while(v != par)
        {
            for(ll x : store[v])
            {
                q.push(-x);
            }

            v = cha[v][0];
        }

        int notok = 0;
        while(q.size())
        {
            ll val = -q.top();
            q.pop();

            if(S < val)
            {
                if(G == 0)
                {
                    notok = 1;
                    break;
                }
                else G --;
            }
            else S -= val;
        }

        if(notok) cout << -1 << '\n';
        else cout << G << '\n';
    }
}

int main()
{
    if(fopen(aothtday".inp", "r"))
    {
        freopen(aothtday".inp","r",stdin);
        freopen(aothtday".out","w",stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    int nTest = 1;
//    cin >> nTest;

    while(nTest --)
    {
        solve();
    }

    return 0;
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:162:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |         freopen(aothtday".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:163:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  163 |         freopen(aothtday".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp: In function 'void solve()':
currencies.cpp:108:12: warning: 'Gold' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |         ll G = Gold, S = Silver;
      |            ^
currencies.cpp:108:22: warning: 'Silver' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |         ll G = Gold, S = Silver;
      |                      ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 5 ms 6808 KB Output is correct
7 Correct 4 ms 7132 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 5 ms 7004 KB Output is correct
10 Correct 4 ms 6948 KB Output is correct
11 Correct 4 ms 7000 KB Output is correct
12 Correct 4 ms 7004 KB Output is correct
13 Correct 105 ms 7180 KB Output is correct
14 Correct 105 ms 7116 KB Output is correct
15 Correct 43 ms 7056 KB Output is correct
16 Correct 33 ms 7000 KB Output is correct
17 Correct 26 ms 7004 KB Output is correct
18 Correct 44 ms 7000 KB Output is correct
19 Correct 4 ms 7000 KB Output is correct
20 Correct 3 ms 7008 KB Output is correct
21 Correct 3 ms 7004 KB Output is correct
22 Correct 4 ms 6804 KB Output is correct
23 Correct 71 ms 7024 KB Output is correct
24 Correct 66 ms 7264 KB Output is correct
25 Correct 64 ms 7000 KB Output is correct
26 Correct 4 ms 7004 KB Output is correct
27 Correct 4 ms 6768 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct
29 Correct 3 ms 6748 KB Output is correct
30 Correct 6 ms 7004 KB Output is correct
31 Correct 5 ms 6948 KB Output is correct
32 Correct 4 ms 6812 KB Output is correct
33 Correct 98 ms 7004 KB Output is correct
34 Correct 101 ms 7000 KB Output is correct
35 Correct 101 ms 7004 KB Output is correct

Subtask #2
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 4 ms 6748 KB Output is correct
3 Correct 6 ms 7008 KB Output is correct
4 Correct 4 ms 7000 KB Output is correct
5 Correct 146 ms 23968 KB Output is correct
6 Correct 157 ms 22352 KB Output is correct
7 Correct 141 ms 22308 KB Output is correct
8 Correct 150 ms 21604 KB Output is correct
9 Correct 117 ms 21688 KB Output is correct
10 Correct 191 ms 24912 KB Output is correct
11 Correct 171 ms 24916 KB Output is correct
12 Correct 191 ms 24712 KB Output is correct
13 Correct 175 ms 24872 KB Output is correct
14 Correct 185 ms 24932 KB Output is correct
15 Execution timed out 5060 ms 31476 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 98 ms 7096 KB Output is correct
3 Correct 100 ms 7000 KB Output is correct
4 Correct 100 ms 7000 KB Output is correct
5 Execution timed out 5061 ms 29548 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 1 ms 6744 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 5 ms 6808 KB Output is correct
7 Correct 4 ms 7132 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 5 ms 7004 KB Output is correct
10 Correct 4 ms 6948 KB Output is correct
11 Correct 4 ms 7000 KB Output is correct
12 Correct 4 ms 7004 KB Output is correct
13 Correct 105 ms 7180 KB Output is correct
14 Correct 105 ms 7116 KB Output is correct
15 Correct 43 ms 7056 KB Output is correct
16 Correct 33 ms 7000 KB Output is correct
17 Correct 26 ms 7004 KB Output is correct
18 Correct 44 ms 7000 KB Output is correct
19 Correct 4 ms 7000 KB Output is correct
20 Correct 3 ms 7008 KB Output is correct
21 Correct 3 ms 7004 KB Output is correct
22 Correct 4 ms 6804 KB Output is correct
23 Correct 71 ms 7024 KB Output is correct
24 Correct 66 ms 7264 KB Output is correct
25 Correct 64 ms 7000 KB Output is correct
26 Correct 4 ms 7004 KB Output is correct
27 Correct 4 ms 6768 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct
29 Correct 3 ms 6748 KB Output is correct
30 Correct 6 ms 7004 KB Output is correct
31 Correct 5 ms 6948 KB Output is correct
32 Correct 4 ms 6812 KB Output is correct
33 Correct 98 ms 7004 KB Output is correct
34 Correct 101 ms 7000 KB Output is correct
35 Correct 101 ms 7004 KB Output is correct
36 Correct 1 ms 6744 KB Output is correct
37 Correct 4 ms 6748 KB Output is correct
38 Correct 6 ms 7008 KB Output is correct
39 Correct 4 ms 7000 KB Output is correct
40 Correct 146 ms 23968 KB Output is correct
41 Correct 157 ms 22352 KB Output is correct
42 Correct 141 ms 22308 KB Output is correct
43 Correct 150 ms 21604 KB Output is correct
44 Correct 117 ms 21688 KB Output is correct
45 Correct 191 ms 24912 KB Output is correct
46 Correct 171 ms 24916 KB Output is correct
47 Correct 191 ms 24712 KB Output is correct
48 Correct 175 ms 24872 KB Output is correct
49 Correct 185 ms 24932 KB Output is correct
50 Execution timed out 5060 ms 31476 KB Time limit exceeded
51 Halted 0 ms 0 KB -