제출 #244463

#제출 시각아이디문제언어결과실행 시간메모리
244463dwscPotemkin cycle (CEOI15_indcyc)C++14
0 / 100
25 ms1408 KiB
#include <bits/stdc++.h> using namespace std; typedef pair<int,int> ii; int n,m; vector<int> adj[1010]; int depth[1010],p[1010][10]; int lowest[1010][11]; int relabel[1010]; int counter; void dfs(int u,int pa){ //cout << u << pa << "hi\n"; depth[u] = depth[pa]+1; p[u][0] = pa; for (int i = 1; i <= 10; i++){ if (p[u][i-1] == 0) p[u][i] = 0; else p[u][i] = p[p[u][i-1]][i-1]; } for (int i = 0; i < adj[u].size(); i++){ int v = adj[u][i]; if (depth[v] != 0) continue; dfs(v,u); } relabel[u] = ++counter; } int lowestjump[1010]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m; for (int i = 0; i < m; i++){ int x,y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } for (int i = 1; i <= n; i++){ if (p[i][0] == 0) dfs(i,0); } vector<ii> backedges; for (int i = 1; i <= n; i++){ lowestjump[i] = 1e9; for (int j = 0; j < adj[i].size(); j++){ int ni = adj[i][j]; if (p[ni][0] == i || p[i][0] == ni) continue; if (depth[i] < depth[ni]) continue; lowestjump[i] = min(lowestjump[i],relabel[ni]); if (depth[i]-depth[ni] >= 3) backedges.push_back(ii(i,ni)); } }/* for (int i = 0; i < backedges.size(); i++){ int minjump = 1e9; int start = backedges[i].first, fin = backedges[i].second; if (lowestjump[start] != relabel[fin]) continue; int temp = start; while (temp != fin){ temp = p[temp][0]; minjump = min(minjump,lowestjump[temp]); } if (minjump <= relabel[fin]) continue; cout << start << " "; while (start != fin){ start = p[start][0]; cout << start << " "; } return 0; }*/ cout << "no"; return 0; }

컴파일 시 표준 에러 (stderr) 메시지

indcyc.cpp: In function 'void dfs(int, int)':
indcyc.cpp:18:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < adj[u].size(); i++){
                     ~~^~~~~~~~~~~~~~~
indcyc.cpp: In function 'int main()':
indcyc.cpp:42:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < adj[i].size(); j++){
                         ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...