AtCoder Beginner Contest 002

Submission #1591746

Source codeソースコード

#include <stdio.h>

int N,M;
bool d[12][12];
int x,y;
int ans=0;
int tmp;
bool ok;
int main(){
  scanf("%d %d",&N, &M);

  for(int i=0;i<M;i++){
    scanf("%d %d",&x,&y);
    d[x-1][y-1]=d[y-1][x-1]=true;
  }
  for(int S=0;S < 1<<N;S++){
    ok=true;
    tmp=0;
    for(int i=0;i<N;i++){
      if(S>>i&1){
        tmp++;
      }else{
        continue;
      }
      for(int j=i+1;j<N;j++){
        if(S>>j&1 && !d[i][j]){
          ok=false;
        }
      }
    }
    if(ok&&ans<tmp)
      ans=tmp;
  }
  printf("%d\n",ans );
}


/*#include <stdio.h>
#include <vector>
#include <queue>
#include <set>

using namespace std;

typedef pair<int,int> s;

vector<s> rel;
queue<int> qu;
set<int> st;

int  N,M;
int x,y;
int sum=0;
bool used[12];
int tmp=0;
int last=0;
void dfs(int c){
  if(c==N){
    sum = max(sum, st.size());
    return;
  }
  for(auto r : rel){
    if(r.first == c){
      qu.push(r.second);
    }
  }
}

int main(){
  scanf("%d %d", &N, &M);
  for(int i=0;i<M;i++){
    scanf("%d %d", &x, &y);
    rel.push_back(s(x-1,y-1));
  }
  for(int i=0;i<N;i++)used[i]=false;
  for(int i=0;i<N;i++){
    tmp=0;
    qu.push(i);
    while(!qu.empty()){
      int first = qu.front();
      qu.pop();
      if(!used[first]){
        tmp++;
        used[first]=true;
        for(auto r : rel){
          if(r.first == first){
            qu.push(r.second);
          }
        }
      }
    }
    if(sum<tmp)sum=tmp;
  }
  printf("%d\n", sum);
}
*/

Submission

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

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&N, &M);
^
./Main.cpp:13:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&x,&y);
^

Test case

Set

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