oj.uz

답안 #50021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50021 2018-06-06T12:13:47 Z Benq Potemkin cycle (CEOI15_indcyc) C++14
70 / 100
 1000 ms 3620 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> adj[1001], ok;

void getPath(int x, int y) {
    queue<int> q; q.push(x); dist[x] = 0;
    while (sz(q)) {
        int t = q.front(); q.pop();
        //cout << "OH " << t << " " << adj[2][5] << "\n";
        FOR(i,1,N+1) if (ok[i] && adj[t][i]) {
            if (dist[i] != MOD || (t == x && i == y)) continue;
            //cout << "TRI " << t << " " << i << "\n";
            dist[i] = dist[t] + 1;
            pre[i] = t;
            q.push(i);
        }
    }
}
void test(int x, int y) {
    FOR(i,1,N+1) {
        ok[i] = 1;
        dist[i] = MOD;
    }
    FOR(i,1,N+1) if (adj[i][x] && adj[i][y]) ok[i] = 0;
    getPath(x,y);
    if (dist[y] == MOD) return;
    while (y != x) {
        cout << y << " ";
        y = pre[y];
    }
    cout << x;
    exit(0);
}

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][y] = adj[y][x] = 1;
    }
    FOR(i,1,N+1) FOR(j,i+1,N+1) if (adj[i][j]) {
        test(i,j);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 420 KB Output is correct
4 Correct 2 ms 520 KB Output is correct
5 Correct 2 ms 520 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 624 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 636 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 692 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 692 KB Output is correct
2 Correct 23 ms 828 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 864 KB Output is correct
2 Correct 9 ms 864 KB Output is correct
3 Correct 7 ms 908 KB Output is correct
4 Correct 877 ms 1004 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 1004 KB Output is correct
2 Correct 564 ms 1004 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 1512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 570 ms 1676 KB Output is correct
2 Execution timed out 1092 ms 1788 KB Time limit exceeded

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 2372 KB Output is correct
2 Correct 378 ms 3176 KB Output is correct
3 Execution timed out 1088 ms 3620 KB Time limit exceeded
4 Halted 0 ms 0 KB -