oj.uz

답안 #152725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152725 2019-09-09T09:48:09 Z toloraia Pipes (CEOI15_pipes) C++17
30 / 100
 5000 ms 65536 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
//#define ll __int128
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
/*
#pragma comment(linker, "/STACK: 20000000005")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
using namespace std;

const int N = 1e5 + 5, M = 6e6 + 5;

int n, m;

ll K;

vector < ll > G[N], GG[N];
vector < int > g[N];
ll A[N], AA[N];
int B[N], BB[N];
int x, y;
int T;
int in[N], up[N];

void dfs (int k, int p){
    in[k] = ++T;
    up[k] = in[k];
    int to, i, toto;
    ll X;
    int num = (int)G[k].size();
    for (i = 0; i < num; i++){
        X = G[k][i];
        while (X){
            toto = X % K;
            X /= K;
            to = toto;
            if (to > n)
                to -= n;
            if (to == p)
                continue;
            if (in[to]){
                up[k] = min (up[k], in[to]);
                continue;
            }
            dfs (to, k);
            if (up[to] > in[k]){
                cout << k << " " << to << endl;
            }
            up[k] = min (up[k], up[to]);
        }
    }
    num = (int)GG[k].size();
    for (i = 0; i < num; i++){
        X = GG[k][i];
        while (X){
            toto = X % K;
            X /= K;
            to = toto;
            if (to > n)
                to -= n;
            if (to == p)
                continue;
            if (in[to]){
                up[k] = min (up[k], in[to]);
                continue;
            }
            dfs (to, k);
            up[k] = min (up[k], up[to]);
        }
    }
}

vector < int > V;

int t, num;
ll X;
int j;
int i, to;


main()
{
    //freopen ("in.in", "r", stdin);freopen ("out.out", "w", stdout);
    //ios_base::sync_with_stdio(false);
    cin >> n >> m;
    K = n + 1;
    for (i = 1; i <= m; i++){
        cin >> x >> y;
        if (x > y)
            swap (x, y);
        g[x].pb (y);
    }
    for (i = 1; i <= n; i++){
        sort (g[i].begin(), g[i].end());
        num = (int)g[i].size();
        for (j = 0; j < g[i].size(); j++){
            if (j && g[i][j] == g[i][j - 1])
                continue;
            to = g[i][j];
            y = to;
            x = i;
            if (j + 1 < num && g[i][j] == g[i][j + 1]){
                AA[i] = AA[i] * K + y;
                BB[i]++;
                if (BB[i] == 4){
                    BB[i] = 0;
                    GG[i].pb (AA[i]);
                    AA[i] = 0;
                }
                AA[to] = AA[to] * K + x;
                BB[to]++;
                if (BB[to] == 4){
                    BB[to] = 0;
                    GG[to].pb (AA[to]);
                    AA[to] = 0;
                }
            }
            else {
                A[i] = A[i] * K + y;
                B[i]++;
                if (B[i] == 4){
                    B[i] = 0;
                    G[i].pb (A[i]);
                    A[i] = 0;
                }
                A[to] = A[to] * K + x;
                B[to]++;
                if (B[to] == 4){
                    B[to] = 0;
                    G[to].pb (A[to]);
                    A[to] = 0;
                }
            }
        }
    }
    for (i = 1; i <= n; i++)
        if (A[i])
            G[i].pb (A[i]);
    for (i = 1; i <= n; i++)
        if (AA[i])
            GG[i].pb (AA[i]);
    for (i = 1; i <= n; i++)
        if (in[i] == 0)
            dfs (i, 0);
    return 0;
}

Compilation message

pipes.cpp:94:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
pipes.cpp: In function 'int main()':
pipes.cpp:109:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < g[i].size(); j++){
                     ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 8184 KB Output is correct
2 Correct 21 ms 7800 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 594 ms 15904 KB Output is correct
2 Correct 572 ms 13948 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1060 ms 20400 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1762 ms 29824 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2350 ms 65536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3973 ms 65536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5038 ms 65536 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5053 ms 37416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5099 ms 38000 KB Time limit exceeded
2 Halted 0 ms 0 KB -