oj.uz

답안 #227964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227964 2020-04-29T11:19:49 Z urd05 친구 (IOI14_friend) C++14
11 / 100
 1000 ms 6392 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
int co[100000];
int ho[100000];
int pro[100000];
int con[10][10];

int findSample(int nn,int conf[],int hos[],int prot[]) {
    n=nn;
    for(int i=0;i<n;i++) {
        co[i]=conf[i];
        ho[i]=hos[i];
        pro[i]=prot[i];
    }
    for(int i=1;i<n;i++) {
        if (pro[i]==0) {
            con[ho[i]][i]=1;
            con[i][ho[i]]=1;
        }
        if (pro[i]==1) {
            for(int j=0;j<n;j++) {
                if (con[ho[i]][j]==1) {
                    con[i][j]=1;
                    con[j][i]=1;
                }
            }
        }
        if (pro[i]==2) {
            for(int j=0;j<n;j++) {
                if (con[ho[i]][j]==1) {
                    con[i][j]=1;
                    con[j][i]=1;
                }
            }
            con[ho[i]][i]=1;
            con[i][ho[i]]=1;
        }
    }
    int ret=0;
    for(int i=0;i<(1<<n);i++) {
        bool use[10];
        memset(use,0,sizeof(use));
        for(int j=0;j<n;j++) {
            if ((i&(1<<j))!=0) {
                use[j]=true;
            }
        }
        bool flag=true;
        for(int j=0;j<n;j++) {
            for(int k=0;k<n;k++) {
                if (con[k][j]==1&&use[k]&&use[j]) {
                    flag=false;
                    break;
                }
            }
        }
        if (!flag) {
            continue;
        }
        int val=0;
        for(int j=0;j<n;j++) {
            if (use[j]) {
                val+=co[j];
            }
        }
        ret=max(ret,val);
    }
    return ret;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 424 ms 504 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 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 308 KB Output is correct
5 Runtime error 269 ms 712 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 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Runtime error 269 ms 608 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 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Runtime error 41 ms 6392 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -