oj.uz

답안 #151712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151712 2019-09-04T10:02:15 Z willi19 친구 (IOI14_friend) C++14
11 / 100
 41 ms 6520 KB 
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
int n,c[100100],h[100100],p[100100],edge[12][12],dp[100000];
int ans(int state)
{
    if(dp[state]!=0)
        return dp[state];
    int ret=0;
    for(int i=0;i<n;i++)
        if(state&(1<<i))
            ret+=c[i];
    for(int i=0;i<n;i++)
    {
        if((state&(1<<i))!=0)
            continue;
        bool pos=true;
        for(int j=0;j<n;j++)
            if((state&1<<j)!=0&&edge[i][j]==1)
                pos=false;
        if(pos)
            ret=max(ret,ans(state|(1<<i)));
    }
    dp[state]=ret;
    return ret;
}
int findSample(int in,int confidence[],int host[],int protocol[]){
    n=in;
  	for(int i=0;i<n;i++)
    {
      c[i]=confidence[i];
      h[i]=host[i];
      p[i]=protocol[i];
    }
    for(int i=1;i<n;i++)
    {
        if(p[i]==0)
            edge[i][h[i]]=edge[h[i]][i]=1;
        else
        {
            for(int j=0;j<n;j++)
                edge[j][i]=edge[i][j]=edge[h[i]][j];
            if(p[i]==2)
                edge[i][host[i]]=edge[host[i]][i]=1;
        }
    }
    return ans(0);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Runtime error 4 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Runtime error 4 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Runtime error 41 ms 6520 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -