Submission #1059301

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1059301	2024-08-14T20:39:04 Z	MilosMilutinovic	Potemkin cycle (CEOI15_indcyc)	C++14	70 / 100	1000 ms	2140 KB

indcyc

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m; 
  vector<vector<bool>> c(n, vector<bool>(n));
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    c[x][y] = true;
    c[y][x] = true;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (c[i][j]) {
        continue;
      }
      for (int k : g[g[i].size() < g[j].size() ? i : j]) {
        if (i == k || j == k || !c[i][k] || !c[j][k]) {
          continue;
        }
        vector<bool> del(n);
        del[k] = true;
        for (int p : g[k]) {
          if (p != i && p != j) {
            del[p] = true;
          }
        }
        vector<int> p(n, -1);
        vector<int> que(1, i);
        vector<int> d(n, -1);
        d[i] = 0;
        for (int b = 0; b < (int) que.size(); b++) {
          int i = que[b];
          for (int j : g[i]) {
            if (del[j]) {
              continue;
            }
            if (d[j] == -1) {
              p[j] = i;
              d[j] = d[i] + 1;
              que.push_back(j);
            }
          }
        }
        if (p[j] == -1) {
          continue;
        }
        vector<int> seq;
        for (int v = j; v != -1; v = p[v]) {
          seq.push_back(v);
        }
        seq.push_back(k);
        for (int i = 0; i < (int) seq.size(); i++) {
          cout << seq[i] + 1 << " ";
        }
        cout << '\n';
        return 0;
      }
    }
  }
  cout << "no" << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	7 ms	496 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	73 ms	348 KB	Output is correct
2	Correct	1 ms	712 KB	Output is correct
3	Correct	6 ms	592 KB	Output is correct
4	Correct	99 ms	604 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	464 KB	Output is correct
2	Correct	101 ms	536 KB	Output is correct

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	829 ms	1568 KB	Output is correct
2	Correct	99 ms	860 KB	Output is correct
3	Execution timed out	1061 ms	1372 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	138 ms	856 KB	Output is correct
2	Execution timed out	1057 ms	856 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	2140 KB	Output is correct
2	Correct	8 ms	2140 KB	Output is correct
3	Correct	482 ms	1908 KB	Output is correct
4	Execution timed out	1067 ms	1884 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Submission #1059301

Compilation message