oj.uz

답안 #885548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885548 2023-12-10T04:10:00 Z 8pete8 Pipes (BOI13_pipes) C++17
74.0741 / 100
 267 ms 42688 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++;
    sum+=(val[cur]-curval[cur])*((cnt%2)?1:-1);
    vis[cur]=true;
    for(auto i:adj[cur]){
        if(i.f==start&&i.f!=p)path.pb({i.s,{i.f,cur}});
        if(i.f==p||vis[i.f])continue;
        up[i.f]=i.s;
        path.pb({i.s,{i.f,cur}});
        solve2(i.f,cur);
    }
}
int32_t main(){
    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;
    }
    stack<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.top()]=true;
        for(auto i:adj[st.top()]){
            if(vis[i.f])continue;
            deg[i.f]--;
            add=val[st.top()]-curval[st.top()];
            ans[i.s]+=add;
            curval[i.f]+=add;
            curval[st.top()]+=add;
            if(deg[i.f]==1)st.push(i.f);
        }
        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:123: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]
  123 |     for(int i=0;i<path.size();i++){
      |                 ~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21084 KB Output is correct
2 Correct 4 ms 20828 KB Output is correct
3 Correct 4 ms 20828 KB Output is correct
4 Correct 83 ms 26348 KB Output is correct
5 Correct 5 ms 20824 KB Output is correct
6 Correct 4 ms 20828 KB Output is correct
7 Correct 3 ms 20828 KB Output is correct
8 Correct 5 ms 20828 KB Output is correct
9 Correct 4 ms 20824 KB Output is correct
10 Correct 4 ms 20828 KB Output is correct
11 Correct 4 ms 20828 KB Output is correct
12 Correct 4 ms 20824 KB Output is correct
13 Correct 63 ms 25292 KB Output is correct
14 Correct 79 ms 26028 KB Output is correct
15 Correct 83 ms 26472 KB Output is correct
16 Correct 68 ms 25428 KB Output is correct
17 Correct 82 ms 26488 KB Output is correct
18 Correct 85 ms 26308 KB Output is correct
19 Correct 85 ms 29524 KB Output is correct
20 Correct 4 ms 20824 KB Output is correct
21 Correct 4 ms 20828 KB Output is correct
22 Correct 80 ms 26320 KB Output is correct
23 Correct 63 ms 25204 KB Output is correct
24 Correct 80 ms 26508 KB Output is correct
25 Correct 68 ms 25472 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 18776 KB Output isn't correct
2 Incorrect 4 ms 19036 KB Output isn't correct
3 Correct 70 ms 24888 KB Output is correct
4 Correct 79 ms 21840 KB Output is correct
5 Correct 67 ms 21844 KB Output is correct
6 Correct 267 ms 42548 KB Output is correct
7 Incorrect 4 ms 18780 KB Output isn't correct
8 Correct 4 ms 18920 KB Output is correct
9 Correct 3 ms 16792 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 4 ms 16732 KB Output is correct
12 Correct 4 ms 16732 KB Output is correct
13 Correct 3 ms 16732 KB Output is correct
14 Incorrect 3 ms 18892 KB Output isn't correct
15 Incorrect 4 ms 19036 KB Output isn't correct
16 Incorrect 4 ms 19032 KB Output isn't correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 5 ms 16844 KB Output is correct
19 Correct 5 ms 16732 KB Output is correct
20 Correct 4 ms 16732 KB Output is correct
21 Correct 5 ms 16988 KB Output is correct
22 Incorrect 3 ms 16732 KB Output isn't correct
23 Incorrect 77 ms 34768 KB Output isn't correct
24 Incorrect 90 ms 36432 KB Output isn't correct
25 Correct 67 ms 24868 KB Output is correct
26 Correct 79 ms 21964 KB Output is correct
27 Correct 75 ms 21844 KB Output is correct
28 Correct 72 ms 22096 KB Output is correct
29 Correct 222 ms 37712 KB Output is correct
30 Incorrect 70 ms 24912 KB Output isn't correct
31 Incorrect 95 ms 40152 KB Output isn't correct
32 Incorrect 89 ms 30988 KB Output isn't correct
33 Correct 77 ms 25088 KB Output is correct
34 Correct 89 ms 21996 KB Output is correct
35 Correct 68 ms 21844 KB Output is correct
36 Correct 70 ms 22040 KB Output is correct
37 Correct 264 ms 42688 KB Output is correct
38 Incorrect 92 ms 35320 KB Output isn't correct
39 Incorrect 73 ms 25288 KB Output isn't correct
40 Incorrect 92 ms 35588 KB Output isn't correct
41 Incorrect 94 ms 39632 KB Output isn't correct
42 Correct 81 ms 21840 KB Output is correct
43 Correct 69 ms 21836 KB Output is correct
44 Correct 66 ms 21840 KB Output is correct
45 Correct 212 ms 40504 KB Output is correct
46 Incorrect 76 ms 24848 KB Output isn't correct
47 Incorrect 74 ms 25168 KB Output isn't correct
48 Incorrect 96 ms 39008 KB Output isn't correct
49 Correct 67 ms 24912 KB Output is correct
50 Correct 70 ms 21968 KB Output is correct
51 Correct 72 ms 21836 KB Output is correct
52 Correct 67 ms 21840 KB Output is correct
53 Correct 230 ms 39692 KB Output is correct
54 Incorrect 76 ms 24840 KB Output isn't correct