oj.uz

Submission #484702

# Submission time Handle Problem Language Result Execution time Memory
484702 2021-11-05T07:33:20 Z idas Pipes (BOI13_pipes) C++17
90.9259 / 100
 403 ms 53192 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);
    assert(all%2==0);
    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;
    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 381 ms 35452 KB Output is correct
5 Correct 6 ms 11980 KB Output is correct
6 Correct 7 ms 12016 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12076 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 12328 KB Output is correct
12 Correct 7 ms 12236 KB Output is correct
13 Correct 271 ms 30760 KB Output is correct
14 Correct 356 ms 34196 KB Output is correct
15 Correct 369 ms 35524 KB Output is correct
16 Correct 313 ms 32024 KB Output is correct
17 Correct 403 ms 35520 KB Output is correct
18 Correct 385 ms 35536 KB Output is correct
19 Correct 258 ms 35232 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 7 ms 12260 KB Output is correct
22 Correct 358 ms 35528 KB Output is correct
23 Correct 279 ms 30844 KB Output is correct
24 Correct 359 ms 35652 KB Output is correct
25 Correct 305 ms 31724 KB Output is correct

Subtask #2
60.9259259259 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12364 KB Output is correct
3 Incorrect 283 ms 41108 KB Output isn't correct
4 Correct 62 ms 22140 KB Output is correct
5 Correct 60 ms 22084 KB Output is correct
6 Correct 238 ms 53192 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Incorrect 6 ms 12072 KB Output isn't correct
10 Correct 7 ms 11980 KB Output is correct
11 Correct 6 ms 11980 KB Output is correct
12 Correct 6 ms 11980 KB Output is correct
13 Correct 6 ms 12108 KB Output is correct
14 Correct 6 ms 11980 KB Output is correct
15 Correct 8 ms 12452 KB Output is correct
16 Correct 8 ms 12300 KB Output is correct
17 Incorrect 8 ms 12364 KB Output isn't correct
18 Correct 6 ms 12104 KB Output is correct
19 Correct 6 ms 12108 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 7 ms 12236 KB Output is correct
22 Correct 7 ms 12364 KB Output is correct
23 Correct 218 ms 38436 KB Output is correct
24 Correct 289 ms 42948 KB Output is correct
25 Incorrect 300 ms 41260 KB Output isn't correct
26 Correct 58 ms 22208 KB Output is correct
27 Correct 59 ms 22084 KB Output is correct
28 Correct 62 ms 22576 KB Output is correct
29 Correct 190 ms 45368 KB Output is correct
30 Correct 256 ms 42052 KB Output is correct
31 Correct 253 ms 47988 KB Output is correct
32 Correct 352 ms 38760 KB Output is correct
33 Incorrect 296 ms 43264 KB Output isn't correct
34 Correct 59 ms 22248 KB Output is correct
35 Correct 61 ms 22160 KB Output is correct
36 Correct 63 ms 22280 KB Output is correct
37 Correct 234 ms 53172 KB Output is correct
38 Correct 265 ms 42016 KB Output is correct
39 Correct 351 ms 37936 KB Output is correct
40 Correct 296 ms 42364 KB Output is correct
41 Incorrect 318 ms 48196 KB Output isn't correct
42 Correct 68 ms 22212 KB Output is correct
43 Correct 58 ms 22192 KB Output is correct
44 Correct 61 ms 21956 KB Output is correct
45 Correct 194 ms 47960 KB Output is correct
46 Correct 263 ms 41456 KB Output is correct
47 Correct 288 ms 42544 KB Output is correct
48 Correct 271 ms 47556 KB Output is correct
49 Incorrect 342 ms 37028 KB Output isn't correct
50 Correct 64 ms 22248 KB Output is correct
51 Correct 66 ms 22292 KB Output is correct
52 Correct 70 ms 21996 KB Output is correct
53 Correct 203 ms 48932 KB Output is correct
54 Correct 275 ms 41016 KB Output is correct