Submission #129510

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
129510	2019-07-12T11:35:20 Z	antimirage	Friend (IOI14_friend)	C++14	0 / 100	38 ms	4088 KB

friend

#include "friend.h"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 15;

vector <int> g[N], vec;

int u[N], dp[1 << 15], ans, sum;


int findSample(int n, int val[], int batya[], int type[]) {
	
	for (int i = 1; i < n; i++) {
		
		if (type[i] == 0) {
			g[batya[i]].pb(i);
			g[i].pb(batya[i]);
		}
		else if (type[i] == 1) {
			for (auto it: g[batya[i]]) {
				g[i].pb(it);
				g[it].pb(i);
			}
		}
		else {
			g[batya[i]].pb(i);
			g[i].pb(batya[i]);
		
			for (auto it: g[batya[i]]) {
				g[i].pb(it);
				g[it].pb(i);
			}
		}
	}
	for (int mask = 0; mask < (1 << n); mask++) {
		memset(u, 0, sizeof(u));
		sum = 0;
		for (int j = 0; j < n; j++) {
			if (mask>>j&1)
				u[j] = 1, sum += val[j];
		}
		bool fl = 1;
		for (int j = 0; j < n; j++) {
			if (u[j] == 0) continue;
			for (auto to : g[j]) {
				if (u[to])
					fl = 0;
			}
		}
		if (fl)
			ans = max(ans, sum);
	}
	return ans;
}

Subtask #1

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	408 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	504 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	372 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Incorrect	2 ms	380 KB	Output isn't correct

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	504 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	504 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Runtime error	3 ms	632 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Runtime error	38 ms	4088 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Halted	0 ms	0 KB	-