# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210205 | 2020-03-16T20:02:23 Z | mohamedsobhi777 | Friend (IOI14_friend) | C++14 | 6 ms | 504 KB |
#include<bits/stdc++.h> #include<friend.h> using namespace std ; const int N = 1e5 + 5 ; int findSample(int n , int confidence[] , int host[] , int protocol[]){ int sol[n+1]; for(int i = 0 ; i < n; i++) sol[i] = confidence[i] ; int ret = 0 ; for(int i = i-1 ; i>=0 ; i--){ int p = protocol[i] ; if(!p){ ret+=sol[i] ; sol[host[i]] = max(0 , sol[host[i]] - sol[i]) ; } else if(p==1){ sol[host[i]] +=sol[i] ; } else{ sol[host[i]] = max(sol[host[i]] ,sol[i]) ; } } return sol[0] + ret ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 504 KB | Output is correct |
2 | Incorrect | 5 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |