oj.uz

Submission #484706

# Submission time Handle Problem Language Result Execution time Memory
484706 2021-11-05T07:46:02 Z idas Pipes (BOI13_pipes) C++17
100 / 100
 442 ms 53268 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;
    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();

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

    if(n==m && cycsz&1^1){
        cout << 0 << '\n';
        return 0;
    }

    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 'int main()':
pipes.cpp:163:21: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  163 |     if(n==m && cycsz&1^1){
      |                ~~~~~^~
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 12104 KB Output is correct
3 Correct 8 ms 12236 KB Output is correct
4 Correct 383 ms 35404 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 9 ms 11980 KB Output is correct
8 Correct 8 ms 12108 KB Output is correct
9 Correct 10 ms 12292 KB Output is correct
10 Correct 8 ms 12260 KB Output is correct
11 Correct 8 ms 12320 KB Output is correct
12 Correct 10 ms 12272 KB Output is correct
13 Correct 271 ms 30816 KB Output is correct
14 Correct 415 ms 34224 KB Output is correct
15 Correct 442 ms 35540 KB Output is correct
16 Correct 329 ms 32032 KB Output is correct
17 Correct 409 ms 35524 KB Output is correct
18 Correct 442 ms 35688 KB Output is correct
19 Correct 294 ms 35300 KB Output is correct
20 Correct 7 ms 12108 KB Output is correct
21 Correct 8 ms 12316 KB Output is correct
22 Correct 384 ms 35644 KB Output is correct
23 Correct 311 ms 30708 KB Output is correct
24 Correct 371 ms 35536 KB Output is correct
25 Correct 301 ms 31616 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 10 ms 12448 KB Output is correct
3 Correct 230 ms 28840 KB Output is correct
4 Correct 61 ms 22264 KB Output is correct
5 Correct 62 ms 21932 KB Output is correct
6 Correct 263 ms 53148 KB Output is correct
7 Correct 7 ms 12108 KB Output is correct
8 Correct 9 ms 12108 KB Output is correct
9 Correct 8 ms 12092 KB Output is correct
10 Correct 6 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 12108 KB Output is correct
15 Correct 8 ms 12340 KB Output is correct
16 Correct 7 ms 12236 KB Output is correct
17 Correct 7 ms 12236 KB Output is correct
18 Correct 6 ms 12108 KB Output is correct
19 Correct 7 ms 12136 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 8 ms 12236 KB Output is correct
22 Correct 7 ms 12364 KB Output is correct
23 Correct 239 ms 38436 KB Output is correct
24 Correct 323 ms 42884 KB Output is correct
25 Correct 195 ms 28824 KB Output is correct
26 Correct 61 ms 22212 KB Output is correct
27 Correct 65 ms 22068 KB Output is correct
28 Correct 62 ms 22508 KB Output is correct
29 Correct 204 ms 45280 KB Output is correct
30 Correct 301 ms 42052 KB Output is correct
31 Correct 306 ms 48084 KB Output is correct
32 Correct 440 ms 38728 KB Output is correct
33 Correct 168 ms 28132 KB Output is correct
34 Correct 76 ms 22212 KB Output is correct
35 Correct 72 ms 22236 KB Output is correct
36 Correct 62 ms 22296 KB Output is correct
37 Correct 229 ms 53268 KB Output is correct
38 Correct 294 ms 41956 KB Output is correct
39 Correct 361 ms 37760 KB Output is correct
40 Correct 302 ms 42280 KB Output is correct
41 Correct 111 ms 24224 KB Output is correct
42 Correct 59 ms 22212 KB Output is correct
43 Correct 59 ms 22132 KB Output is correct
44 Correct 58 ms 22044 KB Output is correct
45 Correct 216 ms 47948 KB Output is correct
46 Correct 286 ms 41540 KB Output is correct
47 Correct 312 ms 42480 KB Output is correct
48 Correct 284 ms 47632 KB Output is correct
49 Correct 312 ms 32844 KB Output is correct
50 Correct 59 ms 22212 KB Output is correct
51 Correct 61 ms 22296 KB Output is correct
52 Correct 64 ms 22080 KB Output is correct
53 Correct 222 ms 48908 KB Output is correct
54 Correct 288 ms 41140 KB Output is correct