Submission #236994

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
236994	2020-06-04T07:50:40 Z	crossing0ver	Friend (IOI14_friend)	C++17	0 / 100	1000 ms	8312 KB

friend

#include<bits/stdc++.h>
#include "friend.h"
using namespace std;
const int MAXN = 1E5+5;
int n,val[MAXN];
vector<int> adj[MAXN];
int case1(){
	int mxval = 0;
	for (int i = 0; i < (1 << n); i++) {
		vector<int> x;
		for (int j = 0; j < n; j++) {
			if ( (1 << j) & i) 
				x.push_back(j);
		}
		bool flag = 1;
		for (int j = 0; j < x.size(); j++) {
			for (int k = 0; k < j; k++) {
				for (int h : adj[x[j]])
					if (h == x[k]) flag = 0;
			}
		}
		if (flag) {
			int s = 0;
			for (int j:x) s += val[j];
			mxval = max(mxval,s);
		}
	}
	return mxval;
}
int findSample(int n1,int confidence[],int host[],int protocol[]){
	n = n1;
	int type[] = {1,1,1};
	for (int i =0; i < n; i++) val[i] = confidence[i];
	for (int i = 1; i < n; i++) {
		int x = protocol[i];
		int v = host[i];
		for (int j =0; j< 3; j++) if (x != j ) type[j] = 0;
		if (x == 0) {
			adj[v].push_back(i);
			adj[i].push_back(v);
		}
		else {
			for (int f:adj[v]) adj[i].push_back(f);
			if (x == 2) {
				adj[i].push_back(v);
				adj[v].push_back(i);
			}
		}
	}
	if (n <= 10) return case1();
	else while(true){
		
	}

}

Compilation message

friend.cpp: In function 'int case1()':
friend.cpp:16:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < x.size(); j++) {
                   ~~^~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:32:6: warning: variable 'type' set but not used [-Wunused-but-set-variable]
  int type[] = {1,1,1};
      ^~~~

Subtask #1

0 / 11.0

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

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1095 ms	2688 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1085 ms	2688 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	6 ms	2688 KB	Output is correct
5	Execution timed out	1095 ms	2688 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	7 ms	2816 KB	Output is correct
5	Correct	6 ms	2688 KB	Output is correct
6	Correct	6 ms	2688 KB	Output is correct
7	Correct	6 ms	2688 KB	Output is correct
8	Correct	6 ms	2688 KB	Output is correct
9	Execution timed out	1091 ms	2688 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	2688 KB	Output is correct
2	Correct	6 ms	2688 KB	Output is correct
3	Correct	6 ms	2688 KB	Output is correct
4	Correct	6 ms	2688 KB	Output is correct
5	Correct	6 ms	2688 KB	Output is correct
6	Correct	6 ms	2688 KB	Output is correct
7	Correct	6 ms	2688 KB	Output is correct
8	Correct	6 ms	2688 KB	Output is correct
9	Correct	6 ms	2688 KB	Output is correct
10	Correct	6 ms	2688 KB	Output is correct
11	Correct	6 ms	2688 KB	Output is correct
12	Execution timed out	1090 ms	8312 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-