oj.uz

답안 #50741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50741 2018-06-13T06:35:44 Z Just_Solve_The_Problem 친구 (IOI14_friend) C++11
11 / 100
 1000 ms 17980 KB 
#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

#define pb push_back
#define sz(s) (int)s.size()

const int N = (int)1e5 + 7;
const int smN = (int)1e3 + 7;

vector < int > gr[N];
int has[smN][smN];

void addedge(int a, int b) {
  gr[a].pb(b);
  gr[b].pb(a);
  has[a][b] = has[b][a] = 1;
}

int findSample(int n, int confidence[], int host[], int protocol[]){
  int ans = 0;
  for (int i = 1; i < n; i++) {
    if (protocol[i] == 0 || protocol[i] == 2) {
      addedge(host[i], i);
    }
    if (protocol[i] == 1 || protocol[i] == 2) {
      for (int to : gr[host[i]]) {
        addedge(to, i);
      }
    }
  }
  for (int mask = 0; mask < (1 << n); mask++) {
    vector < int > v;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        v.pb(i);
      }
    }
    int res = 0;
    bool ok = 1;
    for (int i = 0; i < sz(v) && ok; i++) {
      for (int j = i + 1; j < sz(v) && ok; j++) {
        if (has[v[i]][v[j]]) {
          ok = 0;
        }
      }
    }
    if (ok) {
      for (int to : v) {
        res += confidence[to];
      }
    }
    ans = max(ans, res);
  }
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2792 KB Output is correct
3 Correct 5 ms 2792 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 2900 KB Output is correct
6 Correct 4 ms 2948 KB Output is correct
7 Correct 4 ms 2948 KB Output is correct
8 Correct 5 ms 2948 KB Output is correct
9 Correct 5 ms 2948 KB Output is correct
10 Correct 5 ms 2948 KB Output is correct
11 Correct 5 ms 2976 KB Output is correct
12 Correct 6 ms 2976 KB Output is correct
13 Correct 4 ms 2976 KB Output is correct
14 Correct 5 ms 2976 KB Output is correct
15 Correct 4 ms 2976 KB Output is correct
16 Correct 5 ms 2976 KB Output is correct
17 Correct 5 ms 2976 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 2976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 6760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6760 KB Output is correct
2 Correct 4 ms 6760 KB Output is correct
3 Correct 4 ms 6760 KB Output is correct
4 Correct 4 ms 6760 KB Output is correct
5 Incorrect 8 ms 10100 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 10100 KB Output is correct
2 Correct 5 ms 10100 KB Output is correct
3 Correct 5 ms 10100 KB Output is correct
4 Correct 4 ms 10100 KB Output is correct
5 Correct 4 ms 10100 KB Output is correct
6 Correct 5 ms 10100 KB Output is correct
7 Correct 4 ms 10100 KB Output is correct
8 Correct 5 ms 10100 KB Output is correct
9 Incorrect 9 ms 10168 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10168 KB Output is correct
2 Correct 4 ms 10168 KB Output is correct
3 Correct 5 ms 10168 KB Output is correct
4 Correct 5 ms 10168 KB Output is correct
5 Correct 5 ms 10168 KB Output is correct
6 Correct 4 ms 10168 KB Output is correct
7 Correct 5 ms 10168 KB Output is correct
8 Correct 5 ms 10168 KB Output is correct
9 Correct 4 ms 10168 KB Output is correct
10 Correct 4 ms 10168 KB Output is correct
11 Correct 4 ms 10168 KB Output is correct
12 Runtime error 52 ms 17980 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -