AtCoder Beginner Contest 002

Submission #4342692

Source codeソースコード

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<string> vst;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
 
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};


struct k{
    int s,e;
};

bool asc( const k& left, const k& right ) {
    return left.s == right.s ? left.e < right.e : left.s < right.s;
}



int main(){
    int n,m;
    cin >> n >> m;
    vvi tmp(m,vi(m,0));
    REP(i,m) {
        int x,y;
        cin >> x >> y;
        tmp[x--][y--] = 1;
    }
    REP(i,m)tmp[i][i] = 1;

    int maxi=0;

    REP(i,(1 << n)){
        vi id;
        REP(j,n) if(i&(1<<j)) id.pb(j);

        bool f=true;
        REP(j,id.size()){
            REP(k,id.size()){
                if(tmp[id[j]][id[k]]==0) f=false;
            }
        }
        if(f)maxi=(maxi<(int)id.size())?(int)id.size():maxi;
    }

    cout << maxi << endl;
    
    return 0;
}

Submission

Task問題 D - 派閥
User nameユーザ名 yukitovn7
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 RE
Score得点 0
Source lengthソースコード長 1383 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
all 0 / 100 00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,test_01.txt,test_02.txt,test_03.txt,test_04.txt,test_05.txt,test_06.txt,test_07.txt,test_08.txt,test_09.txt,test_10.txt,test_11.txt,test_12.txt,test_13.txt,test_14.txt,test_15.txt,test_16.txt,test_17.txt,test_18.txt,test_19.txt,test_20.txt,test_21.txt,test_22.txt,test_23.txt,test_24.txt,test_25.txt,test_26.txt,test_27.txt,test_28.txt,test_29.txt,test_30.txt,test_31.txt,test_32.txt,test_33.txt,test_34.txt,test_35.txt,test_36.txt,test_37.txt,test_38.txt,test_39.txt,test_40.txt,test_41.txt,test_42.txt,test_43.txt,test_44.txt,test_45.txt,test_46.txt,test_47.txt,test_48.txt,test_49.txt,test_50.txt,test_51.txt,test_52.txt,test_53.txt,test_54.txt,test_55.txt,test_56.txt,test_57.txt,test_58.txt,test_59.txt,test_60.txt,test_61.txt,test_62.txt,test_63.txt,test_64.txt,test_65.txt,test_66.txt,test_67.txt,test_68.txt,test_69.txt,test_70.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt RE
00_sample_02.txt RE
00_sample_03.txt WA
00_sample_04.txt RE
test_01.txt RE
test_02.txt RE
test_03.txt RE
test_04.txt WA
test_05.txt RE
test_06.txt RE
test_07.txt RE
test_08.txt WA
test_09.txt WA
test_10.txt WA
test_11.txt WA
test_12.txt WA
test_13.txt WA
test_14.txt RE
test_15.txt WA
test_16.txt WA
test_17.txt WA
test_18.txt WA
test_19.txt WA
test_20.txt WA
test_21.txt WA
test_22.txt WA
test_23.txt WA
test_24.txt WA
test_25.txt RE
test_26.txt WA
test_27.txt WA
test_28.txt WA
test_29.txt WA
test_30.txt WA
test_31.txt WA
test_32.txt WA
test_33.txt WA
test_34.txt WA
test_35.txt WA
test_36.txt WA
test_37.txt RE
test_38.txt WA
test_39.txt WA
test_40.txt WA
test_41.txt WA
test_42.txt WA
test_43.txt WA
test_44.txt WA
test_45.txt WA
test_46.txt WA
test_47.txt WA
test_48.txt WA
test_49.txt WA
test_50.txt WA
test_51.txt WA
test_52.txt WA
test_53.txt WA
test_54.txt WA
test_55.txt WA
test_56.txt WA
test_57.txt WA
test_58.txt WA
test_59.txt WA
test_60.txt WA
test_61.txt WA
test_62.txt RE
test_63.txt WA
test_64.txt WA
test_65.txt WA
test_66.txt WA
test_67.txt WA
test_68.txt WA
test_69.txt WA
test_70.txt WA