제출 #1081577

#제출 시각아이디문제언어결과실행 시간메모리
1081577EliasPipes (CEOI15_pipes)C++17
0 / 100
1 ms2396 KiB
#include <bits/stdc++.h> using namespace std; int parent[100000]; int depth[100000]; int root[100000]; int union_parent[100000]; int children[100000]; signed main() { cin.tie(0); ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { parent[i] = depth[i] = root[i] = union_parent[i] = children[i] = i; } cout << parent[n-1] + depth[n-1] + root[n-1] + union_parent[n-1] + children[n-1]; }
#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...