oj.uz

답안 #833941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833941 2023-08-22T09:39:44 Z josanneo22 Two Currencies (JOI23_currencies) C++17
28 / 100
 189 ms 42940 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define ar array
const int N=1e5+500,K=25;
int cnt = 0, cur = 0, tin[N], tout[N], sp[N][K];
vector<pair<int,int>> g[N];
int dep[N], w[N];
void dfs(int u, int p){
    tin[u] = cur++;
    sp[u][0] = p;
    for(int i = 1; i < K; i++)
        sp[u][i] = sp[sp[u][i-1]][i-1];
    for(auto x : g[u]){
        if(x.fi == p) continue;
        dep[x.fi] = dep[u]+w[x.se];
        dfs(x.fi,u);
    }
    tout[u] = cur++;
}
bool is_anc(int u, int v){
    return (tin[u] <= tin[v] && tout[v] <= tout[u]);
}
int lca(int u, int v){
    if(is_anc(u,v)) return u;
    if(is_anc(v,u)) return v;
    for(int i = K-1; i >= 0; i--)
        if(!is_anc(sp[u][i], v)) u = sp[u][i];
    return sp[u][0];
}
void solve(){
    int n,m,q; cin >> n >> m >> q;
    for (int i = 0; i < n-1; ++i)
    {
        int a,b; cin >> a >> b;
        a--,b--;
        g[a].pb(mp(b,i));
        g[b].pb(mp(a,i));
    }
    for (int i = 0; i < m; ++i)
    {
        int p, c;
        cin >> p >> c;
        p--;
        cnt = c;
        w[p] += c;
    }
    dfs(0,0);
    while(q--){
        int s,t,au_have,ag;
        cin >> s >> t >> au_have >> ag;
        s--,t--;
        int l = lca(s,t);
        int sm = dep[s]+dep[t]-2*dep[l];
        int au = sm/cnt - ag/cnt;
        if(au <= 0) cout << au_have <<'\n';
        else if(au <= au_have) cout << au_have-au << '\n';
        else cout << -1 << '\n'; 
    }
}
signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	clock_t tStart = clock();
	int local=0,multi=0,debug=1,tt=1;
	if(local){
	    freopen("input.txt","r",stdin);
	    freopen("output.txt","w",stdout);
	}	
	if(multi) cin>>tt;
	for(int i=1;i<=tt;i++){
		if(debug && multi && local) cout<<"样例 "<<i<<'\n';
		solve();
 	}
	fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:74:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |      freopen("input.txt","r",stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:75:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |      freopen("output.txt","w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 3284 KB Output is correct
3 Correct 3 ms 3348 KB Output is correct
4 Correct 3 ms 3284 KB Output is correct
5 Correct 119 ms 35092 KB Output is correct
6 Correct 115 ms 26424 KB Output is correct
7 Correct 117 ms 30476 KB Output is correct
8 Correct 118 ms 30888 KB Output is correct
9 Correct 105 ms 30664 KB Output is correct
10 Correct 146 ms 35848 KB Output is correct
11 Correct 152 ms 35980 KB Output is correct
12 Correct 156 ms 35968 KB Output is correct
13 Correct 175 ms 35976 KB Output is correct
14 Correct 140 ms 35952 KB Output is correct
15 Correct 158 ms 42552 KB Output is correct
16 Correct 152 ms 42940 KB Output is correct
17 Correct 167 ms 42220 KB Output is correct
18 Correct 184 ms 36476 KB Output is correct
19 Correct 189 ms 36704 KB Output is correct
20 Correct 181 ms 36684 KB Output is correct
21 Correct 122 ms 34804 KB Output is correct
22 Correct 123 ms 35044 KB Output is correct
23 Correct 121 ms 34984 KB Output is correct
24 Correct 119 ms 34940 KB Output is correct
25 Correct 143 ms 36364 KB Output is correct
26 Correct 145 ms 36380 KB Output is correct
27 Correct 141 ms 36260 KB Output is correct
28 Correct 125 ms 35804 KB Output is correct
29 Correct 126 ms 35800 KB Output is correct
30 Correct 143 ms 35984 KB Output is correct
31 Correct 126 ms 36008 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -