結果
問題 | No.1640 簡単な色塗り |
ユーザー | 👑 PCTprobability |
提出日時 | 2021-08-06 22:08:11 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 564 ms / 2,000 ms |
コード長 | 5,371 bytes |
コンパイル時間 | 7,846 ms |
コンパイル使用メモリ | 319,020 KB |
実行使用メモリ | 95,424 KB |
最終ジャッジ日時 | 2023-09-12 02:08:58 |
合計ジャッジ時間 | 29,381 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
10,492 KB |
testcase_01 | AC | 6 ms
10,544 KB |
testcase_02 | AC | 7 ms
10,472 KB |
testcase_03 | AC | 6 ms
10,528 KB |
testcase_04 | AC | 239 ms
95,392 KB |
testcase_05 | AC | 261 ms
95,420 KB |
testcase_06 | AC | 6 ms
10,476 KB |
testcase_07 | AC | 6 ms
10,472 KB |
testcase_08 | AC | 6 ms
10,660 KB |
testcase_09 | AC | 6 ms
10,480 KB |
testcase_10 | AC | 304 ms
60,200 KB |
testcase_11 | AC | 243 ms
51,344 KB |
testcase_12 | AC | 215 ms
46,584 KB |
testcase_13 | AC | 553 ms
86,652 KB |
testcase_14 | AC | 540 ms
86,080 KB |
testcase_15 | AC | 139 ms
36,720 KB |
testcase_16 | AC | 189 ms
42,392 KB |
testcase_17 | AC | 417 ms
73,396 KB |
testcase_18 | AC | 27 ms
16,232 KB |
testcase_19 | AC | 199 ms
46,320 KB |
testcase_20 | AC | 281 ms
58,672 KB |
testcase_21 | AC | 216 ms
49,880 KB |
testcase_22 | AC | 18 ms
14,628 KB |
testcase_23 | AC | 298 ms
62,708 KB |
testcase_24 | AC | 68 ms
24,840 KB |
testcase_25 | AC | 200 ms
46,792 KB |
testcase_26 | AC | 351 ms
67,864 KB |
testcase_27 | AC | 124 ms
35,200 KB |
testcase_28 | AC | 501 ms
82,644 KB |
testcase_29 | AC | 366 ms
67,080 KB |
testcase_30 | AC | 37 ms
23,256 KB |
testcase_31 | AC | 307 ms
93,048 KB |
testcase_32 | AC | 267 ms
82,504 KB |
testcase_33 | AC | 163 ms
59,528 KB |
testcase_34 | AC | 210 ms
71,668 KB |
testcase_35 | AC | 167 ms
59,416 KB |
testcase_36 | AC | 35 ms
23,036 KB |
testcase_37 | AC | 49 ms
27,600 KB |
testcase_38 | AC | 264 ms
85,544 KB |
testcase_39 | AC | 99 ms
42,620 KB |
testcase_40 | AC | 104 ms
43,436 KB |
testcase_41 | AC | 212 ms
73,332 KB |
testcase_42 | AC | 115 ms
48,180 KB |
testcase_43 | AC | 119 ms
49,204 KB |
testcase_44 | AC | 118 ms
48,336 KB |
testcase_45 | AC | 86 ms
39,188 KB |
testcase_46 | AC | 40 ms
24,232 KB |
testcase_47 | AC | 24 ms
19,508 KB |
testcase_48 | AC | 273 ms
87,244 KB |
testcase_49 | AC | 14 ms
14,420 KB |
testcase_50 | AC | 6 ms
10,496 KB |
testcase_51 | AC | 7 ms
10,480 KB |
testcase_52 | AC | 562 ms
95,328 KB |
testcase_53 | AC | 564 ms
95,424 KB |
07_evil_01.txt | AC | 1,362 ms
181,392 KB |
07_evil_02.txt | TLE | - |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("Ofast") #include <bits/stdc++.h> #include <unistd.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = unsigned long long; #define endl "\n" typedef pair<int, int> Pii; #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define all(s) (s).begin(),(s).end() //#define rep2(i, m, n) for (int i = (m); i < (n); ++i) //#define rep(i, n) rep2(i, 0, n) #define PB push_back #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) //#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++) #define fi first #define se second #define pb push_back #define P pair<ll,ll> #define NP next_permutation //const ll mod = 1000000009; const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 9100000000000000000ll; const ld eps = ld(0.0000000000001); static const long double pi = 3.141592653589793; template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];} template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];} template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;} template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}} template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;} void yes(bool a){cout<<(a?"yes":"no")<<endl;} void YES(bool a){cout<<(a?"YES":"NO")<<endl;} void Yes(bool a){cout<<(a?"Yes":"No")<<endl;} void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; } void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; } void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; } template<class T>auto min(const T& a){ return *min_element(all(a)); } template<class T>auto max(const T& a){ return *max_element(all(a)); } template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;} template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;} template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;} template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;} ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; } ll pop(ll a){ll res=0;while(a){res+=a%2;a/=2;}return res;} template<class T> struct Sum{ vector<T> data; Sum(const vector<T>& v):data(v.size()+1){ for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i]; } T get(ll l,ll r) const { return data[r]-data[l]; } }; template<class T> struct Sum2{ vector<vector<T>> data; Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){ for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j]; for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j]; } T get(ll x1,ll y1,ll x2,ll y2) const { return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1]; } }; void cincout(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(10); } vector<ll> g[300000]; int main() { cincout(); ll n; cin>>n; set<P> q; map<P,queue<ll>> m; vector<ll> ans(n); bool x=true; vector<ll> d(n); for(int i=0;i<n;i++){ ll a,b; cin>>a>>b; a--; b--; d[a]++; d[b]++; g[a].pb(b); g[b].pb(a); m[{min(a,b),max(a,b)}].push(i); } vector<ll> seen(n); for(int i=0;i<n;i++) q.insert({d[i],i}); for(int i=0;i<n;i++){ auto k=(*q.begin()); if(k.fi==0){ cout<<"No"<<endl; return 0; } q.erase(k); // cout<<q.size()<<endl; for(auto e:g[k.se]){ // cout<<i<<" "<<k.se<<" "<<e<<" "<<m[{min(k.se,e),max(k.se,e)}].size()<<" "<<m[{min(k.se,e),max(k.se,e)}].front()<<endl; if(m[{min(k.se,e),max(k.se,e)}].size()==0) continue; seen[k.se]=1; ans[m[{min(k.se,e),max(k.se,e)}].front()]=k.se+1; m[{min(k.se,e),max(k.se,e)}].pop(); q.erase({d[e],e}); d[e]--; if(!seen[e]) q.insert({d[e],e}); break; } } cout<<"Yes"<<endl; for(auto e:ans) cout<<e<<endl; }