結果

問題 No.1711 Divide LCM
ユーザー 👑 tute7627tute7627
提出日時 2021-10-15 23:41:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 9,140 bytes
コンパイル時間 3,436 ms
コンパイル使用メモリ 255,712 KB
実行使用メモリ 131,036 KB
最終ジャッジ日時 2024-09-17 18:45:31
合計ジャッジ時間 13,779 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
30,556 KB
testcase_01 AC 13 ms
30,588 KB
testcase_02 AC 13 ms
30,532 KB
testcase_03 AC 15 ms
30,840 KB
testcase_04 AC 39 ms
31,832 KB
testcase_05 AC 192 ms
36,664 KB
testcase_06 AC 58 ms
32,136 KB
testcase_07 AC 205 ms
35,560 KB
testcase_08 AC 47 ms
32,356 KB
testcase_09 AC 350 ms
41,584 KB
testcase_10 AC 58 ms
32,488 KB
testcase_11 AC 643 ms
47,692 KB
testcase_12 AC 53 ms
32,480 KB
testcase_13 AC 14 ms
30,600 KB
testcase_14 AC 23 ms
31,320 KB
testcase_15 AC 37 ms
31,496 KB
testcase_16 AC 16 ms
30,784 KB
testcase_17 AC 23 ms
31,156 KB
testcase_18 AC 88 ms
39,696 KB
testcase_19 AC 91 ms
39,824 KB
testcase_20 AC 90 ms
39,700 KB
testcase_21 AC 105 ms
40,120 KB
testcase_22 AC 211 ms
96,424 KB
testcase_23 AC 342 ms
131,036 KB
testcase_24 TLE -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  ll sz=1000005;
  vector<vector<int>>v(sz);
  vector<int>mx(sz);
  vector<int>a(n,1);
  rep(i,0,n){
    ll m;cin>>m;
    rep(_,0,m){
      ll p,e;cin>>p>>e;
      if(chmax(mx[p],e)){
        v[p]={(int)i};
      }
      else if(mx[p]==e){
        v[p].PB(i);
      }
      rep(_,0,e)a[i]*=p;
    }
  }
  auto merge=[&](vector<int>x,vector<int>y){
    vector<int>ret(x.size()+y.size(),-1);
    set_intersection(ALL(x),ALL(y),ret.begin());
    while(ret.back()==-1)ret.pop_back();
    return ret;
  };
  vector<int>p;
  vector<int>tmp(n);
  iota(ALL(tmp),0);
  vector<pair<int,int>>erp;
  set<int>er;
  rep(i,0,sz){
    if(!v[i].empty()){
      p.EB(i);
      erp.EB(v[i].size(),i);
      sort(ALL(v[i]));
      tmp=merge(tmp,v[i]);
    }
  }
  
  if(!tmp.empty()){
    cout<<-1<<endl;
    return 0;
  }
  {
    sort(ALL(erp));
    rep(j,max(0,(int)erp.size()-3),erp.size()){
      rep(i,0,min<int>(3,erp.size())){
        if(i>=j||er.count(i))continue;
        if(merge(v[erp[i].se],v[erp[j].se])==v[erp[i].se]){
          er.insert(j);
          break;
        }
      }
    }
    vector<int>np;
    for(auto z:p){
      if(!er.count(z))np.PB(z);
    }
    p.swap(np);
  }
  map<vector<int>,pair<vector<int>,int>>from;
  queue<vector<int>>que;
  for(auto z:p){
    from[v[z]]=MP(v[z],-1);
    que.push(v[z]);
  }
  while(!que.empty()){
    auto tv=poll(que);
    for(auto z:p){
      vector<int>nv=merge(tv,v[z]);
      if(nv.empty()){
        vector<vector<int>>ret;
        vector<vector<int>>vst;
        vst.PB(v[z]);
        while(1){
          if(from[tv].se==-1)vst.PB(from[tv].fi);
          else vst.PB(v[from[tv].se]);
          if(from[tv].se==-1)break;
          tv=from[tv].fi;
        }
        set<int>st;
        rep(i,0,vst.size()){
          //cout<<i<<":";debug(vst[i]);
          ret.EB();
          rep(j,0,n){
            if(!binary_search(ALL(vst[i]),j)&&!st.count(j)){
              st.insert(j);
              ret.back().EB(a[j]);
            }
          }
        }
        cout<<ret.size()<<endl;
        for(auto zz:ret){
          cout<<zz.size()<<" ";
          debug(zz);
        }
        return 0;
      }
      if(!from.count(nv)){
        from[nv]=MP(tv,z);
        que.push(nv);
      }
    }
  }
  return 0;
}
0