| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 404146 | Kenzo_1114 | Friend (IOI14_friend) | C++17 | 1 ms | 420 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include"friend.h"
using namespace std;
const int MAXN = 100010;
int n, c[MAXN], h[MAXN], p[MAXN];
/*
0 : for IAmYourFriend
1 : for MyFriendsAreYourFriends
2 : forWeAreYourFriends
*/
int findSample(int N, int Confidence[], int Host[], int Protocol[])
{
n = N;
for(int i = 0; i < N; i++) c[i] = Confidence[i];
for(int i = 0; i < N; i++) h[i] = Host[i];
for(int i = 0; i < N; i++) p[i] = Protocol[i];
int sum = 0;
for(int i = 0; i < N; i++) sum += c[i];
return sum;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
