oj.uz

답안 #208298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208298 2020-03-10T15:36:27 Z Sorting 친구 (IOI14_friend) C++14
11 / 100
 1000 ms 10616 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

const int kN = 1007;

set<int> adj[kN];

int findSample(int n, int confidence[], int host[], int protocol[]){
	for(int i = 1; i < n; ++i){
		if(protocol[i] == 0){
			adj[i].insert(host[i]);
			adj[host[i]].insert(i);
		}
		else if(protocol[i] == 1){
			adj[i] = adj[host[i]];
			for(int to: adj[host[i]])
				adj[to].insert(i);
		}
		else if(protocol[i] == 2){
			adj[i] = adj[host[i]];
			for(int to: adj[host[i]])
				adj[to].insert(i);

			adj[i].insert(host[i]);
			adj[host[i]].insert(i);
		}
	}

	int ans = 0;
	for(int state = 0; state < (1 << n); ++state){
		int curr_ans = 0;
		for(int i = 0; i < n; ++i)
			if((1 << i) & state)
				curr_ans += confidence[i];

		if(curr_ans <= ans)
			continue;

		bool ok = true;
		for(int i = 0; i < n && ok; ++i){
			if(!(state & (1 << i)))
				continue;

			for(int j = i + 1; j < n && ok; ++j){
				if(!(state & (1 << j)))
					continue;

				if(adj[i].count(j))
					ok = false;
			}
		}

		if(ok)
			ans = curr_ans;
	}

	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 8952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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