oj.uz

Submission #1055418

# Submission time Handle Problem Language Result Execution time Memory
1055418 2024-08-12T19:02:52 Z vjudge1 Pipes (CEOI15_pipes) C++17
20 / 100
 1377 ms 65536 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 = 1e6 + 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;
}

vector <vector<short>> v; 
vector <int> l, s; int idx;

void dfs(int node, int parent)
{  
    l[node] = s[node] = idx; idx++; 
    for(auto& u : v[node]) if(u != parent)
    {
        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 n, m; cin >> n >> m; 
    v.assign(n+1, vector <short> ()); 
    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].pb(b); v[b].pb(a); 
    }

    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);

    int 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 = 1e6 + 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 2 ms 860 KB Output is correct
2 Incorrect 2 ms 604 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 55 ms 4824 KB Output is correct
2 Correct 55 ms 4180 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 6904 KB Output is correct
2 Correct 116 ms 8788 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 13648 KB Output is correct
2 Runtime error 153 ms 25832 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 250 ms 28756 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 375 ms 50680 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 564 ms 65536 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 758 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1377 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -