답안 #874082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874082 2023-11-16T08:58:15 Z kxd 친구 (IOI14_friend) C++17
8 / 100
1 ms 604 KB
    #include <bits/stdc++.h>
    #include "friend.h"
    //#define DEBUG 1106
    //#define int long long
    #define ll long long
    #define ld long double
    #define pb push_back
    #define p_q priority_queue
    #define m_p make_pair
    #define pii pair<int,int>
    #define endl '\n'
    #define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define FOR(i,a,b) for(int i = a; i <= b; i++)
    #define forn(i,n) for (int i = 0; i < n; i++)
    #define forn1(i,n) for (int i = 1; i <= n; i++)
    #define all(x) x.begin(),x.end()
    #define ft first
    #define sd second
    #define lowbit(x) (x&(-x))
    #define chmax(x,y) x=max(x,y)
    #define chmin(x,y) x=min(x,y)
     
    using namespace std;
     
    int findSample(int n, int confidence[], int host[], int protocol[]) {
    	int ret = 0;
    	forn(i,n) {
    		ret += confidence[i];
    	}
    	return ret;
    }
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 444 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -