# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
50489 | 2018-06-11T06:55:10 Z | mirbek01 | 친구 (IOI14_friend) | C++17 | 36 ms | 1788 KB |
#include "friend.h" #include <bits/stdc++.h> using namespace std; const int N = 1e3 + 2; int n, g[N][N]; // Find out best sample int findSample(int N,int confidence[],int host[],int protocol[]){ n = N; int ans = 0; if(n <= 10){ for(int i = 1; i < n; i ++){ if(protocol[i]){ for(int j = 0; j < n; j ++){ if(g[host[i]][j]) g[j][i] = g[i][j] = 1; } } if(protocol[i] != 1){ g[i][host[i]] = g[host[i]][i] = 1; } } for(int mask = 0; mask < (1 << n); mask ++){ vector <int> v; int sum = 0; for(int i = 0; i < n; i ++){ int bit = (1 << i) & mask; if(bit){ sum += confidence[i]; v.push_back(i); } } bool fl = 1; for(int i = 0; i < v.size(); i ++){ for(int j = i + 1; j < v.size(); j ++){ if(g[v[i]][v[j]]){ fl = 0; } } } if(fl) ans = max(ans, sum); } } else { if(protocol[n - 1] == 2){ for(int i = 0; i < n; i ++) ans = max(ans, confidence[i]); } else if(protocol[0]){ for(int i = 0; i < n; i ++){ for(int j = i + 1; j < n; j ++){ if(!g[i][j]) ans = max(ans, confidence[i] + confidence[j]); } } } } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 2 ms | 508 KB | Output is correct |
5 | Correct | 2 ms | 524 KB | Output is correct |
6 | Correct | 3 ms | 524 KB | Output is correct |
7 | Correct | 2 ms | 624 KB | Output is correct |
8 | Correct | 2 ms | 624 KB | Output is correct |
9 | Correct | 2 ms | 624 KB | Output is correct |
10 | Correct | 2 ms | 624 KB | Output is correct |
11 | Correct | 2 ms | 624 KB | Output is correct |
12 | Correct | 2 ms | 624 KB | Output is correct |
13 | Correct | 2 ms | 624 KB | Output is correct |
14 | Correct | 2 ms | 708 KB | Output is correct |
15 | Correct | 2 ms | 708 KB | Output is correct |
16 | Correct | 2 ms | 708 KB | Output is correct |
17 | Correct | 2 ms | 708 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 708 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 708 KB | Output is correct |
2 | Correct | 2 ms | 708 KB | Output is correct |
3 | Correct | 2 ms | 708 KB | Output is correct |
4 | Correct | 2 ms | 708 KB | Output is correct |
5 | Correct | 2 ms | 708 KB | Output is correct |
6 | Correct | 2 ms | 708 KB | Output is correct |
7 | Correct | 2 ms | 708 KB | Output is correct |
8 | Correct | 2 ms | 708 KB | Output is correct |
9 | Correct | 2 ms | 708 KB | Output is correct |
10 | Correct | 2 ms | 736 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 736 KB | Output is correct |
2 | Correct | 2 ms | 736 KB | Output is correct |
3 | Correct | 2 ms | 736 KB | Output is correct |
4 | Correct | 2 ms | 736 KB | Output is correct |
5 | Incorrect | 2 ms | 736 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 736 KB | Output is correct |
2 | Correct | 2 ms | 736 KB | Output is correct |
3 | Correct | 2 ms | 736 KB | Output is correct |
4 | Correct | 2 ms | 736 KB | Output is correct |
5 | Correct | 2 ms | 736 KB | Output is correct |
6 | Correct | 2 ms | 736 KB | Output is correct |
7 | Correct | 2 ms | 744 KB | Output is correct |
8 | Correct | 2 ms | 744 KB | Output is correct |
9 | Incorrect | 2 ms | 744 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 744 KB | Output is correct |
2 | Correct | 2 ms | 744 KB | Output is correct |
3 | Correct | 2 ms | 744 KB | Output is correct |
4 | Correct | 2 ms | 744 KB | Output is correct |
5 | Correct | 2 ms | 744 KB | Output is correct |
6 | Correct | 2 ms | 744 KB | Output is correct |
7 | Correct | 2 ms | 744 KB | Output is correct |
8 | Correct | 2 ms | 744 KB | Output is correct |
9 | Correct | 3 ms | 744 KB | Output is correct |
10 | Correct | 2 ms | 744 KB | Output is correct |
11 | Correct | 2 ms | 744 KB | Output is correct |
12 | Incorrect | 36 ms | 1788 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |