oj.uz

답안 #885550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885550 2023-12-10T04:40:25 Z 8pete8 Pipes (BOI13_pipes) C++17
100 / 100
 122 ms 42712 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
const int mod=1e9+7,mxn=5e5+5,lg=30,inf=1e18,minf=-1e18;
int ans[mxn+10],val[mxn+10],up[mxn+10],curval[mxn+10];
vector<pii>adj[mxn+10];
bitset<mxn+10>vis;
bool yes=false;
void solve(int cur,int p){
    if(vis[cur])return void(yes=true);
    vis[cur]=true;
    bool leaf=true;
    for(auto i:adj[cur])if(i.f!=p)leaf=false;
    if(leaf){
        ans[up[cur]]+=val[cur];
        curval[p]+=val[cur];
        return;
    }
    for(auto i:adj[cur]){
        if(i.f==p)continue;
        up[i.f]=i.s;
        solve(i.f,cur);
    }
    if(cur==1)return;
    ans[up[cur]]+=(val[cur]-curval[cur]);
    curval[p]+=(val[cur]-curval[cur]);
}
vector<ppii>path;
int deg[mxn+10],sum,cnt=0;
int start=1;
void solve2(int cur,int p){
    if(vis[cur])return;
    cnt++;
    if(cnt%2)sum+=(val[cur]-curval[cur]);
    else sum-=(val[cur]-curval[cur]);
    vis[cur]=true;
    for(auto i:adj[cur]){
        if(i.f==start&&i.f!=p){
            path.pb({i.s,{i.f,cur}});
            return;
        }
        if(i.f!=p&&!vis[i.f]){
            path.pb({i.s,{i.f,cur}});
            solve2(i.f,cur); 
        }
    }
}
int32_t main(){
    fastio
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>val[i];
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        adj[a].pb({b,i});
        adj[b].pb({a,i});
    }
    if(m>n){
        cout<<0;
        return 0;
    }
    if(m==n-1){
        solve(1,-1);
        for(int i=0;i<m;i++)cout<<2*ans[i]<<'\n';
        return 0;
    }
    queue<int>st;
    for(int i=1;i<=n;i++){
        if(adj[i].size()==1)st.push(i);
        deg[i]=adj[i].size();
    }
    cnt=0;
    int add;
    while(!st.empty()){
        vis[st.front()]=true;
        for(auto i:adj[st.front()]){
            if(vis[i.f])continue;
            deg[i.f]--;
            add=val[st.front()]-curval[st.front()];
            ans[i.s]+=add;
            curval[i.f]+=add;
            curval[st.front()]+=add;
            if(deg[i.f]<=1){
                st.push(i.f);
                vis[i.f]=true;
            }
        }
        st.pop();
        cnt++;
    }
    for(int i=1;i<=n;i++)if(!vis[i])start=i;
    for(int i=1;i<=n;i++)if(!vis[i]&&curval[i]!=0)start=i;
    if((n-cnt)%2==0){
        cout<<0;
        return 0;
    }
    cnt=0;
    solve2(start,-1);
    sum/=2;
    reverse(all(path));
    for(int i=0;i<path.size();i++){
        if(i==0)add=sum;
        else add=val[path[i].s.f]-curval[path[i].s.f];
        ans[path[i].f]+=add;
        curval[path[i].s.f]+=add;
        curval[path[i].s.s]+=add;
    }
    /*

    */
    for(int i=0;i<m;i++)cout<<2*ans[i]<<'\n';
}

Compilation message

pipes.cpp: In function 'int32_t main()':
pipes.cpp:131:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |     for(int i=0;i<path.size();i++){
      |                 ~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 20828 KB Output is correct
2 Correct 3 ms 20916 KB Output is correct
3 Correct 4 ms 20828 KB Output is correct
4 Correct 41 ms 26348 KB Output is correct
5 Correct 4 ms 20828 KB Output is correct
6 Correct 3 ms 20828 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 3 ms 20828 KB Output is correct
9 Correct 4 ms 20828 KB Output is correct
10 Correct 4 ms 20828 KB Output is correct
11 Correct 4 ms 20856 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 32 ms 25164 KB Output is correct
14 Correct 38 ms 26204 KB Output is correct
15 Correct 45 ms 26340 KB Output is correct
16 Correct 35 ms 25692 KB Output is correct
17 Correct 43 ms 26452 KB Output is correct
18 Correct 40 ms 26448 KB Output is correct
19 Correct 55 ms 29588 KB Output is correct
20 Correct 3 ms 20828 KB Output is correct
21 Correct 4 ms 20828 KB Output is correct
22 Correct 40 ms 26352 KB Output is correct
23 Correct 33 ms 25300 KB Output is correct
24 Correct 42 ms 26452 KB Output is correct
25 Correct 34 ms 25424 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18776 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 36 ms 26192 KB Output is correct
4 Correct 33 ms 21844 KB Output is correct
5 Correct 30 ms 21668 KB Output is correct
6 Correct 122 ms 42576 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 3 ms 18780 KB Output is correct
9 Correct 3 ms 18780 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 3 ms 16728 KB Output is correct
13 Correct 3 ms 16728 KB Output is correct
14 Correct 3 ms 18780 KB Output is correct
15 Correct 4 ms 19036 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 18780 KB Output is correct
18 Correct 3 ms 16732 KB Output is correct
19 Correct 3 ms 16732 KB Output is correct
20 Correct 4 ms 16732 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 3 ms 19036 KB Output is correct
23 Correct 42 ms 32804 KB Output is correct
24 Correct 50 ms 34052 KB Output is correct
25 Correct 37 ms 26196 KB Output is correct
26 Correct 31 ms 21888 KB Output is correct
27 Correct 34 ms 21792 KB Output is correct
28 Correct 32 ms 22100 KB Output is correct
29 Correct 96 ms 37508 KB Output is correct
30 Correct 50 ms 32544 KB Output is correct
31 Correct 57 ms 38616 KB Output is correct
32 Correct 46 ms 29196 KB Output is correct
33 Correct 37 ms 26564 KB Output is correct
34 Correct 31 ms 21848 KB Output is correct
35 Correct 31 ms 21852 KB Output is correct
36 Correct 31 ms 21844 KB Output is correct
37 Correct 122 ms 42712 KB Output is correct
38 Correct 49 ms 33128 KB Output is correct
39 Correct 43 ms 28260 KB Output is correct
40 Correct 48 ms 33512 KB Output is correct
41 Correct 38 ms 26204 KB Output is correct
42 Correct 34 ms 21844 KB Output is correct
43 Correct 31 ms 21840 KB Output is correct
44 Correct 32 ms 21852 KB Output is correct
45 Correct 92 ms 40528 KB Output is correct
46 Correct 48 ms 32196 KB Output is correct
47 Correct 49 ms 33544 KB Output is correct
48 Correct 54 ms 38112 KB Output is correct
49 Correct 34 ms 26204 KB Output is correct
50 Correct 31 ms 21852 KB Output is correct
51 Correct 31 ms 21964 KB Output is correct
52 Correct 32 ms 21996 KB Output is correct
53 Correct 102 ms 39588 KB Output is correct
54 Correct 52 ms 31692 KB Output is correct