oj.uz

답안 #874075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874075 2023-11-16T08:53:07 Z dzuizz 친구 (IOI14_friend) C++14
27 / 100
 23 ms 7544 KB 
// Subtask 1

#include <bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]) {
    bool subtask2 = 1, subtask3 = 1, subtask4 = 1;
    for (int i=1; i<n; i++) {
        if (protocol[i] != 1) subtask2 = 0;
        if (protocol[i] != 2) subtask3 = 0;
        if (protocol[i] != 0) subtask4 = 0;
    }

    if (subtask2) {
        int ans=0;
        for (int i=0; i<n; i++) ans += confidence[i];

        return ans;
    }

    if (subtask3) {
        int ans=0;
        for (int i=0; i<n; i++) ans = max(ans, confidence[i]);

        return ans;
    }

    if (subtask4) {

    }

    vector<int> adjlist[n];
    for (int i=1; i<n; i++) {
        if (protocol[i] != 1) {
            adjlist[host[i]].push_back(i);
            adjlist[i].push_back(host[i]);
        }
        if (protocol[i] != 0) {
            for (auto &nx : adjlist[host[i]]) {
                adjlist[i].push_back(nx);
                adjlist[nx].push_back(i);
            }
        }
    }

    int ans=0;
    for (int i=0; i<(1<<n); i++) {
        bool vis[n]; memset(vis, 0, sizeof(vis));
        bool flag=1;
        int res=0;
        
        for (int j=0; j<n&&flag; j++) {
            int bit = (i>>j)&1;
            if (bit == 0) continue;
            res += confidence[j];
            
            for (auto &nx : adjlist[j]) if (vis[nx]) flag = 0;
            vis[j] = 1;
        }
        if (flag) ans = max(ans, res);
    }
    
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 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 460 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 344 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 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 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 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 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 600 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 Runtime error 23 ms 7544 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -