結果

問題 No.1647 Travel in Mitaru city 2
ユーザー 👑 tute7627tute7627
提出日時 2021-08-13 22:41:11
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 372 ms / 2,500 ms
コード長 8,632 bytes
コンパイル時間 2,852 ms
コンパイル使用メモリ 220,504 KB
実行使用メモリ 44,500 KB
最終ジャッジ日時 2024-04-21 04:55:15
合計ジャッジ時間 19,388 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,948 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 4 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 3 ms
6,940 KB
testcase_07 AC 5 ms
6,944 KB
testcase_08 AC 330 ms
41,148 KB
testcase_09 AC 298 ms
37,976 KB
testcase_10 AC 354 ms
41,584 KB
testcase_11 AC 267 ms
32,556 KB
testcase_12 AC 285 ms
32,204 KB
testcase_13 AC 270 ms
34,012 KB
testcase_14 AC 340 ms
42,416 KB
testcase_15 AC 336 ms
42,056 KB
testcase_16 AC 303 ms
39,616 KB
testcase_17 AC 248 ms
34,084 KB
testcase_18 AC 282 ms
33,728 KB
testcase_19 AC 293 ms
41,356 KB
testcase_20 AC 293 ms
38,580 KB
testcase_21 AC 307 ms
42,260 KB
testcase_22 AC 346 ms
43,124 KB
testcase_23 AC 336 ms
43,360 KB
testcase_24 AC 301 ms
39,420 KB
testcase_25 AC 326 ms
41,072 KB
testcase_26 AC 347 ms
43,360 KB
testcase_27 AC 355 ms
43,632 KB
testcase_28 AC 362 ms
44,492 KB
testcase_29 AC 372 ms
44,364 KB
testcase_30 AC 341 ms
42,048 KB
testcase_31 AC 368 ms
44,356 KB
testcase_32 AC 317 ms
43,552 KB
testcase_33 AC 319 ms
39,708 KB
testcase_34 AC 365 ms
44,484 KB
testcase_35 AC 339 ms
40,672 KB
testcase_36 AC 363 ms
44,360 KB
testcase_37 AC 364 ms
44,500 KB
testcase_38 AC 312 ms
37,400 KB
testcase_39 AC 277 ms
34,396 KB
testcase_40 AC 318 ms
36,984 KB
testcase_41 AC 290 ms
34,440 KB
testcase_42 AC 307 ms
37,216 KB
testcase_43 AC 2 ms
6,944 KB
testcase_44 AC 6 ms
7,840 KB
testcase_45 AC 254 ms
27,364 KB
testcase_46 AC 289 ms
26,880 KB
testcase_47 AC 268 ms
27,368 KB
testcase_48 AC 327 ms
27,408 KB
testcase_49 AC 262 ms
27,364 KB
testcase_50 AC 270 ms
27,568 KB
権限があれば一括ダウンロードができます

ソースコード

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){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){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;}
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;};
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;
}
//無向オイラーパス:次数が奇数の頂点が2個
//無向オイラー閉路:全ての頂点の次数が偶数
//有向オイラーパス:入次数-出次数が1と-1が一個ずつ、他は0
//有向オイラー閉路:全ての頂点で入次数=出次数
//↑の条件を確認すること(作れないのに作ってしまう場合がある)
template<typename T>
vector<edge<T>> euler_path(int s,Graph<T>&g, int edge_num){
  vector<bool>used(edge_num);
  vector<int>idx(g.size());
  vector<edge<T>>ret;
  stack<edge<T>>st;
  int now=s;
  while(1){
    while(idx[now]<g[now].size()&&used[g[now][idx[now]].id])idx[now]++;
    if(idx[now]==g[now].size()){
      if(st.empty())break;
      ret.push_back(st.top());
      st.pop();
      if(st.empty())now=s;
      else now=st.top().to;
    }
    else{
      st.push(g[now][idx[now]]);
      used[g[now][idx[now]].id]=true;
      now=g[now][idx[now]].to;
    }
  }
  reverse(ret.begin(),ret.end());
  if(ret.size()==edge_num)return ret;
  else return vector<edge<T>>();
}
template<typename T>
vector<int>cycle_detection(const Graph<T>&g){
  int n=g.size();
  vector<int>ret;
  vector<int>v;
  vector<bool>used(n),now(n);
  auto dfs=[&](auto &&self,int pos,int par)->void{
    used[pos]=true;
    now[pos]=true;
    v.push_back(pos);
    for(auto to:g[pos]){
      if(!ret.empty())return;
      if(now[to]&&to!=par){
        for(auto z:v){
          if(!ret.empty()||z==to)ret.push_back(z);
        }
      }
      if(used[to])continue;
      self(self,to, pos);
    }
    now[pos]=false;
    v.pop_back();
  };
  for(int i=0;i<n;i++)if(!used[i])dfs(dfs,i,-1);
  return ret;
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll h,w,n;cin>>h>>w>>n;
  Graph<ll>g(h+w);
  map<P,ll>mp;
  rep(i,0,n){
    ll x,y;cin>>x>>y;x--;y--;
    g[x].EB(h+y,0,i);
    g[h+y].EB(x,0,i);
    mp[MP(x,h+y)]=i;
    mp[MP(h+y,x)]=i;
  }
  auto c=cycle_detection(g);
  if(c.empty()){
    cout<<-1<<endl;
    return 0;
  }
  //debug(c);
  if(c[0]>=h)rotate(c.begin(),c.begin()+1,c.end());
  vector<ll>ret;
  rep(i,0,c.size()){
    ret.EB(mp[MP(c[i],c[(i+1)%c.size()])]);
  }
  cout<<ret.size()<<endl;
  for(auto &r:ret)r++;
  debug(ret);
  return 0;
}
0