CODE FESTIVAL 2016 Final

Submission #992601

Source codeソースコード

#include <cstdio>
#include <climits>
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <tuple>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
typedef pair<ll,ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;

struct uf {
  VI par;
  uf(int n) : par(n) {
    REP(i,0,n) {
      par[i] = i;
    }
  }
  int find(int x) {
    if(par[x] == x) return x;
    return par[x] = find(par[x]);
  }
  void unite(int x, int y) {
    par[find(x)] = find(y);
  }
  bool same(int x, int y) {
    return find(x) == find(y);
  }
};

int main() {
  int N, M;
  cin >> N >> M;
  uf u(M+1);
  vector<VI> peo(N);
  int mink = 1e6;
  int minkp = -1;
  REP(i,0,N) {
    int K;
    cin >> K;
    if(K < mink) {
      mink = K;
      minkp = i;
    }
    int l1 = 0;
    REP(j,0,K) {
      int l;
      cin >> l;
      peo[i].push_back(l);
      if(l1) {
        u.unite(l1,l);
      } else {
        l1 = l;
      }
    }
  }
  bool pos = true;
  REP(i,0,N) {
    if(i == minkp) continue;
    bool posi = false;
    for(const auto &l1 : peo[minkp]) {
      for(const auto &l2 : peo[i]) {
        if(u.same(l1, l2)) {
          posi = true;
        }
      }
    }
    if(!posi) {
      pos = false;
      break;
    }
  }
  cout << (pos ? "YES\n" : "NO\n");

  return 0;
}

Submission

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

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
dataset1 200 / 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 200 / 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 2 ms 256 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 3 ms 256 KB
01-07.txt AC 3 ms 256 KB
01-08.txt AC 3 ms 256 KB
01-09.txt AC 3 ms 256 KB
01-10.txt AC 3 ms 256 KB
02-01.txt AC 41 ms 1408 KB
02-02.txt AC 49 ms 5504 KB
02-03.txt AC 40 ms 1408 KB
02-04.txt AC 51 ms 3712 KB
02-05.txt AC 50 ms 4608 KB
02-06.txt AC 49 ms 3712 KB
02-07.txt AC 51 ms 5248 KB
02-08.txt AC 43 ms 5760 KB
02-09.txt AC 57 ms 6144 KB
02-10.txt AC 44 ms 3840 KB
02-11.txt AC 43 ms 3324 KB
02-12.txt AC 43 ms 3456 KB
02-13.txt AC 42 ms 3456 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 3 ms 256 KB