Submission #994210

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)


#define N 1000
struct human{
  int k;
  vector<int> l;
};

int n, m;
human hs[N];
bool can[N][N] = {false};
vector<int> ms[N];

signed main(void){
  int i, j, k;
  for(int testcase = 0;testcase >= 0;testcase++){
    scanf("%d %d", &n, &m);
    if(n > 1024)return 0;
    rep(i, n){
      can[i][i] = true;
      scanf("%d", &hs[i].k);
      hs[i].l.resize(hs[i].k);
      rep(j, hs[i].k){
        scanf("%d", &hs[i].l[j]);
        hs[i].l[j]--;
        ms[hs[i].l[j]].pb(i);
      }
    }

    //ms[i]内はOK
    rep(i, m){
      rep(j, ms[i].size())rep(k, ms[i].size())can[ms[i][j]][ms[i][k]] = true;
    }

    bool is = true;
    /*rep(i, n)rep(j, n){
      is = is & can[i][j];
      if(!can[i][j])pri2(i, j);
    }
    kabe;*/

    //参加者iが通訳
    int x, y, z;
    rep(i, n)rep(j, hs[i].l.size())rep(k, hs[i].l.size())if(j != k){

      rep(x, ms[hs[i].l[j]].size())rep(y, ms[hs[i].l[k]].size())
      if(!can[ms[ hs[i].l[j] ][x] ][ ms[ hs[i].l[k] ][y] ]){
        //pri2(ms[ hs[i].l[j] ][k], ms[ hs[i].l[j] ][x]);
        can[ms[ hs[i].l[j] ][x]][ms[ hs[i].l[k] ][y]] = true;
      }
    }

    //bool is = true;
    rep(i, n)rep(j, n){
      is = is & can[i][j];
      //if(!can[i][j])pri2(i, j);
    }
    puts(is ? "YES" : "NO");




/*/

//*/ break;
  }
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:64:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
                           ^
./Main.cpp:68:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &hs[i].k);
                            ^
./Main.cpp:71:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &hs[i].l[j]);
                                 ^

Judge Result