oj.uz

Submission #1077624

# Submission time Handle Problem Language Result Execution time Memory
1077624 2024-08-27T08:24:27 Z huyngodzz Pipes (BOI13_pipes) C++14
74.0741 / 100
 123 ms 23636 KB 
    ///huynhocute123///
#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define pb push_back
#define pi M_PI
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define REP(i, a, b) for(int i = b; i >= a; --i)
#define ALL(v) v.begin(),v.end()
#define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
#define out(name) if(fopen(name, "w")) freopen(name, "w", stdout);
//random_device rd;
//mt19937 rng(rd());
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
//#define int long long
const int maxN = 1e5 + 9 ;
const int  modd = 1e9 + 7;
const int base = 2309;
const int MAX = 1e9+9;
void minimize(int &u, int v){
    if(v < u) u = v;
}
void maximize(int &u, int v){
    if(v > u) u = v;
}
int n, k, t, m, res, a[maxN], ans[maxN], deg[maxN];
int l, r;
bool vis[maxN];
vector<pii> e[maxN];
namespace sub1{
    void dfs(int u ,int p){
        for(auto [x, id] : e[u]){
            if(x == p)continue;
            dfs(x , u);
            ans[id]= a[x];
            a[u] -= a[x];


        }
    }
    void solve(){
        dfs(1, 0);
        FOR(i, 1, m)cout << ans[i] *2 <<'\n';
    }
}
namespace sub2{
    queue<int> q;
    void solve(){
        FOR(i, 1, n){
            if(deg[i] == 1){
                q.push(i);
                    vis[i] =1;
//                    cout << i << " ";
            }
        }
//        cout <<endl;
        while(!q.empty()){
            int u = q.front();
//            cout << u << " ";
            q.pop();
            vis[u] =1;
            for(auto [x, id ] : e[u]){
                if(vis[x])continue;
                ans[id] = a[u];
//                cout << id << " " << a[u] <<'\n';
                a[x]-=a[u];
//                vis[x] = 1;
                deg[x]--;
                if(deg[x] == 1)q.push(x);

            }


        }
        int cnt =0;
        FOR(i, 1, n){
            if(!vis[i]){
                q.push(i);
                cnt++;
            }
        }
        if(cnt %2 ==0){
            cout << 0;
            return;
        }


    FOR(i, 1, m)cout << ans[i] *2 <<'\n';

    }
}
void solve(){
    cin >> n >> m;
    FOR(i, 1, n)cin >> a[i];
    FOR(i, 1, m){
        cin >> l >> r;
        e[l].pb({r, i});
        e[r].pb({l, i});
        deg[l]++;
        deg[r]++;
    }
    if(m > n ){
        cout << 0;
        return;
    }
    if(m == n)sub2::solve();
    else sub1::solve();

}
signed main(){
//    freopen("name.inp","r",stdin);
//    freopen("name.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    inp("task.inp");
    t = 1;
   // cin >> t;
    while( t-- )solve();

}

Compilation message

pipes.cpp: In function 'void sub1::dfs(int, int)':
pipes.cpp:37:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |         for(auto [x, id] : e[u]){
      |                  ^
pipes.cpp: In function 'void sub2::solve()':
pipes.cpp:67:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   67 |             for(auto [x, id ] : e[u]){
      |                      ^
pipes.cpp: In function 'int main()':
pipes.cpp:13:47: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
      |                                        ~~~~~~~^~~~~~~~~~~~~~~~~~
pipes.cpp:120:5: note: in expansion of macro 'inp'
  120 |     inp("task.inp");
      |     ^~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 33 ms 9552 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 28 ms 8120 KB Output is correct
14 Correct 37 ms 9308 KB Output is correct
15 Correct 38 ms 9552 KB Output is correct
16 Correct 28 ms 8536 KB Output is correct
17 Correct 36 ms 9484 KB Output is correct
18 Correct 34 ms 9556 KB Output is correct
19 Correct 42 ms 12884 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 34 ms 9548 KB Output is correct
23 Correct 28 ms 8296 KB Output is correct
24 Correct 38 ms 9604 KB Output is correct
25 Correct 35 ms 8528 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Output isn't correct
2 Incorrect 2 ms 2904 KB Output isn't correct
3 Correct 28 ms 8796 KB Output is correct
4 Correct 29 ms 8276 KB Output is correct
5 Correct 27 ms 8528 KB Output is correct
6 Correct 123 ms 23636 KB Output is correct
7 Incorrect 1 ms 2652 KB Output isn't correct
8 Incorrect 1 ms 2652 KB Output isn't correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Incorrect 2 ms 2648 KB Output isn't correct
15 Incorrect 2 ms 2652 KB Output isn't correct
16 Incorrect 1 ms 2652 KB Output isn't correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2904 KB Output is correct
22 Incorrect 2 ms 2652 KB Output isn't correct
23 Incorrect 31 ms 8272 KB Output isn't correct
24 Incorrect 32 ms 9564 KB Output isn't correct
25 Correct 30 ms 8876 KB Output is correct
26 Correct 31 ms 8284 KB Output is correct
27 Correct 28 ms 8308 KB Output is correct
28 Correct 29 ms 8796 KB Output is correct
29 Correct 91 ms 19792 KB Output is correct
30 Incorrect 34 ms 9044 KB Output isn't correct
31 Incorrect 32 ms 9384 KB Output isn't correct
32 Incorrect 34 ms 9844 KB Output isn't correct
33 Correct 34 ms 9076 KB Output is correct
34 Correct 25 ms 8284 KB Output is correct
35 Correct 29 ms 8272 KB Output is correct
36 Correct 31 ms 8532 KB Output is correct
37 Correct 104 ms 23636 KB Output is correct
38 Incorrect 35 ms 9300 KB Output isn't correct
39 Incorrect 37 ms 9808 KB Output isn't correct
40 Incorrect 36 ms 9556 KB Output isn't correct
41 Correct 27 ms 9044 KB Output is correct
42 Correct 27 ms 8276 KB Output is correct
43 Correct 25 ms 8272 KB Output is correct
44 Correct 31 ms 8536 KB Output is correct
45 Correct 83 ms 20760 KB Output is correct
46 Incorrect 37 ms 9276 KB Output isn't correct
47 Incorrect 33 ms 9548 KB Output isn't correct
48 Incorrect 30 ms 9372 KB Output isn't correct
49 Correct 34 ms 8960 KB Output is correct
50 Correct 26 ms 8272 KB Output is correct
51 Correct 39 ms 8408 KB Output is correct
52 Correct 26 ms 8284 KB Output is correct
53 Correct 86 ms 20716 KB Output is correct
54 Incorrect 37 ms 9364 KB Output isn't correct