제출 #91078

#제출 시각아이디문제언어결과실행 시간메모리
91078Mohammad_Yasser경찰관과 강도 (BOI14_coprobber)C++14
16 / 100
163 ms2880 KiB
#include "coprobber.h" #include <bits/stdc++.h> using namespace std; const int N = 505; int floyd[N][N]; vector<int> adj[N]; int vis[N]; int vis_id; int getMinCycle(int u, int v) { ++vis_id; queue<int> q; q.push(u); int level = 0; while (!q.empty()) { int sz = q.size(); while (sz--) { int curr = q.front(); q.pop(); if (vis[curr] == vis_id) continue; vis[curr] = vis_id; if (curr == v) return level; for (int x : adj[curr]) { if (curr == u && x == v) continue; q.push(x); } } ++level; } return N; } int start(int n, bool A[MAX_N][MAX_N]) { for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { floyd[i][j] = (A[i][j] ? 1 : 1000); if (A[i][j]) { adj[i].push_back(j); } } floyd[i][i] = 0; } for (int j = 0; j < n; ++j) { for (int i = 0; i < n; ++i) { for (int k = 0; k < n; ++k) { floyd[i][k] = min(floyd[i][k], floyd[i][j] + floyd[j][k]); } } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (A[i][j]) { int min_cycle = getMinCycle(i, j); if (min_cycle != N && min_cycle >= 4) return -1; } } return 0; } } int current = 0; int nextMove(int R) { if (floyd[current][R] == 2) return current; for (int x : adj[current]) { if (floyd[x][R] < floyd[current][R]) { current = x; return current; } } assert(false); return -1; }

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

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...