oj.uz

Submission #1015392

# Submission time Handle Problem Language Result Execution time Memory
1015392 2024-07-06T10:03:57 Z amirhoseinfar1385 Friend (IOI14_friend) C++17
0 / 100
 2 ms 12740 KB 
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
struct node{
	int w,vas;
	node(){
		w=vas=0;
	}
	set<int>adj,revadj;
};
node alln[maxn];
int nem[maxn],miad[maxn],jam[maxn],te=4;

void comp(int v,int u,int val,int no){
	if(no==0){
		nem[v]=te;
		miad[v]=te+1;
		jam[v]=te+2;
		alln[jam[v]].vas=1;
		alln[miad[v]].w=val;
		alln[jam[v]].adj.insert(nem[v]);
		alln[jam[v]].adj.insert(miad[v]);
		te+=3;
		alln[miad[u]].adj.insert(nem[v]);
		alln[nem[u]].adj.insert(jam[v]);
	}else if(no==1){

	}else{

	}
}

void calc(int u){
	if(alln[u].vas==1){
		for(auto x:alln[u].adj){
			calc(x);
			alln[u].w=max(alln[u].w,alln[x].w);
		}
	}else{
		for(auto x:alln[u].adj){
			calc(x);
			alln[u].w+=alln[x].w;
		}
	}
}

int findSample(int n,int confidence[],int host[],int protocol[]){
	nem[0]=0;
	miad[0]=1;
	jam[0]=2;
	alln[jam[0]].vas=1;
	alln[jam[0]].adj.insert(0);
	alln[jam[0]].adj.insert(1);
	for(int i=1;i<n;i++){
		comp(i,host[i],confidence[i],protocol[i]);
	}
	calc(jam[0]);
	return alln[jam[0]].w;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Incorrect 2 ms 12636 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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