oj.uz

Submission #381276

# Submission time Handle Problem Language Result Execution time Memory
381276 2021-03-25T01:08:10 Z Aaeria Senior Postmen (BOI14_postmen) C++14
100 / 100
 495 ms 83300 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,avx2,fma,mmx,popcnt,tune=native" //#pragma GCC optimize "prefetch-loop-arrays"
using namespace std; using namespace __gnu_pbds;
#define foru(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a);i>=(b);i--)
#define fori(a,b) foru(i,a,b)
#define forj(a,b) foru(j,a,b)
#define fork(a,b) foru(k,a,b)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
#define mt make_tuple
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define P2(x) (1LL<<(x))
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#if __SIZEOF_INT128__
    typedef __int128_t i128; typedef __uint128_t ui128;
#else
    typedef int64_t i128; typedef uint64_t ui128;
#endif
typedef int64_t ll;  typedef uint64_t ull; typedef int8_t byte; typedef long double lld;
typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<lld,lld> pdd;
template<class T1,class T2> using ordered_map=tree<T1,T2,less<T1>,rb_tree_tag,tree_order_statistics_node_update>; template<class T1> using ordered_set=ordered_map<T1,null_type>;
template<class T> using minpq=std::priority_queue<T,vector<T>,greater<T>>; template<class T> using maxpq=std::priority_queue<T,vector<T>,less<T>>;
template<class T> using minpairingheap=__gnu_pbds::priority_queue<T,greater<T>,pairing_heap_tag>; template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,less<T>,pairing_heap_tag>;
const int inf=0x3f3f3f3f,MOD=1e9+7; const ll INF=0x3f3f3f3f3f3f3f3f; const lld PI=acos((lld)-1);
const ll SEED=443214^chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937 randgen(SEED); int randint(int a, int b){return uniform_int_distribution<int>(a,b)(randgen);} ll randll(ll a, ll b){return uniform_int_distribution<ll>(a,b)(randgen);}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll fpow(ll a,ll b,ll M=MOD){ll ret=1;for(;b;b>>=1){if(b&1) ret=ret*a%M;a=a*a%M;}return ret;}
template<class T1,class T2>constexpr const auto _min(const T1&x,const T2&y){return x<y?x:y;} template<class T,class...Ts>constexpr auto _min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T1,class T2>constexpr const auto _max(const T1&x,const T2&y){return x>y?x:y;} template<class T,class...Ts>constexpr auto _max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
template<class T1,class T2>constexpr bool ckmin(T1&x,const T2&y){return x>y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmin(T&x,const Ts&...xs){return ckmin(x,min(xs...));}
template<class T1,class T2>constexpr bool ckmax(T1&x,const T2&y){return x<y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmax(T&x,const Ts&...xs){return ckmax(x,max(xs...));}
struct chash{
    static ll splitmix64(ll x){x+=0x9e3779b97f4a7c15; x=(x^(x>>30))*0xbf58476d1ce4e5b9; x=(x^(x>>27))*0x94d049bb133111eb; return x^(x>>31);}
    template<class T> size_t operator()(const T &x) const{return splitmix64(hash<T>()(x)+SEED);}
    template<class T1,class T2> size_t operator()(const pair<T1,T2>&x)const{return 31*operator()(x.first)+operator()(x.second);}};
void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
string to_string(char c){return string(1,c);} string to_string(char* s){return (string)s;} string to_string(string s){return s;}
template<class T> string to_string(complex<T> c){stringstream ss; ss<<c; return ss.str();} template<class T1,class T2> string to_string(pair<T1,T2> p){return "("+to_string(p.pf)+","+to_string(p.ps)+")";}
template<size_t SZ> string to_string(bitset<SZ> b){string ret=""; fori(0,SZ) ret+=char('0'+b[i]); return ret;}
template<class T> string to_string(T v){string ret="{"; for(const auto& x:v) ret+=to_string(x)+","; return ret+"}";}
void DBG(){cerr<<"]"<<endl;} template<class T,class... Ts> void DBG(T x,Ts... xs){cerr<<to_string(x); if(sizeof...(xs)) cerr<<", "; DBG(xs...);}
#ifdef LOCAL
    #define dbg(...) cerr<<"Line("<< __LINE__<<") -> ["<<#__VA_ARGS__<<"]: [", DBG(__VA_ARGS__)
#else
    #define dbg(...) 0
#endif
#define nl "\n"

const int N=500010,M=MOD;
int n,m,a,b,nxt[N],cyc;
bool vis[N],trav[N];
vector<pii> gr[N];
vector<int> ans;
void dfs(int v){
    vis[v]=1;
    while(nxt[v]<sz(gr[v])){
        auto i=gr[v][nxt[v]++];
        if(!trav[i.ps]){
            trav[i.ps]=1;
            if(vis[i.pf]){
                ans.pb(v);
                cyc=i.pf;
                return;
            }
            dfs(i.pf);
            ans.pb(v);
            if(cyc==v){
                for(auto i:ans){
                    cout<<i<<" ";
                    vis[i]=0;
                }
                cout<<nl; ans.clear();
                cyc=0; vis[v]=1;
            }
            else if(cyc) return;
        }
    }

}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m;
    fori(0,m){
        cin>>a>>b; gr[a].eb(b,i); gr[b].eb(a,i);
    }
    fori(1,n+1) if(nxt[i]<sz(gr[i])) dfs(i);
    return 0;
}
/**
*/

Compilation message

postmen.cpp: In function 'void fIn(std::string)':
postmen.cpp:54:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   54 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
postmen.cpp: In function 'void fOut(std::string)':
postmen.cpp:54:78: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   54 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
      |                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12140 KB Output is correct
2 Correct 12 ms 12140 KB Output is correct
3 Correct 12 ms 12140 KB Output is correct
4 Correct 10 ms 12268 KB Output is correct
5 Correct 9 ms 12140 KB Output is correct
6 Correct 10 ms 12268 KB Output is correct
7 Correct 15 ms 12656 KB Output is correct
8 Correct 11 ms 12396 KB Output is correct
9 Correct 45 ms 14564 KB Output is correct
10 Correct 11 ms 12268 KB Output is correct
11 Correct 11 ms 12268 KB Output is correct
12 Correct 45 ms 14956 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12140 KB Output is correct
2 Correct 9 ms 12140 KB Output is correct
3 Correct 9 ms 12140 KB Output is correct
4 Correct 10 ms 12268 KB Output is correct
5 Correct 9 ms 12140 KB Output is correct
6 Correct 10 ms 12268 KB Output is correct
7 Correct 14 ms 12652 KB Output is correct
8 Correct 10 ms 12396 KB Output is correct
9 Correct 41 ms 14700 KB Output is correct
10 Correct 11 ms 12268 KB Output is correct
11 Correct 10 ms 12268 KB Output is correct
12 Correct 45 ms 14956 KB Output is correct
13 Correct 82 ms 26340 KB Output is correct
14 Correct 71 ms 16108 KB Output is correct
15 Correct 63 ms 15840 KB Output is correct
16 Correct 77 ms 26340 KB Output is correct
17 Correct 81 ms 15852 KB Output is correct
18 Correct 74 ms 18668 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12140 KB Output is correct
2 Correct 9 ms 12140 KB Output is correct
3 Correct 9 ms 12140 KB Output is correct
4 Correct 10 ms 12268 KB Output is correct
5 Correct 9 ms 12140 KB Output is correct
6 Correct 10 ms 12268 KB Output is correct
7 Correct 14 ms 12652 KB Output is correct
8 Correct 10 ms 12396 KB Output is correct
9 Correct 40 ms 14572 KB Output is correct
10 Correct 11 ms 12268 KB Output is correct
11 Correct 10 ms 12268 KB Output is correct
12 Correct 44 ms 14956 KB Output is correct
13 Correct 78 ms 26340 KB Output is correct
14 Correct 68 ms 16108 KB Output is correct
15 Correct 62 ms 15644 KB Output is correct
16 Correct 82 ms 26340 KB Output is correct
17 Correct 66 ms 15852 KB Output is correct
18 Correct 77 ms 18668 KB Output is correct
19 Correct 493 ms 83300 KB Output is correct
20 Correct 435 ms 32384 KB Output is correct
21 Correct 401 ms 29984 KB Output is correct
22 Correct 482 ms 83164 KB Output is correct
23 Correct 177 ms 23632 KB Output is correct
24 Correct 495 ms 31340 KB Output is correct
25 Correct 482 ms 44644 KB Output is correct