Submission #50474

#	Time	Username	Problem	Language	Result	Execution time	Memory
50474		mirbek01	Friend (IOI14_friend)	C++17	11 / 100	36 ms	3448 KiB

friend

#include "friend.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 2;

int n, g[N][N];

// Find out best sample
int findSample(int N,int confidence[],int host[],int protocol[]){
      n = N;
      if(n > 10) return 0;
      int ans = 0;
      for(int i = 1; i < n; i ++){
            if(protocol[i]){
                  for(int j = 0; j < n; j ++){
                        if(g[host[i]][j])
                              g[j][i] = g[i][j] = 1;
                  }
            }
            if(protocol[i] != 1){
                  g[i][host[i]] = g[host[i]][i] = 1;
            }
      }

      for(int mask = 0; mask < (1 << n); mask ++){
            vector <int> v;
            int sum = 0;
            for(int i = 0; i < n; i ++){
                  int bit = (1 << i) & mask;
                  if(bit){
                        sum += confidence[i];
                        v.push_back(i);
                  }
            }
            bool fl = 1;
            for(int i = 0; i < v.size(); i ++){
                  for(int j = i + 1; j < v.size(); j ++){
                        if(g[v[i]][v[j]]){
                              fl = 0;
                        }
                  }
            }
            if(fl) ans = max(ans, sum);
      }
      return ans;
}

Compilation message (stderr)

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:39:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < v.size(); i ++){
                            ~~^~~~~~~~~~
friend.cpp:40:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                   for(int j = i + 1; j < v.size(); j ++){
                                      ~~^~~~~~~~~~

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