제출 #607307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607307		MohamedFaresNebili	친구 (IOI14_friend)	C++14	8 / 100	1 ms	340 KiB

friend

#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
            using namespace std;
 
            using ll = long long;
            using ld = long double;
 
            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
 
            const int MOD = 998244353;
 
            int findSample(int N, int* confidence,
                          int* host, int* protocol) {
                int res = 0;
                for(int l = 0; l < N; l++)
                    res += confidence[l];
                return res;
            }

• Subtask 1: 0 / 11
• Subtask 2: 8 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31