oj.uz

Submission #809038

# Submission time Handle Problem Language Result Execution time Memory
809038 2023-08-05T14:28:57 Z Kerim Friend (IOI14_friend) C++17
27 / 100
 22 ms 4436 KB 
#include "friend.h"
#include "bits/stdc++.h"
#define pb(x) push_back(x)
using namespace std;
const int N = 1005;
vector<int> adj[N];

void add_edge(int u, int v){
	adj[u].pb(v);
	adj[v].pb(u);
}
int findSample(int n,int arr[],int host[],int protocol[]){
	for (int i = 0; i < n; i++)
		adj[i].clear();
	bool subtask2 = true, subtask3 = true;
	for (int i = 1; i < n; i++){
		int v = host[i], p = protocol[i];
		subtask2 &= (p == 1);
		subtask3 &= (p == 2);
		if (p == 0)//IAmYourFriend
			add_edge(v, i);
		else if(p == 1){//MyFriendsAreYourFriends
			for (auto to: adj[v])
				add_edge(to, i);
		}
		else{//WeAreYourFriends
			for (auto to: adj[v])
				add_edge(to, i);
			add_edge(v, i);
		}
	}
	int answer = 0;
	if (n <= 10){//subtask1
		for (int mask = 0; mask < (1<<n); mask++){
			bool bad = 0;
			int sum = 0;
			for (int i = 0; i < n; i++)
				if (mask>>i&1){
					sum += arr[i];
					for (auto to: adj[i])
						bad |= (mask>>to&1);
				}
			if (!bad)
				answer = max(answer, sum);
		}
	}
	else if(subtask2){
		for (int i = 0; i < n; i++)
			answer += arr[i];
	}
	else if (subtask3){
		for (int i = 0; i < n; i++)
			answer = max(answer, arr[i]);
	}
	return answer;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 6 ms 4180 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 3 ms 3028 KB Output is correct
5 Correct 6 ms 4052 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 1104 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 5 ms 4436 KB Output is correct

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Runtime error 22 ms 2744 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -