oj.uz

답안 #31289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31289 2017-08-17T22:12:20 Z imaxblue Pipes (BOI13_pipes) C++14
0 / 100
 726 ms 21448 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)

int n, m, a, b, N, k;
int c[100005], f[500005], in[100005], u[100005];
bool u2[100005];
vector<pii> v[100005], s;
queue<int> q;
void dfs(int N, int P, int C){
    //cout << N << ' ' << C << endl;
    if (u[N]){
        //cout << "*" << endl;
        if (u[N]==C){
            cout << 0 << endl;
            exit(0);
        }
        if (u2[N]) return;
        s.pb(mp(N, -1));
        fox(l, s.size()-1){
            u2[s[l].x]=1;
            c[s[l+1].x]-=c[s[l].x];
            f[s[l].y]+=c[s[l].x];
            //cout << s[l].y << ' ' << f[s[l].y] << endl;
        }
        k=c[s[0].x]/2;
        fox(l, s.size()-1){
            f[s[l].y]+=k;
            k*=-1;
        }
        s.pop_back();
        return;
    }
    u[N]=C;
    fox(l, v[N].size()){
        if (v[N][l].x==P) continue;
        s.pb(mp(N, v[N][l].y));
        dfs(v[N][l].x, N, 3-C);
        s.pop_back();
    }
}
int main(){
    cin >> n >> m;
    fox1(l, n) cin >> c[l];
    fox(l, m){
        cin >> a >> b;
        v[a].pb(mp(b, l));
        v[b].pb(mp(a, l));
        in[a]++; in[b]++;
    }
    fox1(l, n){
        if (in[l]==1) q.push(l);
    }
    while(!q.empty()){
        N=q.front(); q.pop();
        if (in[N]==0) continue;
        in[N]--;
        fox(l, v[N].size()){
            if (in[v[N][l].x]==0) continue;
            c[v[N][l].x]-=c[N];
            f[v[N][l].y]=c[N];
            //cout << N << ' ' << v[N][l].y << ' ' << c[N] << endl;
            in[v[N][l].x]--;
            if (in[v[N][l].x]==1) q.push(v[N][l].x);
        }
    }
    return 0;
    fox1(l, n){
        if (in[l]==0 || u[l]) continue;
        dfs(l, -1, 1);
    }
    fox(l, m){
        cout << f[l]*2 << endl;
    }
    return 0;
}

Compilation message

pipes.cpp: In function 'void dfs(int, int, int)':
pipes.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
pipes.cpp:41:9: note: in expansion of macro 'fox'
         fox(l, s.size()-1){
         ^
pipes.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
pipes.cpp:48:9: note: in expansion of macro 'fox'
         fox(l, s.size()-1){
         ^
pipes.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
pipes.cpp:56:5: note: in expansion of macro 'fox'
     fox(l, v[N].size()){
     ^
pipes.cpp: In function 'int main()':
pipes.cpp:18:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define fox(k, x) for (int k=0; k<x; ++k)
                                  ^
pipes.cpp:79:9: note: in expansion of macro 'fox'
         fox(l, v[N].size()){
         ^

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 7588 KB Output isn't correct
2 Incorrect 0 ms 7588 KB Output isn't correct
3 Incorrect 0 ms 7588 KB Output isn't correct
4 Incorrect 136 ms 11548 KB Output isn't correct
5 Incorrect 0 ms 7588 KB Output isn't correct
6 Incorrect 0 ms 7588 KB Output isn't correct
7 Incorrect 0 ms 7588 KB Output isn't correct
8 Incorrect 0 ms 7588 KB Output isn't correct
9 Incorrect 0 ms 7588 KB Output isn't correct
10 Incorrect 3 ms 7588 KB Output isn't correct
11 Incorrect 0 ms 7588 KB Output isn't correct
12 Incorrect 0 ms 7588 KB Output isn't correct
13 Incorrect 113 ms 10756 KB Output isn't correct
14 Incorrect 143 ms 11284 KB Output isn't correct
15 Incorrect 149 ms 11548 KB Output isn't correct
16 Incorrect 143 ms 10888 KB Output isn't correct
17 Incorrect 159 ms 11548 KB Output isn't correct
18 Incorrect 163 ms 11548 KB Output isn't correct
19 Incorrect 149 ms 10756 KB Output isn't correct
20 Incorrect 0 ms 7588 KB Output isn't correct
21 Incorrect 0 ms 7588 KB Output isn't correct
22 Incorrect 156 ms 11548 KB Output isn't correct
23 Incorrect 106 ms 10756 KB Output isn't correct
24 Incorrect 146 ms 11548 KB Output isn't correct
25 Incorrect 133 ms 10892 KB Output isn't correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 7588 KB Output isn't correct
2 Incorrect 0 ms 7588 KB Output isn't correct
3 Incorrect 146 ms 11020 KB Output isn't correct
4 Incorrect 166 ms 10888 KB Output isn't correct
5 Incorrect 166 ms 11284 KB Output isn't correct
6 Incorrect 726 ms 21448 KB Output isn't correct
7 Incorrect 0 ms 7588 KB Output isn't correct
8 Incorrect 0 ms 7588 KB Output isn't correct
9 Incorrect 0 ms 7588 KB Output isn't correct
10 Incorrect 0 ms 7588 KB Output isn't correct
11 Incorrect 0 ms 7588 KB Output isn't correct
12 Incorrect 0 ms 7588 KB Output isn't correct
13 Incorrect 0 ms 7588 KB Output isn't correct
14 Incorrect 0 ms 7588 KB Output isn't correct
15 Incorrect 0 ms 7588 KB Output isn't correct
16 Incorrect 0 ms 7588 KB Output isn't correct
17 Incorrect 3 ms 7588 KB Output isn't correct
18 Incorrect 0 ms 7588 KB Output isn't correct
19 Incorrect 0 ms 7588 KB Output isn't correct
20 Incorrect 0 ms 7588 KB Output isn't correct
21 Incorrect 0 ms 7720 KB Output isn't correct
22 Incorrect 3 ms 7588 KB Output isn't correct
23 Incorrect 133 ms 10360 KB Output isn't correct
24 Incorrect 169 ms 11152 KB Output isn't correct
25 Incorrect 143 ms 11020 KB Output isn't correct
26 Incorrect 159 ms 11020 KB Output isn't correct
27 Incorrect 149 ms 10756 KB Output isn't correct
28 Incorrect 156 ms 11420 KB Output isn't correct
29 Incorrect 569 ms 18808 KB Output isn't correct
30 Incorrect 133 ms 10756 KB Output isn't correct
31 Incorrect 136 ms 10888 KB Output isn't correct
32 Incorrect 156 ms 11416 KB Output isn't correct
33 Incorrect 163 ms 11152 KB Output isn't correct
34 Incorrect 116 ms 10888 KB Output isn't correct
35 Incorrect 153 ms 10888 KB Output isn't correct
36 Incorrect 149 ms 11284 KB Output isn't correct
37 Incorrect 579 ms 21448 KB Output isn't correct
38 Incorrect 133 ms 10888 KB Output isn't correct
39 Incorrect 156 ms 11416 KB Output isn't correct
40 Incorrect 136 ms 11152 KB Output isn't correct
41 Incorrect 153 ms 10888 KB Output isn't correct
42 Incorrect 139 ms 10756 KB Output isn't correct
43 Incorrect 143 ms 10756 KB Output isn't correct
44 Incorrect 146 ms 11284 KB Output isn't correct
45 Incorrect 529 ms 19864 KB Output isn't correct
46 Incorrect 143 ms 10756 KB Output isn't correct
47 Incorrect 136 ms 11152 KB Output isn't correct
48 Incorrect 136 ms 10888 KB Output isn't correct
49 Incorrect 129 ms 11284 KB Output isn't correct
50 Incorrect 129 ms 11020 KB Output isn't correct
51 Incorrect 149 ms 11152 KB Output isn't correct
52 Incorrect 129 ms 10888 KB Output isn't correct
53 Incorrect 476 ms 19600 KB Output isn't correct
54 Incorrect 146 ms 10888 KB Output isn't correct