Submission #874088

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
874088	2023-11-16T09:03:41 Z	Fenixion	Friend (IOI14_friend)	C++14	16 / 100	11 ms	12580 KB

friend

#include <bits/stdc++.h>
#include "friend.h"
 
 
using namespace std;
 
int findSample(int n, int confidence[], int host[], int protocol[]) {
 
    vector<vector<int>> adjlist(n, vector<int>(n, 1)); //1 not connected, 0 connected
 
    for (int i=1;i<n;i++) {
        if (protocol[i] == 0) {
            adjlist[host[i]][i] = 0;
            adjlist[i][host[i]] = 0;
        }
 
        else if (protocol[i] == 1) {
            for (auto x : adjlist[host[i]]) {
                if (adjlist[x][host[i]] == 0) {
                    adjlist[i][x] = 0;
                    adjlist[x][i] = 0;
                }
            }
        }
 
        else {
            for (auto x : adjlist[host[i]]) {
                if (adjlist[x][host[i]] == 0) {
                    adjlist[i][x] = 0;
                    adjlist[x][i] = 0;
                }
            }
            adjlist[host[i]][i] = 0;
            adjlist[i][host[i]] = 0;
        }
    }
 
    vector<vector<int>> newadj(n+1, vector<int>());
 
    for (int i=0;i<n;i++) {
        for (int j=0;j<n;j++) {
            if (adjlist[i][j]) {
                newadj[i].push_back(j);
                newadj[j].push_back(i);
            }
        }
    }
 
    int ans = 0;
    if (protocol[1] == 1) {
        for (int i=0;i<n;i++) {
            ans += confidence[i];
        }
    }
 
    else if (protocol[1] == 2) {
        for (int i=0;i<n;i++) {
            ans = max(ans, confidence[i]);
        }
    }
 
 
    return ans;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	860 KB	Output is correct
2	Correct	2 ms	2140 KB	Output is correct
3	Correct	2 ms	2652 KB	Output is correct
4	Correct	7 ms	9232 KB	Output is correct
5	Correct	10 ms	11608 KB	Output is correct
6	Correct	3 ms	2908 KB	Output is correct
7	Correct	3 ms	3312 KB	Output is correct
8	Correct	8 ms	10328 KB	Output is correct
9	Correct	8 ms	7260 KB	Output is correct
10	Correct	11 ms	12580 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2908 KB	Output is correct
2	Correct	11 ms	11612 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	6 ms	7772 KB	Output is correct
5	Correct	10 ms	11472 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	1884 KB	Output is correct
8	Correct	2 ms	2648 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	11 ms	12512 KB	Output is correct