oj.uz

Submission #272817

# Submission time Handle Problem Language Result Execution time Memory
272817 2020-08-18T15:47:56 Z MarcoMeijer Potemkin cycle (CEOI15_indcyc) C++14
50 / 100
 1000 ms 13688 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 5e5;

int n, r;
vi adj[MX];
set<int> R;
int start=0;
vi ans;

bool dfs(int u, int p=-1) {
    R.insert(u);
    FOR(v,adj[u]) {
        if(v == p) continue;
        if(v == start && R.sz < 4) {
            R.erase(u);
            return 0;
        }
        if(R.count(v) && v != start) {
            R.erase(u);
            return 0;
        }
    }
    FOR(v,adj[u]) {
        if(v == p) continue;
        if(v == start && R.sz >= 4) {
            ans.pb(u);
            return 1;
        }
    }
    FOR(v,adj[u]) if(v != p) {
        if(dfs(v, u)) {
            ans.pb(u);
            return 1;
        }
    }
    R.erase(u);
    return 0;
}

void program() {
    IN(n,r);
    RE(i,r) {
        int u, v; IN(u, v);
        adj[u].pb(v);
        adj[v].pb(u);
    }
    RE1(i,n) {
        start = i;
        if(dfs(i)) {
            reverse(all(ans));
            RE(j,ans.sz) OUT(j==0?"":" ", ans[j]); OUTL();
            return;
        }
    }
    OUTL("no");
}

Compilation message

indcyc.cpp: In function 'void program()':
indcyc.cpp:15:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   15 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                    ^~~
indcyc.cpp:16:17: note: in expansion of macro 'REP'
   16 | #define RE(a,c) REP(a,0,c)
      |                 ^~~
indcyc.cpp:114:13: note: in expansion of macro 'RE'
  114 |             RE(j,ans.sz) OUT(j==0?"":" ", ans[j]); OUTL();
      |             ^~
indcyc.cpp:114:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  114 |             RE(j,ans.sz) OUT(j==0?"":" ", ans[j]); OUTL();
      |                                                    ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 15 ms 12032 KB Output is correct
5 Correct 7 ms 12032 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12032 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12032 KB Output is correct
2 Correct 8 ms 12032 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12160 KB Output is correct
2 Correct 761 ms 12280 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 12160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 12160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 12928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 12544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -