oj.uz

Submission #484703

# Submission time Handle Problem Language Result Execution time Memory
484703 2021-11-05T07:34:54 Z idas Pipes (BOI13_pipes) C++17
55.9259 / 100
 416 ms 48040 KB 
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define TSTS int ttt; cin >> ttt; while(ttt--) solve()
#define F first
#define S second
#define PB push_back
#define MP make_pair

using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pff;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef long double ld;
typedef long long ll;

const int INF=1e9, MOD=1e9+7;

void setIO()
{
    FAST_IO;
}

void setIO(string s)
{
    FAST_IO;
    freopen((s+".in").c_str(), "r", stdin);
    freopen((s+".out").c_str(), "w", stdout);
}

const int N=5e5+10;
int n, m;
ll c[N], non[N];
vi ad[N];
bool v[N], vc[N];
map<pii, ll> x;
map<int, pii> con;

queue<int> q;
void bfs()
{
    while(!q.empty()){
        int u=q.front(); q.pop();
        if(v[u]) continue;
        v[u]=true;
        int cn=0;
        for(auto it : ad[u]){
            if(!x.count({it, u})) cn++;
        }
        if(cn>=2){
            v[u]=false;
            continue;
        }
        int in=-1;
        ll sm=0;
        for(auto it : ad[u]){
            if(!x.count({it, u})) in=it;
            sm+=x[{it, u}];
        }
        q.push(in);
        x[{in, u}]=x[{u, in}]=2LL*c[u]-sm;
    }
}

int inn;
ll sm, all;
void dfs(int u)
{
    v[u]=true; vc[u]=true;
    if(inn&1){
        sm+=2*c[u]-non[u];
    }
    all+=2*c[u]-non[u];
    inn++;
    for(auto it : ad[u]){
        if(v[it]) continue;
        dfs(it);
    }
}

int in;

void getA()
{
    int l=-1;
    for(auto it : ad[in]){
        if(!v[it]){
            if(l==-1) l=it;
            else break;
        }
    }
    dfs(l);
    x[{in, l}]=x[{l, in}]=all/2-sm;
}

void build(int u)
{
    vc[u]=false;
    ll have=0;
    for(auto it : ad[u]){
        if(x.count({u, it})) have+=x[{u, it}];
    }
    for(auto it : ad[u]){
        if(!x.count({u, it})){
            x[{u, it}]=x[{it, u}]=2LL*c[u]-have;
        }
    }
    for(auto it : ad[u]){
        if(!vc[it]) continue;
        build(it);
    }
}

void getNon()
{
    FOR(i, 0, n)
    {
        if(!v[i]){
            for(auto it : ad[i]){
                if(v[it]){
                    non[i]+=x[{i, it}];
                }
            }
        }
    }
}

int main()
{
    setIO();
    cin >> n >> m;
    assert(m<=n);
    FOR(i, 0, n) cin >> c[i];
    FOR(i, 0, m)
    {
        int a, b; cin >> a >> b; a--; b--;
        ad[a].PB(b);
        ad[b].PB(a);
        con[i]={a, b};
    }
    if(n<m){
        cout << 0;
        return 0;
    }

    vi lf;
    FOR(i, 0, n) if(ad[i].size()==1) lf.PB(i);

    for(auto u : lf){
        q.push(u);
    }

    bfs();
    getNon();

    FOR(i, 0, n)
    {
        if(!v[i]){
            in=i;
        }
    }

    if(in==-1){
        FOR(i, 0, m)
        {
            cout << x[con[i]] << '\n';
        }
        return 0;
    }

    getA();
    build(in);

    FOR(i, 0, m)
    {
        cout << x[con[i]] << '\n';
    }
}

Compilation message

pipes.cpp: In function 'void setIO(std::string)':
pipes.cpp:29:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen((s+".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pipes.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen((s+".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11980 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 8 ms 12236 KB Output is correct
4 Correct 401 ms 35432 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 7 ms 11996 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 8 ms 12108 KB Output is correct
9 Correct 7 ms 12236 KB Output is correct
10 Correct 8 ms 12236 KB Output is correct
11 Correct 8 ms 12236 KB Output is correct
12 Correct 7 ms 12236 KB Output is correct
13 Correct 273 ms 30672 KB Output is correct
14 Correct 360 ms 34244 KB Output is correct
15 Correct 385 ms 35644 KB Output is correct
16 Correct 313 ms 32048 KB Output is correct
17 Correct 358 ms 35476 KB Output is correct
18 Correct 416 ms 35576 KB Output is correct
19 Correct 262 ms 35316 KB Output is correct
20 Correct 7 ms 12072 KB Output is correct
21 Correct 7 ms 12236 KB Output is correct
22 Correct 381 ms 35576 KB Output is correct
23 Correct 271 ms 30664 KB Output is correct
24 Correct 363 ms 35620 KB Output is correct
25 Correct 314 ms 31576 KB Output is correct

Subtask #2
25.9259259259 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 7 ms 12364 KB Output is correct
3 Incorrect 328 ms 41108 KB Output isn't correct
4 Runtime error 17 ms 24240 KB Execution killed with signal 6
5 Runtime error 16 ms 24268 KB Execution killed with signal 6
6 Runtime error 17 ms 24296 KB Execution killed with signal 6
7 Correct 6 ms 12108 KB Output is correct
8 Correct 8 ms 12112 KB Output is correct
9 Incorrect 6 ms 12108 KB Output isn't correct
10 Runtime error 15 ms 24280 KB Execution killed with signal 6
11 Runtime error 15 ms 24292 KB Execution killed with signal 6
12 Runtime error 15 ms 24260 KB Execution killed with signal 6
13 Runtime error 18 ms 24268 KB Execution killed with signal 6
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12348 KB Output is correct
16 Correct 8 ms 12240 KB Output is correct
17 Incorrect 8 ms 12364 KB Output isn't correct
18 Runtime error 20 ms 24280 KB Execution killed with signal 6
19 Runtime error 16 ms 24224 KB Execution killed with signal 6
20 Runtime error 16 ms 24312 KB Execution killed with signal 6
21 Runtime error 16 ms 24268 KB Execution killed with signal 6
22 Correct 8 ms 12364 KB Output is correct
23 Correct 236 ms 38432 KB Output is correct
24 Correct 309 ms 42924 KB Output is correct
25 Incorrect 288 ms 41096 KB Output isn't correct
26 Runtime error 15 ms 24268 KB Execution killed with signal 6
27 Runtime error 17 ms 24304 KB Execution killed with signal 6
28 Runtime error 20 ms 24268 KB Execution killed with signal 6
29 Runtime error 18 ms 24268 KB Execution killed with signal 6
30 Correct 287 ms 41952 KB Output is correct
31 Correct 281 ms 48040 KB Output is correct
32 Correct 376 ms 38768 KB Output is correct
33 Incorrect 315 ms 43252 KB Output isn't correct
34 Runtime error 16 ms 24268 KB Execution killed with signal 6
35 Runtime error 20 ms 24268 KB Execution killed with signal 6
36 Runtime error 15 ms 24268 KB Execution killed with signal 6
37 Runtime error 16 ms 24288 KB Execution killed with signal 6
38 Correct 269 ms 42084 KB Output is correct
39 Correct 409 ms 37700 KB Output is correct
40 Correct 310 ms 42272 KB Output is correct
41 Incorrect 289 ms 47988 KB Output isn't correct
42 Runtime error 15 ms 24268 KB Execution killed with signal 6
43 Runtime error 15 ms 24300 KB Execution killed with signal 6
44 Runtime error 15 ms 24248 KB Execution killed with signal 6
45 Runtime error 15 ms 24268 KB Execution killed with signal 6
46 Correct 303 ms 41316 KB Output is correct
47 Correct 298 ms 42544 KB Output is correct
48 Correct 278 ms 47572 KB Output is correct
49 Incorrect 349 ms 37016 KB Output isn't correct
50 Runtime error 15 ms 24232 KB Execution killed with signal 6
51 Runtime error 14 ms 24268 KB Execution killed with signal 6
52 Runtime error 15 ms 24268 KB Execution killed with signal 6
53 Runtime error 15 ms 24268 KB Execution killed with signal 6
54 Correct 278 ms 41072 KB Output is correct