oj.uz

Submission #859292

# Submission time Handle Problem Language Result Execution time Memory
859292 2023-10-10T03:28:16 Z Muhammad_Aneeq Potemkin cycle (CEOI15_indcyc) C++17
40 / 100
 1000 ms 1516 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
using namespace std;
int const N=2000;
vector<int>nei[N]={};
int vis[N]={};
vector<int>z;
bool check(vector<int>g)
{
  map<int,int>cnt;
  for (auto i:g)
  {
    for (auto j:nei[i])
      cnt[j]++;
  }
  for (auto i:g)
  {
    if (cnt[i]!=2)
      return 0;
  }
  return 1;
}
void ans(vector<int>g)
{
  reverse(g.begin(), g.end());
  for (auto i:g)
    cout<<i<<' ';
  cout<<endl;
  _Exit(0);
}
void dfs(int x)
{
  z.push_back(x);
  for (auto i:nei[x])
  {
    if (vis[i])
    {
      vector<int>g;
      for (int j=z.size()-1;j>=0;j--)
      {
        g.push_back(z[j]);
        if (z[j]==i)
          break;
      }
      if (g.size()>=4&&check(g))
        ans(g);
    }
    else
    {
      vis[x]=1;
      dfs(i);
      vis[x]=0;
    }
  }
  if (z.size())
    z.pop_back();
}
inline void solve()
{
  int n,m;
  cin>>n>>m;
  for(int i=1;i<=m;i++)
  {
    int a,b;
    cin>>a>>b;
    nei[a].push_back(b);
    nei[b].push_back(a);
  }
  vis[1]=1;
  dfs(1); 
  cout<<"no\n";
}
int main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 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 504 KB Output is correct
2 Correct 6 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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1018 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1030 ms 1108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1047 ms 604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 1516 KB Time limit exceeded
2 Halted 0 ms 0 KB -