Submission #584458

#	Time	Username	Problem	Language	Result	Execution time	Memory
584458		TimDee	Connecting Supertrees (IOI20_supertrees)	C++14	46 / 100	191 ms	22568 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for (int i=0; i<n; ++i)
#define all(a) a.begin(), a.end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define pi pair<int,int>
#define f first
#define s second

int mirror(vector<vector<int>>&a) {
  int n=a.size();
  for (int i=0; i<n; ++i) {
    for (int j=i+1; j<n; ++j) {
      if (a[i][j]!=a[j][i]) return 0;
    }
  }
  forn(i,n) if (a[i][i]!=1) return 0;
  return 1;
}

int bfs(vector<vector<int>>&p, vector<int>&vis, int v, vector<pair<int,int>>&edges) {

  vector<int> one, two;
  vector<int> cycle;

  int n=p.size();

  forn(i,n) {
    if (i==v) continue;
    if (p[v][i]==1) one.pb(i);
    else if (p[v][i]==2) two.pb(i);
  }

  forn(i,one.size()) vis[one[i]]=10;
  forn(i,two.size()) vis[two[i]]=10;
  vis[v]=10;

  forn(i,one.size()) {
    forn(j,one.size()) {
      if (i==j) continue;
      if (p[one[i]][one[j]]!=1) return 0;
    }
  }
  forn(i,one.size()) edges.pb(mp(v,one[i]));

  //forn(i,one.size()) vis[one[i]]=1;
  //forn(i,two.size()) vis[two[i]]=1;
  //vis[v]=1;
 
  if (!two.size()) {
    return 1;
  } else if (two.size()==1) return 0;
  else {
    forn(i,one.size()) {
      forn(j,two.size()) {
        if (p[one[i]][two[j]]!=2) return 0;
      }
    }
    cycle={v};
    forn(i,two.size()) {
      int foo=1;
      forn(j,cycle.size()) {
        if (p[two[i]][cycle[j]]==2) continue;
        else {foo=0; break;}
      }
      if (foo) cycle.pb(two[i]);
    }
  }

  queue<int> q;
  forn(i,cycle.size()) {
    if (cycle[i]!=v) q.push(cycle[i]);
  }

  while (!q.empty()) {
 
    int v=q.front(); q.pop();
    
    vector<int> one, two;

    forn(i,n) {
      if (i==v) continue;
      if (p[v][i]==1) one.pb(i);
      else if (p[v][i]==2) two.pb(i);
    }

    forn(i,one.size()) {
      forn(j,one.size()) {
        if (i==j) continue;
        if (p[one[i]][one[j]]!=1) return 0;
      }
    }
    forn(i,one.size()) edges.pb(mp(v,one[i]));

    forn(i,one.size()) if (vis[one[i]]!=10) return 0;
    forn(i,two.size()) if (vis[two[i]]!=10) return 0;
    if (vis[v]!=10) return 0;
 
    if (!two.size()) {
      continue;
    } else if (two.size()==1) return 0;
    else {
      forn(i,one.size()) {
        forn(j,two.size()) {
          if (p[one[i]][two[j]]!=2) return 0;
        }
      }
    }
  
  }

  if (cycle.size()<=2) return 0;

  forn(i,cycle.size()) {
    edges.pb(mp(cycle[i],cycle[(i+1)%cycle.size()]));
  }

  forn(i,one.size()) vis[one[i]]=1;
  forn(i,two.size()) vis[two[i]]=1;
  vis[v]=1;

  return 1;

}

int construct(std::vector<std::vector<int>> p) {
  int n = p.size();
  
  vector<vector<int>> a(n); 
  forn(i,n) a[i].assign(n,0);
 
  if (!mirror(p)) return 0;
 
  queue<int> q;
  q.push(0);
 
  vector<pair<int,int>> edges;
  vector<int> vis(n,0);
 
  forn(i,n) {
    if (vis[i]) continue;
    int x=bfs(p,vis,i,edges);
    if (x==0) return 0;
  }
 
  for (auto E:edges) {
    int u=E.f, v=E.s;
    a[u][v]=1;
    a[v][u]=1;
  }
 
  build(a);
  return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int bfs(std::vector<std::vector<int> >&, std::vector<int>&, int, std::vector<std::pair<int, int> >&)':
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   36 |   forn(i,one.size()) vis[one[i]]=10;
      |        ~~~~~~~~~~~~               
supertrees.cpp:36:3: note: in expansion of macro 'forn'
   36 |   forn(i,one.size()) vis[one[i]]=10;
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   37 |   forn(i,two.size()) vis[two[i]]=10;
      |        ~~~~~~~~~~~~               
supertrees.cpp:37:3: note: in expansion of macro 'forn'
   37 |   forn(i,two.size()) vis[two[i]]=10;
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   40 |   forn(i,one.size()) {
      |        ~~~~~~~~~~~~               
supertrees.cpp:40:3: note: in expansion of macro 'forn'
   40 |   forn(i,one.size()) {
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   41 |     forn(j,one.size()) {
      |          ~~~~~~~~~~~~             
supertrees.cpp:41:5: note: in expansion of macro 'forn'
   41 |     forn(j,one.size()) {
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   46 |   forn(i,one.size()) edges.pb(mp(v,one[i]));
      |        ~~~~~~~~~~~~               
supertrees.cpp:46:3: note: in expansion of macro 'forn'
   46 |   forn(i,one.size()) edges.pb(mp(v,one[i]));
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   56 |     forn(i,one.size()) {
      |          ~~~~~~~~~~~~             
supertrees.cpp:56:5: note: in expansion of macro 'forn'
   56 |     forn(i,one.size()) {
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   57 |       forn(j,two.size()) {
      |            ~~~~~~~~~~~~           
supertrees.cpp:57:7: note: in expansion of macro 'forn'
   57 |       forn(j,two.size()) {
      |       ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   62 |     forn(i,two.size()) {
      |          ~~~~~~~~~~~~             
supertrees.cpp:62:5: note: in expansion of macro 'forn'
   62 |     forn(i,two.size()) {
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   64 |       forn(j,cycle.size()) {
      |            ~~~~~~~~~~~~~~         
supertrees.cpp:64:7: note: in expansion of macro 'forn'
   64 |       forn(j,cycle.size()) {
      |       ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   73 |   forn(i,cycle.size()) {
      |        ~~~~~~~~~~~~~~             
supertrees.cpp:73:3: note: in expansion of macro 'forn'
   73 |   forn(i,cycle.size()) {
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   89 |     forn(i,one.size()) {
      |          ~~~~~~~~~~~~             
supertrees.cpp:89:5: note: in expansion of macro 'forn'
   89 |     forn(i,one.size()) {
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   90 |       forn(j,one.size()) {
      |            ~~~~~~~~~~~~           
supertrees.cpp:90:7: note: in expansion of macro 'forn'
   90 |       forn(j,one.size()) {
      |       ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   95 |     forn(i,one.size()) edges.pb(mp(v,one[i]));
      |          ~~~~~~~~~~~~             
supertrees.cpp:95:5: note: in expansion of macro 'forn'
   95 |     forn(i,one.size()) edges.pb(mp(v,one[i]));
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   97 |     forn(i,one.size()) if (vis[one[i]]!=10) return 0;
      |          ~~~~~~~~~~~~             
supertrees.cpp:97:5: note: in expansion of macro 'forn'
   97 |     forn(i,one.size()) if (vis[one[i]]!=10) return 0;
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
   98 |     forn(i,two.size()) if (vis[two[i]]!=10) return 0;
      |          ~~~~~~~~~~~~             
supertrees.cpp:98:5: note: in expansion of macro 'forn'
   98 |     forn(i,two.size()) if (vis[two[i]]!=10) return 0;
      |     ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
  105 |       forn(i,one.size()) {
      |            ~~~~~~~~~~~~           
supertrees.cpp:105:7: note: in expansion of macro 'forn'
  105 |       forn(i,one.size()) {
      |       ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
  106 |         forn(j,two.size()) {
      |              ~~~~~~~~~~~~         
supertrees.cpp:106:9: note: in expansion of macro 'forn'
  106 |         forn(j,two.size()) {
      |         ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
  116 |   forn(i,cycle.size()) {
      |        ~~~~~~~~~~~~~~             
supertrees.cpp:116:3: note: in expansion of macro 'forn'
  116 |   forn(i,cycle.size()) {
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
  120 |   forn(i,one.size()) vis[one[i]]=1;
      |        ~~~~~~~~~~~~               
supertrees.cpp:120:3: note: in expansion of macro 'forn'
  120 |   forn(i,one.size()) vis[one[i]]=1;
      |   ^~~~
supertrees.cpp:4:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forn(i,n) for (int i=0; i<n; ++i)
......
  121 |   forn(i,two.size()) vis[two[i]]=1;
      |        ~~~~~~~~~~~~               
supertrees.cpp:121:3: note: in expansion of macro 'forn'
  121 |   forn(i,two.size()) vis[two[i]]=1;
      |   ^~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 35 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4