# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
69731 | 2018-08-21T12:17:04 Z | E869120 | 친구 (IOI14_friend) | C++14 | 35 ms | 1788 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 || protocol[i] == 2) { p[host[i]][i] = 1; p[i][host[i]] = 1; } if (protocol[i] == 1 || protocol[i] == 2) { for (int j = 0; j < n; j++) { if (p[host[i]][j] == 1) { 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 488 KB | Output is correct |
3 | Correct | 3 ms | 488 KB | Output is correct |
4 | Correct | 2 ms | 540 KB | Output is correct |
5 | Correct | 2 ms | 620 KB | Output is correct |
6 | Correct | 2 ms | 620 KB | Output is correct |
7 | Correct | 3 ms | 620 KB | Output is correct |
8 | Correct | 2 ms | 620 KB | Output is correct |
9 | Correct | 2 ms | 620 KB | Output is correct |
10 | Correct | 3 ms | 620 KB | Output is correct |
11 | Correct | 2 ms | 620 KB | Output is correct |
12 | Correct | 3 ms | 620 KB | Output is correct |
13 | Correct | 3 ms | 620 KB | Output is correct |
14 | Correct | 3 ms | 636 KB | Output is correct |
15 | Correct | 3 ms | 636 KB | Output is correct |
16 | Correct | 3 ms | 636 KB | Output is correct |
17 | Correct | 2 ms | 636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 636 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 636 KB | Output is correct |
2 | Correct | 2 ms | 636 KB | Output is correct |
3 | Correct | 3 ms | 636 KB | Output is correct |
4 | Correct | 2 ms | 636 KB | Output is correct |
5 | Correct | 3 ms | 636 KB | Output is correct |
6 | Correct | 3 ms | 636 KB | Output is correct |
7 | Correct | 2 ms | 636 KB | Output is correct |
8 | Correct | 2 ms | 636 KB | Output is correct |
9 | Correct | 2 ms | 636 KB | Output is correct |
10 | Correct | 4 ms | 636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 636 KB | Output is correct |
2 | Correct | 3 ms | 636 KB | Output is correct |
3 | Correct | 3 ms | 636 KB | Output is correct |
4 | Correct | 3 ms | 636 KB | Output is correct |
5 | Incorrect | 3 ms | 636 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 636 KB | Output is correct |
2 | Correct | 2 ms | 636 KB | Output is correct |
3 | Correct | 2 ms | 636 KB | Output is correct |
4 | Correct | 2 ms | 636 KB | Output is correct |
5 | Correct | 2 ms | 636 KB | Output is correct |
6 | Correct | 4 ms | 636 KB | Output is correct |
7 | Correct | 2 ms | 636 KB | Output is correct |
8 | Correct | 2 ms | 636 KB | Output is correct |
9 | Incorrect | 3 ms | 636 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 640 KB | Output is correct |
2 | Correct | 2 ms | 640 KB | Output is correct |
3 | Correct | 2 ms | 640 KB | Output is correct |
4 | Correct | 2 ms | 640 KB | Output is correct |
5 | Correct | 2 ms | 756 KB | Output is correct |
6 | Correct | 2 ms | 756 KB | Output is correct |
7 | Correct | 2 ms | 756 KB | Output is correct |
8 | Correct | 3 ms | 756 KB | Output is correct |
9 | Correct | 3 ms | 756 KB | Output is correct |
10 | Correct | 3 ms | 756 KB | Output is correct |
11 | Correct | 2 ms | 756 KB | Output is correct |
12 | Incorrect | 35 ms | 1788 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |