Submission #615013

# Submission time Handle Problem Language Result Execution time Memory
615013 2022-07-31T06:09:13 Z cheissmart Friend (IOI14_friend) C++14
11 / 100
41 ms 3952 KB
#include "friend.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7, N = 10;

vi G[N];

int findSample(int n, int a[], int host[], int op[]) {
	for(int i = 1; i < n; i++) {
		if(op[i] == 0) {
			G[host[i]].PB(i);
			G[i].PB(host[i]);
		} else if(op[i] == 1) {
			for(int j:G[host[i]]) {
				G[j].PB(i);
				G[i].PB(j);
			}
		} else {
			for(int j:G[host[i]]) {
				G[j].PB(i);
				G[i].PB(j);
			}
			G[host[i]].PB(i);
			G[i].PB(host[i]);
		}
	}
	int ans = 0;
	for(int mask = 0; mask < (1 << n); mask++) {
		int sum = 0;
		for(int i = 0; i < n; i++)
			sum += (mask >> i & 1) ? a[i] : 0;
		bool bad = false;
		for(int i = 0; i < n; i++) if(mask >> i & 1)
			for(int j:G[i]) {
				if(mask >> j & 1)
					bad = true;
			}
		if(bad) continue;
		ans = max(ans, sum);
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 4 ms 312 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 444 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 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 -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 316 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Runtime error 41 ms 3952 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -