제출 #655402

#제출 시각아이디문제언어결과실행 시간메모리
655402ShirAriel연결리스트 수사하기 (NOI12_forensic)C++17
25 / 25
3 ms1492 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; vector<vector<ll>> branch; vector<bool> bigchain; ll getlen(ll v) { ll ans = 1; for (ll i = 0; i < branch[v].size(); i++) { ll u = branch[v][i]; if (!bigchain[u]) ans = max(getlen(u) + 1, ans); } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin >> n; vector<ll> chain(n); for (ll i = 0; i < n; i++) cin >> chain[i]; branch.resize(n); for (ll i = 0; i < n; i++) if (chain[i] != -1) branch[chain[i]].push_back(i); //find main chain bool circle = false; bigchain.resize(n, false); ll v = chain[0], cnt=0; bigchain[0] = true; while (v!=-1 && !bigchain[v]) { bigchain[v] = true; v = chain[v]; cnt++; } if (v != -1) circle = true; //find branches ll b = 0; v = chain[0]; for (ll i = 0; i < cnt;i++) { b = max(b, getlen(v)); v = chain[v]; } //find other chains ll c = 0; for (ll i = 0; i < n; i++) if (chain[i] == -1 && !bigchain[i]) c = max(c, getlen(i) + 1); if (circle&&c == 0) cout << cnt + 1; else cout << cnt + max(c, (circle ? 0 : b)); return 0; }

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

forensic.cpp: In function 'll getlen(ll)':
forensic.cpp:16:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for (ll i = 0; i < branch[v].size(); i++)
      |                 ~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...