oj.uz

답안 #138390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138390 2019-07-29T20:40:48 Z Nucleist 친구 (IOI14_friend) C++14
27 / 100
 38 ms 2812 KB 
#include <bits/stdc++.h> 
#include "friend.h"
using namespace std; 
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)x.size()
#define ll long long
#define INF 1000000000
#define pb push_back
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
int weight[1001];
int visited[1001];
vector<int>adj[12];
int dal;
int solve(int node)
{
	if(node>=dal){/*debug("fin");*/return 0;}
	int ans = 0;
	if(!visited[node])
	{
		visited[node]++;
		for (int i = 0; i < adj[node].size(); ++i)
		{
			int next = adj[node][i];
			visited[next]++;
		}
		ans=max(ans,solve(node+1)+weight[node]);
		//debugs(node,ans);
		for (int i = 0; i < adj[node].size(); ++i)
		{
			int next = adj[node][i];
			visited[next]--;
		}
		visited[node]--;
	}
	ans = max(ans,solve(node+1));
	return ans;
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
   dal = n;
   int kal = 0;
   int so = 0;
   for (int i = 0; i < n; ++i)
   {
		weight[i]=confidence[i];
		kal+=weight[i];
		so = max(so,weight[i]);
   }
   bool ka = false;
   bool ka1 = false;
   for (int i = 1; i < n; ++i)
   {
   	if(protocol[i]!=2){ka1=true;break;}
   }
   for (int i = 1; i < n; ++i)
   {
   	if(protocol[i]!=1){ka=true;break;}
   }
   if(!ka)return kal;
   if(!ka1)return so;
   for (int i = 1; i < dal; ++i)
  {
  	int now = host[i];
  	int prot = protocol[i];
  	int newi = i;
  	if(prot==0 || prot==2)
  	{
  		adj[now].pb(newi);
  		adj[newi].pb(now);
  	}
  	if(prot==1 || prot==2)
  	{
  		////debugs(newi,now);
  		int vol = adj[now].size();
  		for (int j = 0; j < adj[now].size(); ++j)
  		{
  			int neigh = adj[now][j];
  			//(neigh);
  			adj[neigh].pb(newi);
  			adj[newi].pb(neigh);
  		}
  	}
  }
  return solve(0);
}
//code the AC sol !
// BS/queue/map

Compilation message

friend.cpp: In function 'int solve(int)':
friend.cpp:28:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[node].size(); ++i)
                   ~~^~~~~~~~~~~~~~~~~~
friend.cpp:35:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < adj[node].size(); ++i)
                   ~~^~~~~~~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[now].size(); ++j)
                     ~~^~~~~~~~~~~~~~~~~
friend.cpp:81:9: warning: unused variable 'vol' [-Wunused-variable]
     int vol = adj[now].size();
         ^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 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 348 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 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 380 KB Output is correct
8 Correct 3 ms 292 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 540 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 420 KB Output is correct
2 Correct 2 ms 380 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 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 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 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 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 2812 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -