oj.uz

Submission #46452

# Submission time Handle Problem Language Result Execution time Memory
46452 2018-04-20T22:04:30 Z alex99 Pipes (CEOI15_pipes) C++14
100 / 100
 4106 ms 7516 KB 
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
using namespace std;
int N, M;
int TT[100005], R[100005];
long long Sum[100005];
vector <int> G[100005];
bool Use[100005];
void Unite(int x, int y)
{
    if(x == y)
        return;
    if(R[x] < R[y])
    {
        TT[x] = y;
    }
    else
        TT[y] = x;
    if(R[x] == R[y])
        R[x]++;
}

int Father(int x)
{
    int init = x;
    while(x != TT[x])
        x = TT[x];
    while(init != x)
    {
        int next = TT[init];
        TT[init] = x;
        init = next;
    }
    return x;
}

void DFS(int node, int father)
{
    Use[node] = 1;
    for(int i = 0; i < G[node].size(); i++)
    {
        int neighb = G[node][i];
        if(neighb == father)
            continue;
        DFS(neighb, node);
        Sum[node] += Sum[neighb];
    }
    if(Sum[node] == 0 && father != 0)
    {
        cout << node << " " << father << "\n";
    }
}

void Solve()
{
    cin >> N >> M;
    for(int i = 1; i <= N; i++)
        TT[i] = i;
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        cin >> x >> y;
        if(Father(x) == Father(y))
        {
            int r = rand();
            Sum[x] += r;
            Sum[y] -= r;
        }
        else
        {
            G[x].push_back(y);
            G[y].push_back(x);
            Unite(Father(x), Father(y));
        }
    }
    for(int i = 1; i <= N; i++)
        if(Use[i] == 0)
            DFS(i, 0);
}
int main()
{
    srand(time(NULL));
    Solve();
    return 0;
}

Compilation message

pipes.cpp: In function 'void DFS(int, int)':
pipes.cpp:42:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < G[node].size(); i++)
                    ~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct
2 Correct 10 ms 2916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 2896 KB Output is correct
2 Correct 293 ms 2816 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 517 ms 3200 KB Output is correct
2 Correct 630 ms 3072 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 883 ms 3844 KB Output is correct
2 Correct 730 ms 4152 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1143 ms 6008 KB Output is correct
2 Correct 1006 ms 6008 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1816 ms 6512 KB Output is correct
2 Correct 1785 ms 6484 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2498 ms 7396 KB Output is correct
2 Correct 2369 ms 7412 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3076 ms 7460 KB Output is correct
2 Correct 2980 ms 7516 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4106 ms 7172 KB Output is correct
2 Correct 3588 ms 7492 KB Output is correct