oj.uz

Submission #1055432

# Submission time Handle Problem Language Result Execution time Memory
1055432 2024-08-12T19:17:17 Z vjudge1 Pipes (CEOI15_pipes) C++17
20 / 100
 161 ms 13028 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#define endl '\n'
#define db double
#define ll __int128
//#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e4 + 7, Inf = 1e16 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

bitset <Max> v[Max];
vector <int> l, s; int idx, n;

void dfs(int node, int parent)
{  
    l[node] = s[node] = idx; idx++; 

    for(int u = 1; u <= n; u++)if(u != parent && v[node][u] == 1 && u != node){
        if(s[u] == 0){
            dfs(u, node); 
            if(l[u] > s[node]){
                cout << node << " " << u << endl;
            }
            l[node] = min(l[node], l[u]); 
        }
        else l[node] = min(l[node], s[u]); 
    }
}

void solve()
{
    int m; cin >> n >> m; 
    l.assign(n+1, 0); s.assign(n+1, 0);
    idx = 1; 
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b; 
        v[a][b] = v[b][a] = 1;
    }

    for(int i = 1; i <= n; i++) if(s[i] == 0){
        dfs(i, 0); 
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    short Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Compilation message

pipes.cpp:19:37: warning: overflow in conversion from 'double' to 'int' changes value from '1.0000000000000008e+16' to '2147483647' [-Woverflow]
   19 | const int Max = 1e4 + 7, Inf = 1e16 + 7;
      |                                ~~~~~^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7004 KB Output is correct
2 Incorrect 14 ms 6748 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 7068 KB Output is correct
2 Correct 65 ms 4764 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 13028 KB Output is correct
2 Correct 161 ms 12116 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1628 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1884 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 2140 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2140 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1880 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -