제출 #331707

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
331707		Trys_Like_Buffalo	Potemkin cycle (CEOI15_indcyc)	C++11	30 / 100	1057 ms	4460 KiB

indcyc

#include <bits/stdc++.h>
using namespace std;
//FILE *fi=freopen("1.txt","r",stdin);
//FILE *fi=freopen("1.inp","r",stdin);
//FILE *fo=freopen("1.out","w",stdout);
const int Maxn = 1010;
int a[Maxn][Maxn];
int n,m;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i = 1;i<=m;i++)
    {
        int u,v;
        cin>>u>>v;
        a[u][v] = 1;
        a[v][u] = 1;
    }
    for(int u = 1;u<=n;u++)
    {
        for(int v = 1;v<=n;v++)
        {
            if(!a[u][v] || u == v)
                continue;
            for(int k = 1;k<=n;k++)
            {
                if(!a[v][k] || a[u][k] || k == u || k == v)
                    continue;
                for(int t = 1;t<=n;t++)
                {
                    if(!a[k][t] || a[v][t] || !a[u][t] || t == k || t == u || t == v)
                        continue;
                    cout<<u<<" "<<v<<" "<<k<<" "<<t<<"\n";
                    return 0;
                }
            }
        }
    }
    cout<<"no";
    return 0;
}

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