제출 #1064310

#제출 시각아이디문제언어결과실행 시간메모리
1064310damjandavkov친구 (IOI14_friend)C++17
16 / 100
1 ms348 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; int findSample(int n, int v[], int pa[], int ty[]) { int i, s = 0, m = 0; for (i = 0; i < n; i++) { s += v[i]; m = max(m, v[i]); } if (ty[1] == 1) return s; return m; }
#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...