제출 #95852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95852		Kastanda	Potemkin cycle (CEOI15_indcyc)	C++11	70 / 100	1069 ms	1404 KiB

indcyc

#include<bits/stdc++.h>
using namespace std;
const int N = 1009;
int n, m, qu[N], P[N];
bitset < N > M, S, is[N];
vector < int > Adj[N];
inline void Prnt(int fxd, int v, int u)
{
    M = S = 0;
    memset(P, 0, sizeof(P));
    for (int &w : Adj[fxd])
        M[w] = 1;
    int l = 0, r = 0;
    qu[r ++] = v;
    S[v] = 1;
    while (r - l)
    {
        int nw = qu[l ++];
        for (int &w : Adj[nw])
            if (w != fxd && !S[w] && !(M[nw] && M[w]))
            {
                S[w] = 1;
                P[w] = nw;
                if (!M[w])
                    qu[r ++] = w;
            }
    }
    if (P[u] == 0)
        return ;
    vector < int > A;
    A.push_back(fxd);
    for (; u; u = P[u])
        A.push_back(u);
    for (int i = 0; i < (int)A.size(); i++)
        for (int j = i + 2; j < (int)A.size(); j++)
            if ((i != 0 || j != (int)A.size() - 1) && is[A[i]][A[j]])
                assert(0);
    for (int a : A)
        printf("%d ", a);
    printf("\n");
    exit(0);
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        int v, u;
        scanf("%d%d", &v, &u);
        Adj[v].push_back(u);
        Adj[u].push_back(v);
        is[v][u] = is[u][v] = 1;
    }
    for (int fxd = 1; fxd <= n; fxd ++)
        for (int v : Adj[fxd])
            for (int u : Adj[fxd])
                if (v < u && !is[v][u])
                    Prnt(fxd, v, u);
    return !printf("no\n");
}

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

indcyc.cpp: In function 'int main()':
indcyc.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
indcyc.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &v, &u);
         ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10