結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | blackyuki |
提出日時 | 2021-08-13 21:43:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 144 ms / 2,500 ms |
コード長 | 3,433 bytes |
コンパイル時間 | 2,589 ms |
コンパイル使用メモリ | 212,892 KB |
実行使用メモリ | 38,220 KB |
最終ジャッジ日時 | 2023-08-03 05:33:08 |
合計ジャッジ時間 | 11,449 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 3 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 3 ms
4,384 KB |
testcase_08 | AC | 135 ms
34,432 KB |
testcase_09 | AC | 121 ms
30,216 KB |
testcase_10 | AC | 126 ms
34,680 KB |
testcase_11 | AC | 98 ms
23,148 KB |
testcase_12 | AC | 102 ms
21,616 KB |
testcase_13 | AC | 103 ms
24,536 KB |
testcase_14 | AC | 137 ms
35,476 KB |
testcase_15 | AC | 123 ms
35,124 KB |
testcase_16 | AC | 116 ms
33,064 KB |
testcase_17 | AC | 98 ms
25,344 KB |
testcase_18 | AC | 97 ms
23,152 KB |
testcase_19 | AC | 124 ms
34,392 KB |
testcase_20 | AC | 122 ms
30,300 KB |
testcase_21 | AC | 133 ms
35,252 KB |
testcase_22 | AC | 138 ms
36,004 KB |
testcase_23 | AC | 139 ms
36,568 KB |
testcase_24 | AC | 128 ms
31,032 KB |
testcase_25 | AC | 132 ms
33,420 KB |
testcase_26 | AC | 140 ms
36,652 KB |
testcase_27 | AC | 137 ms
37,028 KB |
testcase_28 | AC | 137 ms
38,012 KB |
testcase_29 | AC | 141 ms
38,012 KB |
testcase_30 | AC | 137 ms
34,788 KB |
testcase_31 | AC | 144 ms
38,016 KB |
testcase_32 | AC | 137 ms
37,100 KB |
testcase_33 | AC | 133 ms
31,880 KB |
testcase_34 | AC | 143 ms
38,220 KB |
testcase_35 | AC | 138 ms
33,060 KB |
testcase_36 | AC | 142 ms
38,104 KB |
testcase_37 | AC | 140 ms
38,028 KB |
testcase_38 | AC | 121 ms
28,384 KB |
testcase_39 | AC | 118 ms
24,040 KB |
testcase_40 | AC | 124 ms
27,784 KB |
testcase_41 | AC | 111 ms
24,556 KB |
testcase_42 | AC | 122 ms
28,096 KB |
testcase_43 | AC | 2 ms
4,384 KB |
testcase_44 | AC | 4 ms
7,640 KB |
testcase_45 | AC | 89 ms
14,608 KB |
testcase_46 | AC | 107 ms
16,772 KB |
testcase_47 | AC | 90 ms
14,504 KB |
testcase_48 | AC | 96 ms
15,020 KB |
testcase_49 | AC | 92 ms
14,528 KB |
testcase_50 | AC | 85 ms
14,716 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(long long i=0;i<(long long)(n);i++) #define REP(i,k,n) for(long long i=k;i<(long long)(n);i++) #define pb emplace_back #define lb(v,k) (lower_bound(all(v),(k))-v.begin()) #define ub(v,k) (upper_bound(all(v),(k))-v.begin()) #define fi first #define se second #define pi M_PI #define PQ(T) priority_queue<T> #define SPQ(T) priority_queue<T,vector<T>,greater<T>> #define dame(a) {out(a);return 0;} #define decimal cout<<fixed<<setprecision(15); #define all(a) a.begin(),a.end() #define rsort(a) {sort(all(a));reverse(all(a));} #define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());} #define popcnt __builtin_popcountll typedef long long ll; typedef pair<ll,ll> P; typedef tuple<ll,ll,ll> PP; typedef tuple<ll,ll,ll,ll> PPP; using vi=vector<ll>; using vvi=vector<vi>; using vvvi=vector<vvi>; using vvvvi=vector<vvvi>; using vp=vector<P>; using vvp=vector<vp>; using vb=vector<bool>; using vvb=vector<vb>; const ll inf=1001001001001001001; const ll INF=1001001001; const ll mod=998244353; const double eps=1e-10; template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;} template<class T> void out(T a){cout<<a<<'\n';} template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';} template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';} template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);} template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';} template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);} template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);} template<class T> void yesno(T b){if(b)out("yes");else out("no");} template<class T> void YesNo(T b){if(b)out("Yes");else out("No");} template<class T> void YESNO(T b){if(b)out("YES");else out("NO");} template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';} void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);} ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);} ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;} int main(){ ll h,w,n;cin>>h>>w>>n; vvp g(h+w); vp v(n); rep(i,n){ ll x,y;cin>>x>>y; x--;y--; g[x].pb(y+h,i+1); g[y+h].pb(x,i+1); v[i]=P(x,y); } vp tmp; bool done=false; vb seen(h+w,false); function<void(ll,ll)> dfs=[&](ll i,ll p){ seen[i]=true; if(done)return; for(P x:g[i])if(x.fi!=p){ if(done)break; if(seen[x.fi]){ vi ans; ans.pb(x.se); while(tmp.back().fi!=x.fi){ ans.pb(tmp.back().se);tmp.pop_back(); } if(v[ans[0]-1].se!=v[ans[1]-1].se){ ll t=ans[0]; ans.erase(ans.begin()); ans.pb(t); } out(ans.size());outv(ans); done=true; break; } tmp.pb(x); dfs(x.fi,i); tmp.pop_back(); } }; rep(i,h+w){ if(done)break; if(!seen[i]){ tmp.pb(i,-1); dfs(i,-1); } } if(!done)out(-1); }