oj.uz

답안 #283953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283953 2020-08-26T10:04:33 Z infinite_iq Potemkin cycle (CEOI15_indcyc) C++14
100 / 100
 360 ms 95224 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=998244353;
const ld Pi=acos(-1) ;
int n , m ;
vpi g [1009] ;
vi  v [200009] , ans ;
pi  e [200009] ;
int done [200009] , in [200009] , go [1009][1009] ;
void dfs ( int node , int p ) {
        if ( in [node] ) {
                while ( 1 ) {
                        int x = ans .back () ;
                        cout << e [x] .se + 1 << " " ;
                        ans .ppb () ;
                        if ( x == node ) break ;
                }
                cout << endl ;
                exit (0) ;
        }
        if ( done [node] ) return ;
        in [node] = 1 ;
        done [node] = 1 ;
        ans .pb ( node ) ;
        for ( auto u : v [node] ) {
                if ( u == p ) C ;
                dfs ( u , node ) ;
        }
        in [node] = 0 ;
        ans .ppb ()   ;
}
int main () {
        cin >> n >> m ;
        for ( int i = 0 ; i < m ; i ++ ) {
                int a , b ;
                cin >> a >> b ;
                a -- , b -- ;
                g  [a] .pb ( { b , i * 2 } ) ;
                g  [b] .pb ( { a , i * 2 + 1 } ) ;
                go [a][b] = go [b][a] = 1 ;
                e [i*2]   = { a , b } ;
                e [i*2+1] = { b , a } ;
        }
        m *= 2 ;
        for ( int i = 0 ; i < m ; i ++ ) {
                int a = e [i] .fi , b = e [i] .se ;
                for ( auto u : g [b] ) {
                        if ( u .fi == a || go [a][u.fi] ) C ;
                        v [i] .pb ( u.se ) ;
                }
        }
        for ( int i = 0 ; i < m ; i ++ ) {
                if ( done [i] ) C ;
                dfs ( i , i ) ;
        }
        cout << "no" << endl ;

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 5092 KB Output is correct
5 Correct 4 ms 5024 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6656 KB Output is correct
2 Correct 8 ms 6656 KB Output is correct
3 Correct 17 ms 8704 KB Output is correct
4 Correct 18 ms 8704 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 26744 KB Output is correct
2 Correct 50 ms 13176 KB Output is correct
3 Correct 168 ms 26744 KB Output is correct
4 Correct 50 ms 13176 KB Output is correct

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 11640 KB Output is correct
2 Correct 244 ms 12368 KB Output is correct
3 Correct 323 ms 95176 KB Output is correct
4 Correct 360 ms 95224 KB Output is correct