oj.uz

Submission #50032

# Submission time Handle Problem Language Result Execution time Memory
50032 2018-06-06T14:29:37 Z Benq Potemkin cycle (CEOI15_indcyc) C++14
50 / 100
 243 ms 2920 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,R,dist[1001],pre[1001];
bitset<1001> nex, ADJ[1001];
vi adj[1001], tmp[1001];
int comp[1001];

void finish(int x, int a1, int a2) {
    exit(0);
    FOR(i,1,N+1) dist[i] = MOD;
    queue<int> q; q.push(a1); dist[a1] = 0;
    
    while (sz(q)) {
        int t = q.front(); q.pop();
        if (t == x || (nex[t] && t != a1 && t != a2)) continue;
        
        for (int j: adj[t]) if (j <= x) {
            if (dist[j] != MOD) continue;
            dist[j] = dist[t] + 1;
            pre[j] = t;
            q.push(j);
        }
    }
    
    vi z;
    while (a2 != a1) {
        z.pb(a2);
        a2 = pre[a2];
    }
    z.pb(a1);
    z.pb(x);
    
    for (int i: z) cout << i << " ";
}

void dfs(int x, int lab, int mx) {
    if (comp[x]) return;
    comp[x] = lab;
    for (int i: adj[x]) 
        if (i < mx && !(nex[x] && nex[i]))
            dfs(i,lab,mx);
}

void test(int x) {
    FOR(i,1,N+1) comp[i] = 0, nex[i] = 0, tmp[i].clear();
    FOR(i,1,x) if (ADJ[x][i]) nex[i] = 1;
    
    FOR(i,1,x) if (nex[i]) {
        if (!comp[i]) dfs(i,i,x);
        tmp[comp[i]].pb(i);
    }
    
    FOR(i,1,x) F0R(j,sz(tmp[i])) FOR(k,j+1,sz(tmp[i])) 
        if (!ADJ[tmp[i][j]][tmp[i][k]])
            finish(x,tmp[i][j],tmp[i][k]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> R;
    F0R(i,R) {
        int x,y; cin >> x >> y;
        adj[x].pb(y), adj[y].pb(x);
        ADJ[x][y] = ADJ[y][x] = 1;
    }
    FORd(i,1,N+1) test(i);
    cout << "no";
}

// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Too short sequence
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Too short sequence

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Too short sequence
2 Correct 2 ms 612 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Too short sequence

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Too short sequence
2 Incorrect 2 ms 612 KB Unexpected end of file - token expected

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 728 KB Output is correct
2 Correct 4 ms 728 KB Too short sequence
3 Correct 5 ms 728 KB Too short sequence
4 Incorrect 3 ms 728 KB Unexpected end of file - token expected

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 728 KB Too short sequence
2 Incorrect 4 ms 728 KB Unexpected end of file - token expected

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1364 KB Too short sequence
2 Correct 10 ms 1364 KB Too short sequence
3 Correct 243 ms 1900 KB Output is correct
4 Correct 124 ms 1932 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1932 KB Too short sequence
2 Incorrect 8 ms 1932 KB Unexpected end of file - token expected

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2392 KB Too short sequence
2 Correct 234 ms 2536 KB Output is correct
3 Correct 15 ms 2536 KB Too short sequence
4 Incorrect 16 ms 2920 KB Unexpected end of file - token expected