# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
152491 |
2019-09-08T08:11:14 Z |
balbit |
Friend (IOI14_friend) |
C++14 |
|
3 ms |
380 KB |
#include <bits/stdc++.h>
#ifndef LOCAL
#include <friend.h>
#endif
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define SZ(x) (int)(x.size())
#define ALL(x) x.begin(),x.end()
#define FOR(i,a,b) for (int i=a; i<b; i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i = n-1; i>=0; i--)
#define MX(a,b) a = max(a, (__typeof__(a)),b)
#define MN(a,b) a = min(a, (__typeof__(a)),b)
//#define int ll
int findSample(int n, int confidence[], int host[], int protocol[]){
ll re = 0;
REP(i,n){
re += confidence[i];
}
return re;
}
#ifdef LOCAL
int c [ 5 ] = {1,2,3,4,5};
int f[3], p[3];
signed main(){
cout<<findSample(5,c,f,p)<<endl;
}
#endif
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
380 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |