oj.uz

Submission #47965

# Submission time Handle Problem Language Result Execution time Memory
47965 2018-05-09T09:15:46 Z Extazy Potemkin cycle (CEOI15_indcyc) C++17
100 / 100
 233 ms 5124 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define prev alkhjgajghgkjagjhk

using namespace std;

const int N = 1007;

int n,m;
bool has[N][N];
vector < int > v[N];
vector < int > comp;
bool used[N];
int dist[N],prev[N];

void dfs(int node, int chosen) {
  used[node]=true;

  if(has[node][chosen]) {
    comp.push_back(node);
    return;
  }

  for(int i=0;i<(int)(v[node].size());i++) if(!used[v[node][i]]) {
    dfs(v[node][i],chosen);
  }
}

void restore(int from, int to, int chosen) {
  int i,curr;
  queue < int > q;

  for(i=1;i<=n;i++) {
    used[i]=false;
  }

  used[from]=true;
  dist[from]=0;
  q.push(from);

  while(!q.empty()) {
    curr=q.front();
    q.pop();

    for(i=0;i<(int)(v[curr].size());i++) if(!used[v[curr][i]] && (v[curr][i]==to || !has[v[curr][i]][chosen])) {
      used[v[curr][i]]=true;
      dist[v[curr][i]]=dist[curr]+1;
      prev[v[curr][i]]=curr;
      q.push(v[curr][i]);
    }
  }

  curr=to;
  while(curr) {
    printf("%d ", curr);
    curr=prev[curr];
  }

  printf("%d\n", chosen);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int i,j,z,t,x,y;

  scanf("%d %d", &n, &m);
  for(i=1;i<=m;i++) {
    scanf("%d %d", &x, &y);
    has[x][y]=true;
    has[y][x]=true;
    v[x].push_back(y);
    v[y].push_back(x);
  }

  for(i=1;i<=n;i++) {
    has[i][i]=true;

    for(j=1;j<=n;j++) {
      used[j]=false;
    }

    for(j=1;j<=n;j++) if(!used[j] && i!=j && !has[i][j]) {
      comp.clear();
      
      dfs(j,i);
      
      for(z=0;z<(int)(comp.size());z++) for(t=z+1;t<(int)(comp.size());t++) {
        if(!has[comp[z]][comp[t]]) {
          restore(comp[z],comp[t],i);
          return 0;
        }
      }
    }
  }

  printf("no\n");

  return 0;
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:67:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &m);
   ~~~~~^~~~~~~~~~~~~~~~~
indcyc.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &x, &y);
     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 528 KB Output is correct
2 Correct 2 ms 568 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1020 KB Output is correct
2 Correct 3 ms 1020 KB Output is correct
3 Correct 4 ms 1020 KB Output is correct
4 Correct 10 ms 1148 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2300 KB Output is correct
2 Correct 13 ms 2300 KB Output is correct
3 Correct 206 ms 2972 KB Output is correct
4 Correct 123 ms 2972 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2972 KB Output is correct
2 Correct 93 ms 2972 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3012 KB Output is correct
2 Correct 24 ms 3652 KB Output is correct
3 Correct 25 ms 4620 KB Output is correct
4 Correct 233 ms 5124 KB Output is correct