답안 #35999 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
35999	2017-12-04T06:29:43 Z	funcsr	Potemkin cycle (CEOI15_indcyc)	C++14	40 / 100	126 ms	3000 KB

indcyc

#include <iostream>
#include <fstream>
#include <bitset>
#include <cassert>
#include <vector>
#include <queue>
#include <algorithm>
#define rep(i, n) for (int i=0; i<(n); i++)
#define INF 1145141919
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;

int N, M;
bool G[1000][1000];
int A[1000], pre[1000];

signed main() {
  cin >> N >> M;
  rep(i, M) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    G[a][b] = G[b][a] = true;
  }
  rep(s, N) {
    rep(i, N) A[i] = -1;
    queue<int> q;
    rep(t, N) if (G[s][t]) {
      pre[t] = s;
      A[t] = t;
      q.push(t);
    }
    while (!q.empty()) {
      int x = q.front(); q.pop();
      rep(t, N) if (G[x][t]) {
        if (t == s) continue;
        if (A[t] == -1) {
          A[t] = A[x], pre[t] = x;
          q.push(t);
        }
        else {
          int a = A[x], b = A[t];
          if (a == b || G[a][b]) continue;
          vector<int> left, right;
          while (x != s) {
            left.pb(x);
            x = pre[x];
          }
          while (t != s) {
            right.pb(t);
            t = pre[t];
          }
          reverse(all(right));
          left.pb(s);
          for (int r : right) left.pb(r);
          for (int x : left) cout << x+1 << " "; cout << "\n";
          return 0;
        }
      }
    }
    if (N > 300 && s > 2) break;
  }
  cout << "no\n";
  return 0;
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	3000 KB	Output is correct
2	Correct	3000 KB	Output is correct
3	Correct	3000 KB	Output is correct
4	Correct	3000 KB	Output is correct
5	Correct	3000 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

Subtask #6
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	123 ms	3000 KB	Output is correct
2	Correct	0 ms	3000 KB	Output is correct
3	Correct	6 ms	3000 KB	Output is correct
4	Correct	126 ms	3000 KB	Output is correct

Subtask #7
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	109 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	43 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	26 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	66 ms	3000 KB	Expected integer, but "no" found
2	Halted	0 ms	0 KB	-

답안 #35999

Compilation message