Submission #787992

#	Time	Username	Problem	Language	Result	Execution time	Memory
787992		tolbi	Friend (IOI14_friend)	C++17	11 / 100	1082 ms	65536 KiB

friend

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> ostream& operator<<(ostream& os, vector<X> v){for (auto &it : v) os<<it<<" ";return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for (auto &it : v) os<<it<<" ";return os;}
ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;}
#define endl '\n'
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for(auto &it : x) cin>>it;
#define coutarr(x) for(auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1ll<<((int)(bi)))
typedef long long ll;
const ll INF = LONG_LONG_MAX;
const ll MOD = 1e9+9;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "friend.h"
int findSample(int n,int confidence[],int host[],int protocol[]){
    vector<vector<int>> arr(n);
    for (int i = 1; i < n; ++i)
    {
        int j = host[i];
        if (protocol[i]==0){
            arr[i].push_back(j);
            arr[j].push_back(i);
        }
        else if (protocol[i]==1){
            for (int k = 0; k < arr[j].size(); k++){
                int ele = arr[j][k];
                arr[i].push_back(ele);
                arr[ele].push_back(i);
            }
        }
        else {
            for (int k = 0; k < arr[j].size(); k++){
                int ele = arr[j][k];
                arr[i].push_back(ele);
                arr[ele].push_back(i);
            }
            arr[i].push_back(j);
            arr[j].push_back(i);
        }
    }
    vector<vector<bool>> vis(n,vector<bool>(n,false));
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < arr[i].size(); j++){
            vis[i][arr[i][j]]=true;
        }
    }
    ll ans = 0;
    for (int i = 0; i < tol(n); i++){
        ll somma = 0;
        bool valid = true;
        for (int j = 0; j < n; j++){
            if (tol(j)&i) continue;
            somma+=confidence[j];
            for (int k = 0; k < n; k++){
                if (k==j) continue;
                if (tol(k)&i) continue;
                if (vis[j][k]){
                    valid=false;
                    break;
                }
            }
            if (!valid) break;
        }
        if (valid) ans=max(ans,somma);
    }
    return ans;
}

Compilation message (stderr)

friend.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:42:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for (int k = 0; k < arr[j].size(); k++){
      |                             ~~^~~~~~~~~~~~~~~
friend.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             for (int k = 0; k < arr[j].size(); k++){
      |                             ~~^~~~~~~~~~~~~~~
friend.cpp:61:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for (int j = 0; j < arr[i].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