Submission #607467

#	Time	Username	Problem	Language	Result	Execution time	Memory
607467		MohamedFaresNebili	Friend (IOI14_friend)	C++14	0 / 100	1 ms	212 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 DP[100001][2];

            int findSample(int N, int* confidence,
                          int* host, int* protocol) {
                for(int l = 0; l < N; l++)
                    DP[l][1] = confidence[l];
                for(int l = 1; l < N; l++) {
                    int t = protocol[l];
                    if(t == 0) DP[host[l]][0] += confidence[l];
                    if(t == 1) DP[host[l]][1] += confidence[l];
                    if(t == 2) DP[host[l]][2] += confidence[l];
                }
                return min(DP[0][0], DP[0][1]);
            }

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:29:47: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds]
   29 |                     if(t == 2) DP[host[l]][2] += confidence[l];
      |                                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
friend.cpp:29:47: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds]

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