CODE FESTIVAL 2016 Final

Submission #1757078

Source codeソースコード

#include<iostream>
#include<queue>
#include<vector>
#include<utility>
using namespace std;

int verts[200000];
bool visited[200000];
vector<int> edges[200002];
int V = 0;
int k[100000];


void addEdge(int f,int t){
  edges[f].push_back(t);
}

void deleteBFS(){
  queue<int> q;
  int f,t,ind;
  q.push(0);
  while(!q.empty()){
    cout << "--" << endl;
    f = q.front();
    cout << f << endl;
    q.pop();
    if (visited[f] == true){
      continue;
    }
    visited[f] = true;
    for (int i=0; i< edges[f].size(); i++){
      t = edges[f][i];
      cout << t << endl;
      if (visited[t] == false){
        q.push(t);
      }
    } 
  }
}

int main(){
  int n,m;
  int l;
  cin >> n >> m;
  for (int i=0; i<n; i++){
    cin >> k[i];
    for(int j=0; j<k[i]; j++){
      cin >> l;
      l = l+n-1;
      addEdge(i,l);
      addEdge(l,i);
    }
  }
  for (int i=0;i<n+m;i++){
    visited[i] = false;
  }
  deleteBFS();
  for(int i=0; i<n; i++){
    if (visited[i] == false){
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}

Submission

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

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
dataset1 0 / 200 sample-01.txt,sample-02.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt
dataset2 0 / 200 sample-01.txt,sample-02.txt,01-01.txt,01-02.txt,01-03.txt,01-04.txt,01-05.txt,01-06.txt,01-07.txt,01-08.txt,01-09.txt,01-10.txt,02-01.txt,02-02.txt,02-03.txt,02-04.txt,02-05.txt,02-06.txt,02-07.txt,02-08.txt,02-09.txt,02-10.txt,02-11.txt,02-12.txt,02-13.txt,sample-01.txt,sample-02.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt WA
01-02.txt WA
01-03.txt WA
01-04.txt WA
01-05.txt WA
01-06.txt WA
01-07.txt WA
01-08.txt WA
01-09.txt WA
01-10.txt WA
02-01.txt WA
02-02.txt WA
02-03.txt WA
02-04.txt WA
02-05.txt WA
02-06.txt WA
02-07.txt WA
02-08.txt WA
02-09.txt WA
02-10.txt WA
02-11.txt WA
02-12.txt WA
02-13.txt WA
sample-01.txt WA
sample-02.txt WA