제출 #64461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64461		zubec	Parachute rings (IOI12_rings)	C++14	0 / 100	4029 ms	44772 KiB

rings

#include <bits/stdc++.h>
//#include "grader.h"
using namespace std;

const int N = 1000100;

vector<int> g[N];

int tin[N], fup[N], tim, ans, n;

bool used[N];

void dfs(int v, int p){
    tin[v] = fup[v] = ++tim;
    int children = 0;
    bool isCutpoint = 0;
    for (int i = 0; i < g[v].size(); i++){
        int to = g[v][i];
        if (to == p)
            continue;
        if (used[to]){
            fup[v] = min(fup[v], tin[to]);
        } else {
            dfs(to, v);
            ++children;
            fup[v] = min(fup[v], fup[to]);
            if (tin[v] <= fup[to] && p != -1 && !isCutpoint){
                ++ans;
                isCutpoint = 0;
            }
        }
    }
    if (p == -1 && children > 1){
        ++ans;
    }
}

void Init(int n){
    ::n = n;
    for (int i = 1; i <= n; i++)
        g[i].clear();
}



void Link(int a, int b){
    ++a;
    ++b;
    g[a].push_back(b);
    g[b].push_back(a);
}


int CountCritical(){
    for (int i = 1; i <= n; i++){
        used[i] = tin[i] = fup[i] = 0;
    }
    tim = 0;
    ans = 0;
    for (int i = 1; i <= n; i++){
        if (!used[i])
            dfs(i, 0);
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

rings.cpp: In function 'void dfs(int, int)':
rings.cpp:17:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++){
                     ~~^~~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:56:26: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
         used[i] = tin[i] = fup[i] = 0;
                   ~~~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 14
• Subtask 5: 0 / 31