oj.uz

Submission #932801

# Submission time Handle Problem Language Result Execution time Memory
932801 2024-02-24T09:08:47 Z vjudge1 Friend (IOI14_friend) C++17
46 / 100
 19 ms 1480 KB 
#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;

#define F first
#define S second
#define ll long long
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back
#define ull unsigned ll

const int MAX=1000+55;
const int inf=1e9;
const int N=2e5;
const int C=331;
const int C1=431;
const int mod=1e9+9;
const int mod1=1e9+9;
// #include "friend.h"

int dp[MAX][2];
vector<pii> g[MAX];
int a[MAX];

void dfs(int v,int p=-1){
  for(auto to:g[v]){
    if(to.F==p)continue;
    dfs(to.F,v);
    dp[v][0]+=max(dp[to.F][0],dp[to.F][1]);
    if(to.S==0)dp[v][1]+=dp[to.F][0];
    else dp[v][1]+=max(dp[to.F][0],dp[to.F][1]);
  }
  dp[v][1]+=a[v];
}

int d[MAX][MAX];

int bit(int i,int j){
  return (i>>j)&1;
}

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
  if(n<=10){
    for(int i=1;i<n;i++){
      if(protocol[i]!=1){
        d[i][host[i]]=1;
        d[host[i]][i]=1;
      }
      if(protocol[i]!=0){
        for(int j=0;j<n;j++){
          if(d[host[i]][j]){
            d[j][i]=1;
            d[i][j]=1;
          }
        }
      }
    }
    int ans=0;
    for(int mask=0;mask<(1<<n);mask++){
      int w=0;
      bool ok=1;
      for(int i=0;i<n;i++){
        if(bit(mask,i))w+=confidence[i];
        for(int j=i+1;j<n;j++){
          if(bit(mask,i)&&bit(mask,j)&&d[i][j])ok=0;
        }
      }
      if(ok)ans=max(ans,w);
    }
    return ans;
  }
  if(protocol[1]==2){
    int ans=0;
    for(int i=0;i<n;i++)ans=max(ans,confidence[i]);
    return ans;
  }
  for(int i=0;i<n;i++)a[i]=confidence[i];
  for(int i=1;i<n;i++){
    if(protocol[i]==0){
      g[i].pb({host[i],0});
      g[host[i]].pb({i,0});
    }
    else{
      g[host[i]].pb({i,1});
      g[i].pb({host[i],1});
    }
  }
  dfs(0);
  return max(dp[0][0],dp[0][1]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 544 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 19 ms 1480 KB Output isn't correct
13 Halted 0 ms 0 KB -