oj.uz

답안 #874062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874062 2023-11-16T08:40:34 Z Sandarach151 친구 (IOI14_friend) C++17
27 / 100
 22 ms 1388 KB 
#include<bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
    if(n<=10){
        set<int> adg[n];
        for(int i=1; i<n; i++){
            if(protocol[i]==0){
                adg[host[i]].insert(i);
                adg[i].insert(host[i]);
            }
            else if(protocol[i]==1){
                for(auto u : adg[host[i]]){
                    adg[i].insert(u);
                    adg[u].insert(i);
                }
            }
            else{
                for(auto u : adg[host[i]]){
                    adg[i].insert(u);
                    adg[u].insert(i);
                }
                adg[host[i]].insert(i);
                adg[i].insert(host[i]);
            }
        }
        int maxx = 0;
        for(int mask=0; mask < (1<<n); mask++){
            bool test = true;
            int cur = 0;
            for(int i=0; i<n; i++){
                for(int j=0; j<n; j++){
                    if(((mask & (1<<i))!=0) && ((mask & (1<<j))!=0) && adg[i].count(j)){
                        test = false;
                        break;
                    }
                }
                if(!test){
                    break;
                }
            }
            if(test){
                for(int i=0; i<n; i++){
                    if((mask & (1<<i))!=0){
                        cur+=confidence[i];
                    }
                }
                maxx = max(maxx, cur);
            }
        }
        return maxx;
    }
    else{
        bool res0 = true;
        bool res1 = true;
        bool res2 = true;
        for(int i=1; i<n; i++){
            if(protocol[i]==0){
                res1 = false;
                res2 = false;
            }
            if(protocol[i]==1){
                res0 = false;
                res2 = false;
            }
            if(protocol[i]==2){
                res0 = false;
                res1 = false;
            }
        }
        if(res1){
            int ans = 0;
            for(int i=0; i<n; i++){
                ans += confidence[i];
            }
            return ans;
        }
        else if(res2){
            int ans = 0;
            for(int i=0; i<n; i++){
                ans = max(ans, confidence[i]);
            }
            return ans;
        }
    }
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:54:14: warning: variable 'res0' set but not used [-Wunused-but-set-variable]
   54 |         bool res0 = true;
      |              ^~~~
friend.cpp:86:1: warning: control reaches end of non-void function [-Wreturn-type]
   86 | }
      | ^

Subtask #1
11.0 / 11.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 600 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 1 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
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 600 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

Subtask #4
0 / 19.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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 592 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 Incorrect 0 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 500 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 22 ms 1388 KB Output isn't correct
13 Halted 0 ms 0 KB -