oj.uz

Submission #69730

# Submission time Handle Problem Language Result Execution time Memory
69730 2018-08-21T12:12:25 Z E869120 Friend (IOI14_friend) C++14
8 / 100
 43 ms 1748 KB 
#include "friend.h"
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;

// Find out best sample

int p[12][12];

int findSample(int n, int confidence[], int host[], int protocol[]) {
	if (n <= 10) {
		for (int i = 1; i <= n - 1; i++) {
			if (protocol[i] == 0) {
				p[host[i]][i] = 1;
				p[i][host[i]] = 1;
			}
			if (protocol[i] == 1) {
				for (int j = 0; j < n; j++) {
					if (p[host[i]][j] == 1) {
						p[j][i] = 1; p[i][j] = 1;
					}
				}
			}
			if (protocol[i] == 2) {
				for (int j = 0; j <= i; j++) {
					p[j][i] = 1; p[i][j] = 1;
				}
			}
		}
		int maxn = 0;
		for (int i = 0; i < (1 << n); i++) {
			vector<int>vec;
			for (int j = 0; j < n; j++) { if ((i / (1 << j)) % 2 == 1) vec.push_back(j); }
			bool OK = true;
			for (int j = 0; j < vec.size(); j++) {
				for (int k = j + 1; k < vec.size(); k++) {
					if (p[vec[j]][vec[k]] == 1) OK = false;
				}
			}
			if (OK == false) continue;
			int bit = 0; for (int j = 0; j < vec.size(); j++) bit += confidence[vec[j]];
			maxn = max(maxn, bit);
		}
		return maxn;
	}
	else {
		int maxn = 0;
		for (int i = 0; i < n; i++) maxn = max(maxn, confidence[i]);
		return maxn;
	}
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:36:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < vec.size(); j++) {
                    ~~^~~~~~~~~~~~
friend.cpp:37:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int k = j + 1; k < vec.size(); k++) {
                         ~~^~~~~~~~~~~~
friend.cpp:42:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    int bit = 0; for (int j = 0; j < vec.size(); j++) bit += confidence[vec[j]];
                                 ~~^~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 452 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 3 ms 624 KB Output is correct
8 Correct 2 ms 648 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 648 KB Output is correct
11 Correct 2 ms 648 KB Output is correct
12 Correct 3 ms 648 KB Output is correct
13 Correct 3 ms 648 KB Output is correct
14 Correct 2 ms 648 KB Output is correct
15 Correct 2 ms 648 KB Output is correct
16 Correct 3 ms 648 KB Output is correct
17 Incorrect 3 ms 648 KB Output isn't correct

Subtask #2
0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 648 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 3 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Incorrect 2 ms 764 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 764 KB Output is correct
2 Correct 2 ms 764 KB Output is correct
3 Correct 2 ms 764 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 2 ms 764 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Incorrect 2 ms 764 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 764 KB Output is correct
2 Correct 2 ms 764 KB Output is correct
3 Correct 2 ms 764 KB Output is correct
4 Correct 2 ms 764 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 2 ms 764 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 2 ms 764 KB Output is correct
9 Correct 3 ms 764 KB Output is correct
10 Correct 2 ms 764 KB Output is correct
11 Correct 2 ms 764 KB Output is correct
12 Incorrect 43 ms 1748 KB Output isn't correct
13 Halted 0 ms 0 KB -